|Named after||Jing Run Chen|
|Author of publication||Chen, J. R.|
|First terms||2, 3, 5, 7, 11, 13|
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.
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.
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.
- 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[permanent dead link], Scienca Sinica 16, 157-176, 1973.
- 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: . doi:10.5802/jtnb.538.
- Weisstein, Eric W. "Chen Prime". MathWorld.