* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download PDF
Survey
Document related concepts
Law of large numbers wikipedia , lookup
History of trigonometry wikipedia , lookup
Vincent's theorem wikipedia , lookup
Mathematical proof wikipedia , lookup
Georg Cantor's first set theory article wikipedia , lookup
List of important publications in mathematics wikipedia , lookup
Quadratic reciprocity wikipedia , lookup
Nyquist–Shannon sampling theorem wikipedia , lookup
Collatz conjecture wikipedia , lookup
Central limit theorem wikipedia , lookup
List of prime numbers wikipedia , lookup
Brouwer fixed-point theorem wikipedia , lookup
Four color theorem wikipedia , lookup
Fundamental theorem of calculus wikipedia , lookup
Wiles's proof of Fermat's Last Theorem wikipedia , lookup
Transcript
Chen’s theorem∗ PrimeFan† 2013-03-21 21:19:54 Theorem. Every sufficiently large even integer n can be expressed as the sum of two primes p + q, or the sum of a prime and a semiprime p + qr, where p, q and r are all distinct primes. “Sufficiently large” could mean n > 60. For example, 62 can be represented as p + qr in seven different ways: 5 + 3 × 19, 7 + 5 × 11, 11 + 3 × 17, etc. This theorem was proven by Chen Jingrun in 1966 but had to delay publishing his results until 1973 because of political problems in his native China. Chen’s proof has been considered “a highly technical application of sieving methods.” (Eisenstein et al, 2004) Ross simplified Chen’s proof almost a decade later. Still, a summary of the proof can run for dozens of pages. A much shorter, but excessively broad summary that can fit in here goes something like this: reduction to sieving, estimation of sieving functions, search for upper bounds using the Jurkat-Richert theorem, using a bilinear form inequality, and joining together of all these results to create a function that counts the number of representations of a given number as either p + q or p + qr, and showing that that function always returns a positive integer when the given number is sufficiently large. The Zumkeller-Lebl conjecture, an attempt to generalize Chen’s theorem to odd numbers, and unproven as of 2008, states that sufficiently large integers, be they even or odd, can also be represented as p + qr. To represent odd numbers this way, only one of the primes can be 2 (or both q = r = 2). Levy’s conjecture, which applies only to odd numbers, has q = 2 and p and r both odd primes. Sequence A100952 of Sloane’s OEIS lists the known twenty-one small integers that can’t be expressed as specified by the theorem. References [1] J. R. Chen, “On the representation of a larger even integer as the sum of a prime and the product of at most two primes,” Sci. Sinica 16 (1973), 157 176. ∗ hChensTheoremi created: h2013-03-21i by: hPrimeFani version: h38456i Privacy setting: h1i hTheoremi h11N05i † This text is available under the Creative Commons Attribution/Share-Alike License 3.0. You can reuse this document or portions thereof only if you do so under terms that are compatible with the CC-BY-SA license. 1 [2] E. Eisenstein, L. Jain, A. Felix, “A summary of the proof of Chen’s theorem”. Ann Arbor: University of Michigan (2004) [3] P. M. Ross, “On Chen’s theorem that each large even number has the form (p1 + p2 ) or (p1 + p2 p3 ),” J. London Math. Soc. 10 (1975), 500 - 506 2