In number theory, Polignac's conjecture was made by Alphonse de Polignac in 1849 and states:
For any positive even number n, there are infinitely many prime gaps of size n. In other words: There are infinitely many cases of two consecutive prime numbers with difference n. Although the conjecture has not yet been proven or disproven for any given value of n, in 2013 an important breakthrough was made by Yitang Zhang who proved that there are infinitely many prime gaps of size n for some value of n < 70,000,000. Later that year, James Maynard announced a related breakthrough which proved that there are infinitely many prime gaps of some size less than or equal to 600. As of April 14, 2014, one year after Zhang's announcement, according to the Polymath project wiki, n has been reduced to 246. Further, assuming the Elliott–Halberstam conjecture and its generalized form, the Polymath project wiki states that n has been reduced to 12 and 6, respectively. For n = 2, it is the twin prime conjecture. For n = 4, it says there are infinitely many cousin primes (p, p + 4). For n = 6, it says there are infinitely many sexy primes (p, p + 6) with no prime between p and p + 6. Dickson's conjecture generalizes Polignac's conjecture to cover all prime constellations. In 1966, Chen Jing-run proved a slightly weaker version of Polignac's conjecture: there are infinitely many primes p such that p+k is either prime or a square-free number with at most 2 prime factors (a semiprime).
Conjectured density Let π n ( x ) {\displaystyle \pi _{n}(x)} for even n be the number of prime gaps of size n below x. The first Hardy–Littlewood conjecture says the asymptotic density is of form
π n ( x ) ∼ 2 C n x ( ln x ) 2 ∼ 2 C n ∫ 2 x d t ( ln t ) 2 {\displaystyle \pi _{n}(x)\sim 2C_{n}{\frac {x}{(\ln x)^{2}}}\sim 2C_{n}\int _{2}^{x}{dt \over (\ln t)^{2}}}
where Cn is a function of n, and ∼ {\displaystyle \sim } means that the quotient of two expressions tends to 1 as x approaches infinity. C2 is the twin prime constant
C 2 = ∏ p ≥ 3 p ( p − 2 ) ( p − 1 ) 2 ≈ 0.660161815846869573927812110014 … {\displaystyle C_{2}=\prod _{p\geq 3}{\frac {p(p-2)}{(p-1)^{2}}}\approx 0.660161815846869573927812110014\dots }
where the product extends over all prime numbers p ≥ 3. Cn is C2 multiplied by a number which depends on the odd prime factors q of n:
C n = C 2 ∏ q | n q − 1 q − 2 . {\displaystyle C_{n}=C_{2}\prod _{q|n}{\frac {q-1}{q-2}}.}
… excerpt ends here. Continue reading the full article.
