Chen prime
Template:Short description Template:Infobox integer sequence In mathematics, 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 as the lower member of a pair of twin primes is by definition a Chen prime.
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 3 × 3 magic square of nine Chen primes:[1]
| 17 | 89 | 71 |
| 113 | 59 | 5 |
| 47 | 29 | 101 |
since March 2018[update]Template:Dated maintenance category (articles)Script error: No such module "Check for unknown parameters"., the largest known Chen prime is Script error: No such module "val". × 2Script error: No such module "val". − 1, with Script error: No such module "val". decimal digits.
The sum of the reciprocals of Chen primes converges.Script error: No such module "Unsubst".
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.
Ben Green and Terence Tao showed that the Chen primes contain infinitely many arithmetic progressions of length 3.[2] Binbin Zhou generalized this result by showing that the Chen primes contain arbitrarily long arithmetic progressions.[3]
References
<templatestyles src="Reflist/styles.css" />
- ↑ Script error: No such module "citation/CS1".
- ↑ Ben Green and Terence Tao, Restriction theory of the Selberg sieve, with applications, Journal de Théorie des Nombres de Bordeaux 18 (2006), pp. 147–182.
- ↑ Binbin Zhou, The Chen primes contain arbitrarily long arithmetic progressions, Acta Arithmetica 138:4 (2009), pp. 301–315.
Script error: No such module "Check for unknown parameters".
External links
- The Prime Pages
- Script error: No such module "Citation/CS1".
- Script error: No such module "Template wrapper".
- Script error: No such module "Citation/CS1".