A Chen prime is a prime number that remains close to primality after 2 is added. The resulting number does not always have to be prime: it may instead be a semiprime, meaning a product of exactly two primes. This small relaxation connects Chen primes to twin primes while making an infinite-result theorem possible.
Definition
A prime number p is a Chen prime when p + 2 is either prime or semiprime. Repeated prime factors are allowed, so numbers such as 9 = 32 and 25 = 52 are semiprimes.
How a Chen Prime Is Defined
The definition begins with a proven prime p. The number two places to its right, p + 2, is then classified by its prime factorization.
Chen Prime Condition
p is prime and p + 2 is prime or semiprime.
This is sometimes written as p + 2 belonging to P ∪ P2, where P represents primes and P2 represents numbers with exactly two prime factors counted with multiplicity.
Prime Case
For p = 11, the number p + 2 is 13. Both numbers are prime, so 11 is a Chen prime and the pair (11, 13) is also a twin-prime pair.
Semiprime Case
For p = 13, the number p + 2 is 15 = 3 × 5. The second number is composite but semiprime, so 13 is still a Chen prime.
The phrase prime pair therefore has a broader meaning here than it does for twin primes. The first member must be prime, while the second member may be prime or a product of two primes.
Small Chen Prime Examples
| Prime p | p + 2 | Classification of p + 2 | Result |
|---|---|---|---|
| 2 | 4 | 2 × 2 | Chen prime |
| 3 | 5 | Prime | Chen prime |
| 5 | 7 | Prime | Chen prime |
| 7 | 9 | 3 × 3 | Chen prime |
| 11 | 13 | Prime | Chen prime |
| 13 | 15 | 3 × 5 | Chen prime |
| 17 | 19 | Prime | Chen prime |
| 19 | 21 | 3 × 7 | Chen prime |
| 23 | 25 | 5 × 5 | Chen prime |
| 29 | 31 | Prime | Chen prime |
| 31 | 33 | 3 × 11 | Chen prime |
| 47 | 49 | 7 × 7 | Chen prime |
The first Chen primes are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47, and 53. Some arise from genuine twin primes, while others arise because the number two places later is semiprime.
Not Every Prime Is a Chen Prime
A prime can fail the Chen condition when adding 2 produces a composite number with more than two prime factors. The number of prime factors is counted with multiplicity.
| Prime p | p + 2 | Prime Factorization | Why It Fails |
|---|---|---|---|
| 43 | 45 | 3 × 3 × 5 | Three prime factors |
| 61 | 63 | 3 × 3 × 7 | Three prime factors |
| 73 | 75 | 3 × 5 × 5 | Three prime factors |
| 79 | 81 | 3 × 3 × 3 × 3 | Four prime factors |
Common Mistake
The fact that p and p + 2 differ by two does not make them twin primes. Both numbers must be prime for a twin-prime pair. A Chen pair may have a semiprime as its second member.
Chen Primes Compared With Twin Primes
Twin primes are pairs of primes separated by two, such as (5, 7), (11, 13), and (29, 31). The smaller member of every twin-prime pair is automatically a Chen prime because adding 2 produces another prime.
The reverse statement is false. For example, 19 is a Chen prime because 19 + 2 = 21 = 3 × 7, but 19 and 21 are not twin primes because 21 is composite.
| Property | Twin Primes | Chen Primes |
|---|---|---|
| First number | Prime | Prime |
| Second number | Must be prime | Prime or semiprime |
| Difference | 2 | 2 |
| Example | 11 and 13 | 13 and 15 |
| Infinitely many proven? | Not currently proven | Yes |
Prime Gap Note
The difference p + 2 − p equals 2, but it is a prime gap only when both endpoints are consecutive primes. A Chen pair ending in a semiprime does not define a prime gap.
What Chen’s Theorem Proves
The Prime-Pair Result
Chen’s theorem proves that there are infinitely many primes p for which p + 2 has at most two prime factors. In other words, infinitely many Chen primes exist.
Chinese mathematician Chen Jingrun announced the result in 1966 and published a detailed proof in 1973. The theorem uses refined sieve methods to move from unrestricted composite values toward numbers that are either prime or very close to prime.
This result approaches the twin prime conjecture without proving it. The twin prime conjecture requires p + 2 to be prime infinitely often. Chen’s theorem permits p + 2 to contain two prime factors, which is a weaker condition but one that can be established.
Research Status — Checked on August 4, 2026
The twin prime conjecture remains an open problem. Chen’s theorem proves infinitely many prime–almost-prime pairs, not infinitely many pairs in which both numbers are prime.
The Related Goldbach Result
Chen’s work also produced a closely related additive theorem: every sufficiently large even integer can be expressed as the sum of a prime and a number having at most two prime factors.
Goldbach-Side Form
N = p + m
Here N is a sufficiently large even integer, p is prime, and m is either prime or semiprime.
This statement is an approximation to the binary Goldbach conjecture, which says that every even integer greater than 2 is the sum of two primes. It is related to Chen primes through the same prime-or-semiprime threshold, but it concerns sums of numbers rather than pairs separated by two.
Why Semiprimes Matter
A semiprime has exactly two prime factors when multiplicity is included. It may be the product of two different primes, such as 15 = 3 × 5, or the square of one prime, such as 49 = 7 × 7.
Sieve methods remove integers divisible by selected small primes and estimate how many candidates remain. These methods are effective at finding numbers with few prime factors, but distinguishing a prime from a product of two primes is much harder. This limitation is associated with the parity problem in sieve theory.
Chen’s method reaches the point at which p + 2 has no more than two prime factors. Replacing “no more than two” with “exactly one” would require proving that p + 2 is prime infinitely often—the unresolved twin prime condition.
One Prime Factor
A prime has one prime factor when multiplicity is counted: the number itself.
Two Prime Factors
A semiprime has two prime factors, such as 21 = 3 × 7 or 25 = 5 × 5.
Three or More
A number such as 45 = 3 × 3 × 5 falls outside the Chen prime condition.
Residue Patterns in Chen Prime Candidates
Every prime greater than 3 has the form 6n − 1 or 6n + 1. This modular pattern helps organize Chen prime candidates, but it cannot prove that a candidate qualifies.
When p = 6n + 1
p + 2 = 6n + 3 = 3(2n + 1)
For p greater than 3 in the 6n + 1 residue class, p + 2 is divisible by 3. It can satisfy the Chen condition only when the remaining factor 2n + 1 is prime. For example, 13 = 6(2) + 1 and 15 = 3 × 5, so 13 qualifies.
The same form does not guarantee success. The prime 43 equals 6(7) + 1, but 43 + 2 = 45 = 3 × 3 × 5. Since 45 has three prime factors, 43 is not a Chen prime.
When p = 6n − 1, the number p + 2 has the form 6n + 1. It may be prime, semiprime, or a composite number with several prime factors. As with the familiar 6n ± 1 prime-candidate filter, the residue class narrows possibilities without proving primality or the Chen condition.
How a Chen Prime Candidate Is Checked
The classification involves two separate calculations. First, p must be proven prime. The factorization of p + 2 then determines whether the prime qualifies.
1. Primality of p
If p is composite, it cannot be a Chen prime regardless of the factorization of p + 2.
2. Factorization of p + 2
A prime value qualifies immediately. A composite value qualifies only when its factorization contains exactly two prime factors.
3. Multiplicity
Repeated factors count separately. Thus 72 has two prime factors, while 34 has four.
A prime number checker can confirm whether the starting value p is prime. Factorization of p + 2 is still needed when that second value is composite.
Example: For p = 47, the starting value is prime and p + 2 = 49 = 7 × 7. Because 49 is semiprime, 47 is a Chen prime.
Counterexample: For p = 103, the starting value is prime but p + 2 = 105 = 3 × 5 × 7. The second value has three prime factors, so 103 is not a Chen prime.
What Chen’s Theorem Does Not Establish
Limits of the Result
- It does not prove that infinitely many twin-prime pairs exist.
- It does not require p + 2 to be prime in every qualifying pair.
- It does not imply that every prime is a Chen prime.
- It does not provide a simple formula that generates only Chen primes.
- It does not turn every difference of two into a prime gap.
The distinction between a prime candidate and a proven prime remains important. Modular patterns and divisibility filters can reject many values quickly, but qualifying a Chen prime requires a primality result for p and a valid classification of p + 2.
Related Number Theory Concepts
Frequently Asked Questions
What is the first Chen prime?
The first Chen prime is 2. It is prime, and 2 + 2 = 4 = 2 × 2 is semiprime.
Are all twin primes Chen primes?
The smaller member of every twin-prime pair is a Chen prime. For example, 11 is a Chen prime because 11 + 2 = 13 is prime.
Are all Chen primes part of twin-prime pairs?
No. The prime 13 is a Chen prime because 15 = 3 × 5 is semiprime, but 13 and 15 are not twin primes.
Why is 43 not a Chen prime?
Although 43 is prime, 43 + 2 = 45 = 3 × 3 × 5. The number 45 has three prime factors rather than one or two.
Can a square be semiprime?
Yes. The square of a prime is semiprime because its factorization contains two copies of that prime. Examples include 9 = 3 × 3 and 49 = 7 × 7.
Does Chen’s theorem prove the twin prime conjecture?
No. Chen’s theorem allows p + 2 to be either prime or semiprime. The twin prime conjecture requires both p and p + 2 to be prime infinitely often.
Are there infinitely many Chen primes?
Yes. Chen’s theorem establishes that infinitely many primes p have p + 2 with at most two prime factors.