Twin primes are pairs of prime numbers that differ from each other by exactly two, such as three and five, eleven and thirteen, or seventeen and nineteen, making them the closest two odd prime numbers can ever be to one another. The twin prime conjecture, one of the oldest unsolved problems in number theory, proposes that infinitely many such pairs exist, a claim still unproved despite being checked computationally for enormous ranges of numbers where the pairs keep appearing. A major advance came in 2013, when the mathematician Yitang Zhang proved that there are infinitely many pairs of primes differing by some bounded gap, not necessarily exactly two, an unconditional result that had eluded mathematicians for decades; the Polymath Project and the mathematician James Maynard subsequently lowered Zhang's original bound substantially using different and more flexible methods. Twin primes become rarer, on average, as numbers grow larger, a thinning-out pattern described qualitatively by an estimate known as the Hardy-Littlewood conjecture, though no result has ever matched this qualitative estimate to the still-unproven claim that infinitely many twin primes exist.
Facts
Connections
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Twin Prime (Wikipedia)
Lead section
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.