Progress Result
Chen's theorem is one of the strongest theorem-level near misses in the twin-prime story. It proves that infinitely many primes sit 2 away from a number that is either prime or semiprime.
This page explains Chen's theorem in plain language: what it says, why mathematicians treat it as serious progress, and why the result is close to twin primes without actually becoming a twin-prime proof.
Last reviewed: April 2026
In twin-prime language, Chen's theorem says that there are infinitely many primes p such that p + 2 is either also prime or else a semiprime, meaning a product of two primes. So the theorem does not guarantee infinitely many pairs (p, p + 2) where both entries are prime. It guarantees infinitely many cases where the second number is only one step away from that exact target.
A semiprime is simpler than a general composite number because it still has very limited factor structure. For example, 91 = 7 x 13 is semiprime. So Chen's theorem is not saying p + 2 can be any composite at all. It says p + 2 is forced into a narrow almost-prime category. That is why the theorem feels much closer to twin primes than a loose statement about composites would.
Twin primes ask for exact gap-2 pairs where both numbers are prime. Chen's theorem gets one side exactly right and constrains the other side very strongly, but it still leaves open the possibility that p + 2 has two prime factors instead of one. In plain language, the theorem comes extremely close to the twin-prime pattern while still stopping just short of it.
A true twin-prime example is (11, 13). A Chen-type outcome could look like a prime p where p + 2 behaves more like 91, which is 7 x 13. Both situations preserve the same shift by 2, but only the first gives an exact twin-prime pair. This comparison helps explain why Chen's theorem is celebrated without being mistaken for a proof of infinitely many twin primes.
Chen's theorem was already a major achievement because it showed that sieve methods could force prime patterns into a remarkably tight near-twin shape. Long before bounded-gap results, it gave the field one of its clearest theorem-level signs that the twin-prime problem could be approached by proving strong nearby statements first.
The modern twin-prime story includes several kinds of progress: Chen's theorem, bounded gaps, heuristic predictions, and better control of primes in arithmetic progressions. Chen's theorem belongs to the near-miss side of that story. It shows how close theorem-level progress can come to the exact twin-prime pattern without actually settling gap 2.
Use this page when you want a stronger sense of what mathematicians mean by progress that is substantial but still incomplete. It works especially well beside the bounded-gaps page, the difficulty page, and the broader conjecture explainer. Together, those pages make it easier to understand why modern results are impressive without overstating what has been proved.
These links support the theorem, history, and heuristic claims summarized on this page.
Use these links to keep reading or jump back into the live number views.
Use the bounded-gaps page when you want another major near-miss theorem stated in plain language.
The difficulty page explains why the final move from near misses to exact twin primes is so resistant.
Use the conjecture page when you want the exact gap-2 claim that Chen's theorem does not yet prove.
Theory keeps Chen, bounded gaps, and other progress pages in a broader research frame.