Chen prime
| Named after | Jing Run Chen |
|---|---|
| Publication year | 1973[1] |
| Author of publication | Chen, J. R. |
| First terms | 2, 3, 5, 7, 11, 13 |
| OEIS index | A109611 |
A prime number p is called a Chen prime if p + 2 is either a prime or a product of two primes (also called a semiprime). The even number 2p + 2 therefore satisfies Chen's theorem.
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.
The first few Chen primes are
- 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47, 53, 59, 67, 71, 83, 89, 101, … (sequence A109611 in the OEIS).
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 3x3 magic square of nine Chen primes:[2]
| 17 | 89 | 71 |
| 113 | 59 | 5 |
| 47 | 29 | 101 |
The lower member of a pair of twin primes is by definition a Chen prime. Thus, 3756801695685×2666669 − 1 (having 200700 decimal digits), found by Primegrid, represents the largest known Chen prime as of December 25, 2011.
The largest known Chen prime at that time which is not a twin prime was
having 70301 decimal digits.
Further results
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.
Terence Tao and Ben Green proved in 2005 that there are infinitely many three-term arithmetic progressions of Chen primes. Recently, Binbin Zhou proved that the Chen primes contain arbitrarily long arithmetic progressions.
Notes
- 1.^ Chen primes were first described by Yuan, W. On the Representation of Large Even Integers as a Sum of a Product of at Most 3 Primes and a Product of at Most 4 Primes, Scienca Sinica 16, 157-176, 1973.
References
- ↑ 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. 17: 385–386.
- ↑ Prime Curios! page on 59
External links
- The Prime Pages
- Green, Ben; Tao, Terence (2006). "Restriction theory of the Selberg sieve, with applications". Journal de théorie des nombres de Bordeaux. 18 (1): 147–182. arXiv:math.NT/0405581
. doi:10.5802/jtnb.538. - Weisstein, Eric W. "Chen Prime". MathWorld.
- Zhou, Binbin (2009). "The Chen primes contain arbitrarily long arithmetic progressions". Acta Arith. 138 (4): 301–315. Bibcode:2009AcAri.138..301Z. doi:10.4064/aa138-4-1.