A prime gap is the difference between two successive prime numbers. The n-th prime gap, denoted gn or g(pn) is the difference between the (n + 1)-th and the n-th prime numbers, i.e.
We have g1 = 1, g2 = g3 = 2, and g4 = 4. The sequence (gn) of prime gaps has been extensively studied, however many questions and conjectures remain unanswered.
The first 60 prime gaps are:
- 1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4, 2, 4, 14, 4, 6, 2, 10, 2, 6, 6, 4, 6, 6, 2, 10, 2, 4, 2, 12, 12, 4, 2, 4, 6, 2, 10, 6, 6, 6, 2, 6, 4, 2, ... (sequence A001223 in the OEIS).
By the definition of gn every prime can be written as
The first, smallest, and only odd prime gap is the gap of size 1 between 2, the only even prime number, and 3, the first odd prime. All other prime gaps are even. There is only one pair of consecutive gaps having length 2: the gaps g2 and g3 between the primes 3, 5, and 7.
the first term is divisible by 2, the second term is divisible by 3, and so on. Thus, this is a sequence of n − 1 consecutive composite integers, and it must belong to a gap between primes having length at least n − 1. It follows that there are gaps between primes that are arbitrarily large, that is, for any integer N, there is an integer m with gm ≥ N.
In reality, prime gaps of n numbers can occur at numbers much smaller than n!. For instance, the first prime gap of size larger than 14 occurs between the primes 523 and 541, while 15! is the vastly larger number 1307674368000.
Although the average gap between primes increases as the natural logarithm of the integer, the ratio of the prime gap to the integers involved decreases (and is asymptotically zero). This is a consequence of the prime number theorem. On the other hand, the ratio of the gap to the number of digits of the integers involved does increase without bound. This is a consequence of a result by Westzynthius.
In the opposite direction, the twin prime conjecture asserts that gn = 2 for infinitely many integers n.
As of March 2017[update] the largest known prime gap with identified probable prime gap ends has length 5103138, with 216849-digit probable primes found by Robert W. Smith. This gap has merit M=10.2203. The largest known prime gap with identified proven primes as gap ends has length 1113106, with 18662-digit primes found by P. Cami, M. Jansen and J. K. Andersen.
We say that gn is a maximal gap, if gm < gn for all m < n. As of August 2016[update] the largest known maximal gap has length 1476, found by Tomás Oliveira e Silva. It is the 75th maximal gap, and it occurs after the prime 1425172824437699411. Other record maximal gap terms can be found at A002386.
|36.858288||10716||127||7910896513*283#/30 - 6480||2016||Dana Jacobsen|
|36.590183||13692||163||1037600971*383#/210 - 8776||2016||Dana Jacobsen|
|36.420568||26892||321||59740589*757#/210 - 14302||2016||Dana Jacobsen|
|35.424459||66520||816||1931*1933#/7230 - 30244||2012||Michiel Jansen|
|35.310308||1476||19||1425172824437699411||2009||Tomás Oliveira e Silva|
As of November 2016[update], the largest known merit value, as discovered by D. Jacobsen, is 10716 / ln(7910896513*283#/30 - 6480) ≈ 36.858288 where 283# indicates the primorial of 283. The endpoints are 127-digit primes.
Bertrand's postulate, proved in 1852, states that there is always a prime number between k and 2k, so in particular pn+1 < 2pn, which means gn < pn.
The prime number theorem, proved in 1896, says that the "average length" of the gap between a prime p and the next prime is ln(p). The actual length of the gap might be much more or less than this. However, from the prime number theorem one can also deduce an upper bound on the length of prime gaps: for every ε > 0, there is a number N such that gn < εpn for all n > N.
One can deduce that the gaps get arbitrarily smaller in proportion to the primes: the quotient
hence showing that
for sufficiently large n.
- then for any
Here, O refers to the big O notation, ζ denotes the Riemann zeta function and π the prime-counting function. Knowing that any c > 1/6 is admissible, one obtains that θ may be any number greater than 5/8.
An immediate consequence of Ingham's result is that there is always a prime number between n3 and (n + 1)3, if n is sufficiently large. The Lindelöf hypothesis would imply that Ingham's formula holds for c any positive number: but even this would not be enough to imply that there is a prime number between n2 and (n + 1)2 for n sufficiently large (see Legendre's conjecture). To verify this, a stronger result such as Cramér's conjecture would be needed.
and 2 years later improved this to
In 2013, Yitang Zhang proved that
meaning that there are infinitely many gaps that do not exceed 70 million. A Polymath Project collaborative effort to optimize Zhang’s bound managed to lower the bound to 4680 on July 20, 2013. In November 2013, James Maynard introduced a new refinement of the GPY sieve, allowing him to reduce the bound to 600 and show that for any m there exists a bounded interval containing m prime numbers. Using Maynard's ideas, the Polymath project improved the bound to 246; assuming the Elliott–Halberstam conjecture and its generalized form, N has been reduced to 12 and 6, respectively.
In 1938, Robert Rankin proved the existence of a constant c > 0 such that the inequality
holds for infinitely many values n, improving results by Erik Westzynthius and Paul Erdős. He later showed that one can take any constant c < eγ, where γ is the Euler–Mascheroni constant. The value of the constant c was improved in 1997 to any value less than 2eγ.
Paul Erdős offered a $10,000 prize for a proof or disproof that the constant c in the above inequality may be taken arbitrarily large. This was proved to be correct in 2014 by Ford–Green–Konyagin–Tao and, independently, James Maynard.
The result was further improved to
for infinitely many values of n by Ford–Green–Konyagin–Maynard–Tao.
Lower bounds for chains of primes have also been determined.
Conjectures about gaps between primes
Firoozbakht's conjecture states that (where is the nth prime) is a strictly decreasing function of n, i.e.,
If this conjecture is true, then the function satisfies  It implies a strong form of Cramér's conjecture but is inconsistent with the heuristics of Granville and Pintz which suggest that infinitely often for any where denotes the Euler–Mascheroni constant.
Meanwhile, Oppermann's conjecture is weaker than Cramér's conjecture. The expected gap size with Oppermann's conjecture is on the order of
As a result, there is (under Oppermann's conjecture) m>0 (probably m=30) for which every natural n>m satisfies
This is a slight strengthening of Legendre's conjecture that between successive square numbers there is always a prime.
Polignac's conjecture states that every positive even number k occurs as a prime gap infinitely often. The case k = 2 is the twin prime conjecture. The conjecture has not yet been proven or disproven for any specific value of k, but Zhang Yitang result proves that it is true for at least one (currently unknown) value of k which is smaller than 70,000,000.
As an arithmetic function
The gap gn between the nth and (n + 1)st prime numbers is an example of an arithmetic function. In this context it is usually denoted dn and called the prime difference function. The function is neither multiplicative nor additive.
- "Hidden structure in the randomness of the prime number sequence?", S. Ares & M. Castro, 2005
- Andersen, Jens Kruse. "The Top-20 Prime Gaps". Retrieved 2014-06-13.
- A proven prime gap of 1113106
- Maximal Prime Gaps
- Westzynthius, E. (1931), "Über die Verteilung der Zahlen die zu den n ersten Primzahlen teilerfremd sind", Commentationes Physico-Mathematicae Helsingsfors (in German), 5: 1–37, JFM 57.0186.02, Zbl 0003.24601.
- NEW PRIME GAP OF MAXIMUM KNOWN MERIT
- Dynamic prime gap statistics
- TABLES OF PRIME GAPS
- Hoheisel, G. (1930). "Primzahlprobleme in der Analysis". Sitzunsberichte der Königlich Preussischen Akademie der Wissenschaften zu Berlin. 33: 3–11. JFM 56.0172.02.
- Heilbronn, H. A. (1933). "Über den Primzahlsatz von Herrn Hoheisel". Mathematische Zeitschrift. 36 (1): 394–423. doi:10.1007/BF01188631.
- Tchudakoff, N. G. (1936). "On the difference between two neighboring prime numbers". Math. Sb. 1: 799–814.
- Ingham, A. E. (1937). "On the difference between consecutive primes". Quarterly Journal of Mathematics. Oxford Series. 8 (1): 255–266. Bibcode:1937QJMat...8..255I. doi:10.1093/qmath/os-8.1.255.
- Cheng, Yuan-You Fu-Rui (2010). "Explicit estimate on primes between consecutive cubes". Rocky Mt. J. Math. 40: 117–153. Zbl 1201.11111. doi:10.1216/rmj-2010-40-1-117.
- Huxley, M. N. (1972). "On the Difference between Consecutive Primes". Inventiones Mathematicae. 15 (2): 164–170. Bibcode:1971InMat..15..164H. doi:10.1007/BF01418933.
- Baker, R. C.; Harman, G.; Pintz, J. (2001). "The difference between consecutive primes, II". Proceedings of the London Mathematical Society. 83 (3): 532–562. doi:10.1112/plms/83.3.532.
- Goldston, D. A.; Pintz, J.; Yildirim, C. Y. (2007). "Primes in Tuples II". arXiv: [math.NT].
- Zhang, Yitang (2014). "Bounded gaps between primes". Annals of Mathematics. 179 (3): 1121–1174. MR 3171761. doi:10.4007/annals.2014.179.3.7.
- "Bounded gaps between primes". Polymath. Retrieved 2013-07-21.
- Maynard, James (2015). "Small gaps between primes". Annals of Mathematics. 181 (1): 383–413. MR 3272929. doi:10.4007/annals.2015.181.1.7.
- D.H.J. Polymath (2014). "Variants of the Selberg sieve, and bounded intervals containing many primes". Research in the Mathematical Sciences. 1 (12). MR 3373710. arXiv: . doi:10.1186/s40687-014-0012-7.
- Pintz, J. (1997). "Very large gaps between consecutive primes". J. Number Theory. 63 (2): 286–301. doi:10.1006/jnth.1997.2081.
- Erdős, Some of my favourite unsolved problems
- Ford, Kevin; Green, Ben; Konyagin, Sergei; Tao, Terence (2016). "Large gaps between consecutive prime numbers". Ann. Of Math. 183 (3): 935–974. MR 3488740. arXiv: . doi:10.4007/annals.2016.183.3.4.
- Maynard, James (2016). "Large gaps between primes". Ann. Of Math. 183 (3): 915–933. MR 3488739. arXiv: . doi:10.4007/annals.2016.183.3.3.
- Ford, Kevin; Green, Ben; Konyagin, Sergei; Maynard, James; Tao, Terence (2015). "Long gaps between primes". arXiv: [math.NT].
- Ford, Kevin; Maynard, James; Tao, Terence (2015-10-13). "Chains of large gaps between primes". arXiv: [math.NT].
- Cramér, Harald (1936). "On the order of magnitude of the difference between consecutive prime numbers" (PDF). Acta Arithmetica. 2: 23–46.
- Sinha, Nilotpal Kanti (2010). "On a new property of primes that leads to a generalization of Cramer's conjecture". arXiv: [math.NT]..
- Granville, A. (1995). "Harald Cramér and the distribution of prime numbers" (PDF). Scandinavian Actuarial Journal. 1: 12–28..
- Granville, Andrew (1995). "Unexpected irregularities in the distribution of prime numbers" (PDF). Proceedings of the International Congress of Mathematicians. 1: 388–399..
- Pintz, János (2007). "Cramér vs. Cramér: On Cramér's probabilistic model for primes". Funct. Approx. Comment. Math. 37 (2): 232–471.
- Guy (2004) §A8
- Guy, Richard K. (2004). Unsolved problems in number theory (3rd ed.). Springer-Verlag. ISBN 978-0-387-20860-2. Zbl 1058.11001.
- Soundararajan, Kannan (2007). "Small gaps between prime numbers: the work of Goldston-Pintz-Yıldırım". Bull. Am. Math. Soc., New Ser. 44 (1): 1–18. Zbl 1193.11086. doi:10.1090/s0273-0979-06-01142-6.
- Mihăilescu, Preda (June 2014). "On some conjectures in additive number theory" (PDF). Newsletter of the European Mathematical Society (92): 13–16. ISSN 1027-488X. doi:10.4171/NEWS.
- Thomas R. Nicely, Some Results of Computational Research in Prime Numbers -- Computational Number Theory. This reference web site includes a list of all first known occurrence prime gaps.
- Weisstein, Eric W. "Prime Difference Function". MathWorld.
- "Prime Difference Function". PlanetMath.
- Armin Shams, Re-extending Chebyshev's theorem about Bertrand's conjecture, does not involve an 'arbitrarily big' constant as some other reported results.
- Chris Caldwell, Gaps Between Primes; an elementary introduction
- www.primegaps.com A study of the gaps between consecutive prime numbers
- Andrew Granville, Primes in Intervals of Bounded Length; overview of the results obtained so far up to and including James Maynard's work of November 2013.