Inmathematics, a prime number p is called a Chen primeifp + 2 is either a prime or a product of two primes (also called a semiprime). The even number2p + 2 therefore satisfies Chen's theorem.
| Named after | Chen Jingrun |
|---|---|
| Publication year | 1973[1] |
| Author of publication | Chen, J. R. |
| First terms | 2, 3, 5, 7, 11, 13 |
| OEIS index |
|
The Chen primes are named after Chen Jingrun, who proved in 1966 that there are infinitely many such primes. This result would also follow from the truth of the twin prime conjecture as the lower member of a pair of twin primes is by definition a Chen prime.
The first few Chen primes are
The first few Chen primes that are not the lower member of a pair of twin primes are
The first few non-Chen primes are
All of the supersingular primes are Chen primes.
Rudolf Ondrejka discovered the following 3 × 3 magic square of nine Chen primes:[2]
| 17 | 89 | 71 |
| 113 | 59 | 5 |
| 47 | 29 | 101 |
As of March 2018[update], the largest known Chen prime is 2996863034895 × 21290000 − 1, with 388342 decimal digits.
The sum of the reciprocals of Chen primes converges.[citation needed]
Chen also proved the following generalization: For any even integer h, there exist infinitely many primes p such that p + h is either a prime or a semiprime.
Ben Green and Terence Tao showed that the Chen primes contain infinitely many arithmetic progressions of length 3.[3] Binbin Zhou generalized this result by showing that the Chen primes contain arbitrarily long arithmetic progressions.[4]