# Twin prime

A **twin prime** is a prime number that differs from another prime number by two. Except for the pair (2, 3), this is the smallest possible difference between two primes. Some examples of twin prime pairs are 5 and 7, 11 and 13, and 821 and 823. (Sometimes the term *twin prime* is used for a pair of twin primes; an alternative name for this is **prime twin**.)

The question of whether there exist infinitely many twin primes has been one of the great open questions in number theory for many years. This is the content of the twin prime conjecture. A strong form of the twin prime conjecture, the Hardy-Littlewood conjecture, postulates a distribution law for twin primes akin to the prime number theorem.

Using his celebrated sieve method, Viggo Brun shows that the number of twin primes less than x is << x/(log x)^{2}. This result implies that the sum of the reciprocals of all twin primes converges (see Brun's constant). This is in stark contrast to the sum of the reciprocals of all primes, which diverges.
He also shows that every even number can be represented in infinitely many ways as a difference of two numbers both having at most 9 prime factors. Chen Jingrun's well known theorem states that for any m even, there are infinitely many primes that differs by m from a number having at most two prime factors.
(Before Brun attacked the twin prime problem, Jean Merlin had also attempted to solve this problem using the sieve method. Unfortunately he was killed in World War I.)

Every twin prime pair greater than 3 is of the form (6*n* - 1, 6*n* + 1) for some natural number *n*, and with the exception of n = 1, n must end in 0, 2, 3, 5, 7, or 8.

It has been proven that the pair *m*, *m* + 2 is a twin prime if and only if

As of 2005, the largest known twin prime is 16869987339975 · 2^{171960} ± 1; it was found in 2005 by the Hungarians Zoltán Járai, Gabor Farkas, Timea Csajbok, Janos Kasza and Antal Járai. It has 51779 digits [1].

An empirical analysis of all prime pairs up to 4.35 · 10^{15} shows that the number of such pairs less than x is x·f(x)/(log x)^{2} where f(x) is about 1.7 for small x and decreases to about 1.3 as x tends to infinity.
The limiting value of f(x) is conjectured to equal the *twin prime constant*

this conjecture would imply the twin prime conjecture, but remains unresolved.

## The first 35 twin prime pairs

(3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), (71, 73), (101, 103), (107, 109), (137, 139), (149, 151), (179, 181), (191, 193), (197, 199), (227, 229), (239, 241), (269, 271), (281, 283), (311, 313), (347, 349), (419, 421), (431, 433), (461, 463), (521, 523), (569, 571), (599, 601), (617, 619), (641, 643), (659, 661), (809, 811), (821, 823), (827, 829), (857, 859), (881, 883)

Only four pairs of these twin primes are irregular primes. The lower member of a pair is always a Chen prime.

## See also

## External links

- Chris Caldwell:
*Twin Primes* - Xavier Gourdon, Pascal Sebah:
*Introduction to Twin Primes and Brun's Constant* - Martin Winer:
*Randomness and Prime Twin Proof*

ca:Nombres primers bessons da:Primtalstvillinger de:Primzahlzwilling es:Números primos gemelos fr:Nombres premiers jumeaux he:ראשוניים תאומים hu:Ikerprím nl:Priemtweeling ja:双子素数 pl:Liczby bliźniacze ru:Простые числа-близнецы sl:Praštevilski dvojček tr:İkiz Asallar Sanısı zh:孪生素数