PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: High
Chen's theorem (Theorem)

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 \times 19$ , $7 + 5 \times 11$ , $11 + 3 \times 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.

Bibliography

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.
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 $(p_1 + p_2)$ or $(p_1 + p_2p_3)$ ,'' J. London Math. Soc. 10 (1975), 500 - 506




"Chen's theorem" is owned by PrimeFan. [ full author list (2) | owner history (1) ]
(view preamble | get metadata)

View style:

Log in to rate this entry.
(view current ratings)

Cross-references: OEIS, sequence, Levy's conjecture, represent, odd, even, odd numbers, conjecture, integer, positive, representations, number, inequality, bilinear form, upper bounds, functions, reduction, proof, Chen Jingrun, mean, semiprime, primes, sum, even integer, theorem
There are 3 references to this entry.

This is version 6 of Chen's theorem, born on 2006-10-13, modified 2008-08-30.
Object id is 8456, canonical name is ChensTheorem.
Accessed 1887 times total.

Classification:
AMS MSC11N05 (Number theory :: Multiplicative number theory :: Distribution of primes)

Pending Errata and Addenda
None.
[ View all 3 ]
Discussion
Style: Expand: Order:
forum policy
Conjecture by jirka on 2008-09-07 02:11:06
As corrections do not appear to be working, I will just post a comment to the entry.

1) The conjecture with my name on it, is in no way originally due to me. I had no insight, had done no work, and most of all, the behviour had been noticed much much earlier. I wanted my name removed, to no avail.

2) The reader might note that the Levy conjecture as linked from this entry gives what remains (the odd case). I.e., there is no new conjecture on this page in the first place.

3) For further reading, read my correction and the response. It is the essence of why I'm not contributing to planetmath anymore.
[ reply | up ]

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)