Concerns twin primes, pairs of primes that differ by exactly two, such as (3, 5), (11, 13) and (10,006,427, 10,006,429). Euclid's proof that primes themselves never run out is ancient, but whether the much rarer twin PAIRS also never run out was first clearly posed in its modern form by the French mathematician Alphonse de Polignac in 1849 (not yet a live entity on this atlas), as a special case of a broader conjecture about prime gaps of any fixed even size. A major advance came in 2013, when Yitang Zhang proved that some fixed gap smaller than 70 million recurs infinitely often, a breakthrough rapidly improved by other mathematicians' collaborative Polymath project to a gap of 246; the full conjecture, a gap of exactly two, remains unproven.
Facts
StatementThere are infinitely many prime numbers p such that p plus two is also prime. 2 Proposed YearFirst clearly posed in its modern form by Alphonse de Polignac in 1849, as a special case of a broader conjecture about fixed prime gaps; not yet a live entity on this atlas. Prize StatusNot a Millennium Prize Problem; no major institutional cash prize is offered for its proof. 2 Progress Toward ResolutionYitang Zhang proved in 2013 that some fixed gap below 70 million recurs between consecutive primes infinitely often, the first proof of any bounded gap; the Polymath8 collaborative project rapidly sharpened this to a gap of 246. The full conjecture, a gap of exactly two, remains unproven. 2 Classification
Resolution Status Prize Status
Prize Status (category) Connections
Associated With
Euclid, Mathematicians Euclid's proof that primes never run out is the ancient ancestor result; the modern twin-pair form is a much later, separate conjecture.
Source MacTutor History of Mathematics Archive
The atlas's own still-open conjecture about pairs of primes two apart.
Source Mathematics Atlas Long-Form Articles, First Edition
In Branch
Source MacTutor History of Mathematics Archive
Additional Source Wikipedia: Twin PrimeOpening paragraph
Open Questions
Source MacTutor History of Mathematics Archive
Posed By
First clearly posed the modern form in 1849, as the k=1 case of his own broader conjecture about fixed prime gaps.
Source Wolfram MathWorld
Additional Source Wikipedia: Twin PrimeTwin prime conjecture section
Sources
1. Wikipedia: Twin Prime
Wikimedia FoundationTwin prime conjecture
It is unknown whether there are infinitely many twin primes (the so-called twin prime conjecture) or if there is a largest pair.
- Lead section
Posed By: Alphonse de Polignac, Twin prime conjecture section
In 1849, de Polignac made the more general conjecture that for every natural number k, there are infinitely many primes p such that p + 2k is also prime. The case k = 1 of de Polignac's conjecture is the twin prime conjecture.
In Branch: Number Theory, Opening paragraph
The question of whether there exist infinitely many twin primes has been one of the great open questions in number theory for many years.
View the Source 2. MacTutor History of Mathematics Archive
University of St Andrews, School of Mathematics and Statistics
Open Questions (1 open question)
Do infinitely many twin prime pairs really exist, or does the last one eventually appear?
2013's breakthrough (Yitang Zhang, later sharpened by the Polymath collaborative project to a gap of 246) proved infinitely many prime pairs exist within SOME bounded gap, but closing that gap all the way down to exactly two, the original conjecture, remains open.
What would resolve this A proof narrowing the proven bounded gap (currently 246) all the way to 2, or a fundamentally different argument establishing the gap-2 case directly.
Analytic number theoryMacTutor History of Mathematics Archive
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.