Jump to content

Chen's theorem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Synthebot (talk | contribs) at 08:54, 16 December 2012 (r2.7.3) (Robot: Removing ja:陳景潤の定理). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Chen Jingrun

Chen's theorem states that every sufficiently large even number can be written as the sum of either two primes, or a prime and a semiprime (the product of two primes). The theorem was first stated by Chinese mathematician Chen Jingrun in 1966,[1] with further details of the proof in 1973.[2] His original proof was much simplified by P. M. Ross.[3] Chen's theorem is a giant step towards the Goldbach conjecture, and a remarkable result of the sieve methods.

Chen's 1973 paper stated two results with nearly identical proofs.[2]: 158  His Theorem I, on the Goldbach conjecture, was stated above. His Theorem II is a result on the twin prime conjecture. It states that if h is a positive even integer, there are infinitely many primes p such that p+h is either prime or the product of two primes.

Ying Chun Cai proved the following in 2002:[4]

There exists a natural number N such that every even integer n larger than N is a sum of a prime less than or equal to n0.95 and a number with at most two prime factors.

Notes

  1. ^ Chen, J.R. (1966). "On the representation of a large even integer as the sum of a prime and the product of at most two primes". Kexue Tongbao. 11 (9): 385–386.
  2. ^ a b Chen, J.R. (1973). "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: 157–176.
  3. ^ Ross, P.M. (1975). "On Chen's theorem that each large even number has the form (p1+p2) or (p1+p2p3)". J. London Math. Soc. (2). 10, 4 (4): 500–506. doi:10.1112/jlms/s2-10.4.500.
  4. ^ Cai, Y.C. (2002). "Chen's Theorem with Small Primes". Acta Mathematica Sinica. 18 (3): 597–604. doi:10.1007/s101140200168.

References