Overview

A twin prime is one of a pair of prime numbers that differ by exactly two. In other words, (p, p+2) is a twin prime pair when both p and p+2 are primes. Twin primes are the closest possible distinct odd primes, since all primes greater than 2 are odd and consecutive odd numbers differ by two.

Basic properties

Except for the pair (3, 5), twin primes straddle a multiple of six and can be written as (6k-1, 6k+1) for some integer k. This follows from the fact that every integer greater than 3 is congruent to 0, 1, or 2 modulo 3, and a pair of primes two apart cannot include a multiple of 3 unless that number is 3 itself. The existence of twin primes is strongly constrained by simple divisibility patterns, which explains both their apparent scarcity and the regularity of their small examples.

History and research

The question of whether there are infinitely many twin primes is a famous unsolved problem in number theory, commonly called the twin prime conjecture. Work over the last century has produced partial results: it has been shown that twin primes are rarer than primes in general in certain technical senses, and that the sum of the reciprocals of twin primes converges (Brun's theorem), a fact that contrasts with the divergence of the sum of reciprocals of all primes. In the 2010s researchers proved important progress on bounded gaps between primes, showing that there exist infinitely many prime pairs separated by some fixed finite distance; subsequent collaborative efforts reduced that distance, but the special case of exactly two remains open.

Examples and enumeration

Small twin prime pairs are easy to list and illustrate the idea. Well-known early examples include:

  • (3, 5)
  • (5, 7)
  • (11, 13)
  • (17, 19)
  • (29, 31)
  • (41, 43)

Computational searches have found many twin primes at very large sizes, and tables of such pairs are used to test algorithms and heuristics in computational number theory.

Twin primes are central to research on the distribution of primes and to conjectures that predict how often primes of given separations occur. They are distinct from other named prime pairs: cousin primes differ by four, and sexy primes differ by six. While twin primes have limited direct application in cryptographic constructions, they serve as important test cases for analytic techniques, sieving methods and probabilistic models of prime behavior.

Notable facts

  • Brun's theorem: the sum of reciprocals of twin primes converges to a finite value (Brun's constant).
  • The twin prime conjecture remains unresolved: no proof yet shows there are infinitely many twin prime pairs.
  • Substantial modern progress established the existence of infinitely many prime pairs with bounded gaps, a step that sharpened understanding even though it did not settle the gap-two case.