Jurkat–Richert Theorem
   HOME

TheInfoList



OR:

The Jurkat–Richert theorem is a
mathematical theorem In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical c ...
in sieve theory. It is a key ingredient in proofs of
Chen's theorem In number theory, Chen's theorem states that every sufficiently large parity (mathematics), even number can be written as the sum of either two prime number, primes, or a prime and a semiprime (the product of two primes). It is a weakened form o ...
on
Goldbach's conjecture Goldbach's conjecture is one of the oldest and best-known list of unsolved problems in mathematics, unsolved problems in number theory and all of mathematics. It states that every even and odd numbers, even natural number greater than 2 is the ...
. It was proved in 1965 by Wolfgang B. Jurkat and Hans-Egon Richert.


Statement of the theorem

This formulation is from Diamond & Halberstam. Other formulations are in Jurkat & Richert, Halberstam & Richert, and Nathanson. Suppose ''A'' is a finite sequence of integers and ''P'' is a set of primes. Write ''A''''d'' for the number of items in ''A'' that are divisible by ''d'', and write ''P''(''z'') for the product of the elements in ''P'' that are less than ''z''. Write ω(''d'') for a
multiplicative function In number theory, a multiplicative function is an arithmetic function f of a positive integer n with the property that f(1)=1 and f(ab) = f(a)f(b) whenever a and b are coprime. An arithmetic function is said to be completely multiplicative (o ...
such that ω(''p'')/''p'' is approximately the proportion of elements of ''A'' divisible by ''p'', write ''X'' for any convenient approximation to , ''A'', , and write the remainder as : r_A (d) = \left, A_d \ - \frac X. Write ''S''(''A'',''P'',''z'') for the number of items in ''A'' that are relatively prime to ''P''(''z''). Write : V(z) = \prod_ \left( 1 - \frac \right). Write ν(''m'') for the number of distinct prime divisors of ''m''. Write ''F''1 and ''f''1 for functions satisfying certain difference differential equations (see Diamond & Halberstam for the definition and properties). We assume the dimension (sifting density) is 1: that is, there is a constant ''C'' such that for 2 ≤ ''z'' < ''w'' we have : \prod_ \left( 1 - \frac \right)^ \le \left( \frac \right) \left( 1 + \frac \right). (The book of Diamond & Halberstam extends the theorem to dimensions higher than 1.) Then the Jurkat–Richert theorem states that for any numbers ''y'' and ''z'' with 2 ≤ ''z'' ≤ ''y'' ≤ ''X'' we have : S(A,P,z) \le XV(z) \left( F_1 \left(\frac \right) + O\left(\frac\right) \right) + \sum_ 4^ \left, r_A(m) \ and : S(A,P,z) \ge XV(z) \left( f_1 \left(\frac \right) - O\left(\frac\right) \right) - \sum_ 4^ \left, r_A(m) \.


Notes

{{DEFAULTSORT:Jurkat-Richert theorem Sieve theory Theorems in analytic number theory