The Jurkat-Richert theorem is a result in sieve theory, proved by Wolfgang Jurkat and Hans-Egon Richert in 1965. It gives upper and lower bounds on how many integers in a finite sequence remain after integers divisible by a set of primes are sieved out, refining earlier sieve methods with tighter estimates built from multiplicative functions and a difference differential equation. The theorem became a key ingredient in later proofs about the distribution of primes, including Chen's theorem on Goldbach's conjecture. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement Form Connections
Has Statement Form
In Branch
Source Jurkat-Richert theorem (Wikipedia)
Proved By
Source Jurkat-Richert theorem (Wikipedia)
Sources
1. Jurkat-Richert theorem (Wikipedia)
Introduction, second sentence
It was proved in 1965 by Wolfgang B. Jurkat and Hans-Egon Richert.
Proved By: Hans-Egon Richert, Lead
It was proved in 1965 by Wolfgang B. Jurkat and Hans-Egon Richert.
In Branch: Analytic Number Theory, Lead section
The Jurkat-Richert theorem is a mathematical theorem in sieve theory. It is a key ingredient in proofs of Chen's theorem
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.