In number theory, 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).
It is a weakened form of Goldbach's conjecture, which states that every even number is the sum 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 in 1975. [3] Chen's theorem is a significant step towards Goldbach's conjecture, and a celebrated application of sieve methods.
Chen's theorem represents the strengthening of a previous result due to Alfréd Rényi, who in 1947 had shown there exists a finite K such that any even number can be written as the sum of a prime number and the product of at most K primes. [4] [5]
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: [6]
In 2022, Daniel R. Johnston, Matteo Bordignon, and Valeriia Starichkova provided an explicit version of Chen's theorem: [7]
which refined upon an earlier result by Tomohiro Yamada. [8] Also in 2024, Bordignon and Starichkova [9] showed that the bound can be lowered to assuming the generalized Riemann hypothesis (GRH) for Dirichlet L-functions.
In 2019, Huixi Li gave a version of Chen's theorem for odd numbers. In particular, Li proved that every sufficiently large odd integer can be represented as [10]
where is prime and has at most 2 prime factors. Here, the factor of 2 is necessitated since every prime (except for 2) is odd, causing to be even. Li's result can be viewed as an approximation to Lemoine's conjecture.