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 (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), and (skipping quite a few), (821, 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, which states There are infinitely many primes p such that p + 2 is also prime. In 1849 de Polignac made the more general conjecture that for every natural number k, there are infinitely many prime pairs p and p′ such that p′ − p = 2k. The case k = 1 is the twin prime conjecture.
A stronger form of the twin prime conjecture, the Hardy–Littlewood conjecture, postulates a distribution law for twin primes akin to the prime number theorem.
In 1915, Viggo Brun showed that the sum of reciprocals of the twin primes was convergent. This famous result, called Brun's theorem, was the first use of the Brun sieve and helped initiate the development of modern sieve theory. The modern version of Brun's argument can be used to show that the number of twin primes less than N does not exceed
for some absolute constant C > 0.
In 1940, Paul Erdős showed that there is a constant c < 1 and infinitely many primes p such that (p′ − p) < (c ln p) where p′ denotes the next prime after p. This result was successively improved; in 1986 Helmut Maier showed that a constant c < 0.25 can be used. In 2004 Daniel Goldston and Cem Yıldırım showed that the constant could be improved further to c = 0.085786… In 2005, Goldston, János Pintz and Yıldırım established that c can be chosen to be arbitrarily small^{[1]}^{[2]}
In fact, by assuming the Elliott–Halberstam conjecture or a slightly weaker version, they were able to show that there are infinitely many n such that at least two of n, n + 2, n + 6, n + 8, n + 12, n + 18, or n + 20 are prime. Under a stronger hypothesis they showed that at least two of n, n + 2, n + 4, and n + 6 are prime.
Every twin prime pair except (3, 5) is of the form (6n − 1, 6n + 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 proved that the pair m, m + 2 is a twin prime if and only if
If m − 4 or m + 6 is also prime then the 3 primes are called a prime triplet.
Contents 
On January 15, 2007 two distributed computing projects, Twin Prime Search and PrimeGrid found the largest known twin primes, 2003663613 · 2^{195000} ± 1. The numbers have 58711 decimal digits. Their discoverer was Eric Vautier of France.
On August 6, 2009 those same two projects announced that a new record twin prime had been found.^{[3]} It is 65516468355 · 2^{333333} ± 1.^{[4]} The numbers have 100355 decimal digits.
An empirical analysis of all prime pairs up to 4.35 · 10^{15} shows that if the number of such pairs less than x is f(x)·x/(log x)^{2} then f(x) is about 1.7 for small x and decreases towards about 1.3 as x tends to infinity.
There are 808,675,888,577,436 twin prime pairs below 10^{18}.^{[5]}
The limiting value of f(x) is conjectured to equal twice the twin prime constant (not to be confused with Brun's constant)
this conjecture would imply the twin prime conjecture, but remains unresolved.
The twin prime conjecture would give a better approximation, as with the prime counting function, by
There are 35 twin prime pairs below 1000, given in the following list:
Every third odd number greater than seven is divisible by 3, so 5 is the only prime which is part of two pairs. The lower member of a pair is by definition a Chen prime.
The Hardy–Littlewood conjecture (after G. H. Hardy and John Littlewood) is a generalization of the twin prime conjecture. It is concerned with the distribution of prime constellations, including twin primes, in analogy to the prime number theorem. Let π_{2}(x) denote the number of primes p ≤ x such that p + 2 is also prime. Define the twin prime constant C_{2} as^{[6]}
(here the product extends over all prime numbers p ≥ 3). Then the conjecture is that
in the sense that the quotient of the two expressions tends to 1 as n approaches infinity.
This conjecture can be justified (but not proven) by assuming that 1 / ln t describes the density function of the prime distribution, an assumption suggested by the prime number theorem.
Polignac's conjecture from 1849 states that for every even natural number k, there are infinitely many prime pairs p and p′ such that p − p′ = k. The case k = 2 is the twin prime conjecture. The case k = 4 corresponds to cousin primes and the case k = 6 to sexy primes. The conjecture has not been proved or disproved for any value of k.
This page or section does not have any sources. You can help Wikipedia by finding sources, and adding them. Tagged since April 2009 
The twin prime conjecture is a mathematical theory. It says that it is possible to find two twin primes that are as big as wanted.
Twin primes are prime numbers that differ by two. For example 3 and 5 are both prime and differ by two. They are twin primes. 23 is prime, but it is not a twin prime. The primes nearest to 23 are 19 and 29. Twin primes were discovered by Euclid in 300 B.C.
Since Euclid's time mathematicians have wondered whether there are an infinite number of twin primes. Many mathematicians are still trying to find the answer.
