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)-st 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: By the definition of gn every prime can be written as

Simple observations

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. For any integer n, the factorial n! is the product of all positive integers up to and including n. Then in the sequence 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. 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 . However, 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. The average gap between primes increases as the natural logarithm of these primes, and therefore the ratio of the prime gap to the primes involved decreases (and is asymptotically zero). This is a consequence of the prime number theorem. From a heuristic view, we expect the probability that the ratio of the length of the gap to the natural logarithm is greater than or equal to a fixed positive number k to be e−k In the opposite direction, the twin prime conjecture posits that gn = 2 for infinitely many integers n.

Numerical results

Usually the ratio of is called the merit of the gap gn. Informally, the merit of a gap gn can be thought of as the ratio of the size of the gap compared to the average prime gap sizes in the vicinity of pn. The largest known prime gap with identified probable prime gap ends has length 16,045,848, with 385,713-digit probable primes and merit M = 18.067, found by Andreas Höglund in March 2024. The largest known prime gap with identified proven primes as gap ends has length 1,113,106 and merit 25.90, with 18,662-digit primes found by P. Cami, M. Jansen and J. K. Andersen. , the largest known merit value and first with merit over 40, as discovered by the Gapcoin network, is 41.93878373 with the 87-digit prime. The prime gap between it and the next prime is 8350. The Cramér–Shanks–Granville ratio is the ratio of gn / (ln(pn))2. If we discard anomalously high values of the ratio for the primes 2, 3, 7, then the greatest known value of this ratio is 0.9206386 for the prime 1693182318746371. Other record terms can be found at. We say that gn is a maximal gap, if gm < gn for all m < n. , the largest known maximal prime gap has length 1676, found by Brian Kehrig. It is the 83rd maximal prime gap, and it occurs after the prime 20733746510561442863. Other record (maximal) gap sizes can be found in, with the corresponding primes pn in , and the values of n in. The sequence of maximal gaps up to the nth prime is conjectured to have about 2\ln n terms.

Further results

Upper bounds

Bertrand's postulate, proven 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, proven in 1896, says that the average length of the gap between a prime p and the next prime will asymptotically approach ln(p), the natural logarithm of p, for sufficiently large primes. The actual length of the gap might be much more or less than this. However, one can deduce from the prime number theorem that the gaps get arbitrarily smaller in proportion to the primes: the quotient In other words (by definition of a limit), for every, there is a number N such that for all n > N Hoheisel (1930) was the first to show a sublinear dependence; that there exists a constant θ < 1 such that hence showing that for sufficiently large n. Hoheisel obtained the possible value 32999/33000 for θ. This was improved to 249/250 by Heilbronn, and to θ = 3/4 + ε, for any ε > 0, by Chudakov. A major improvement is due to Ingham, who showed that for some positive constant c, 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. Huxley in 1972 showed that one may choose θ = 7/12 = 0.58(3). A result, due to Baker, Harman and Pintz in 2001, shows that θ may be taken to be 0.525. The above describes limits on all gaps; another are of interest is the minimum gap size. The twin prime conjecture asserts that there are always more gaps of size 2, but remains unproven. In 2005, Daniel Goldston, János Pintz and Cem Yıldırım proved that 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 with an. Using Maynard's ideas, the Polymath project improved the bound to 246; assuming the Elliott–Halberstam conjecture and its generalized form, the bound has been reduced to 12 and 6, respectively.

Lower bounds

In 1931, Erik Westzynthius proved that maximal prime gaps grow more than logarithmically. That is, In 1938, Robert Rankin proved the existence of a constant c > 0 such that the inequality holds for infinitely many values of n, improving the results of 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. In the spirit of Erdős' original prize, Terence Tao offered US$10,000 for a proof that c may be taken arbitrarily large in this inequality. Lower bounds for chains of primes have also been determined.

Conjectures about gaps between primes

As described above, the best proven bound on gap sizes is (for n sufficiently large; we do not worry about or ), but it is observed that even maximal gaps are significantly smaller than that, leading to a plethora of unproven conjectures. The first group hypothesize that the exponent can be reduced to. Legendre's conjecture that there always exists a prime between successive square numbers implies that. Andrica's conjecture states that Oppermann's conjecture makes the stronger claim that, for sufficiently large n (probably n > 30), All of these remain unproved. Harald Cramér came close, proving that the Riemann hypothesis implies the gap gn satisfies using the big O notation. (In fact this result needs only the weaker Lindelöf hypothesis, if one can tolerate an infinitesimally larger exponent. ) In the same article, he conjectured that the gaps are far smaller. Roughly speaking, Cramér's conjecture states that a polylogarithmic growth rate slower than any exponent \theta > 0. As this matches the observed growth rate of prime gaps, there are a number of similar conjectures. Firoozbakht's conjecture is slightly stronger, stating that is a strictly decreasing function of n, i.e., If this conjecture were true, then 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 \gamma denotes the Euler–Mascheroni constant. 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 the improvements on Zhang's result discussed above prove that it is true for at least one (currently unknown) value of k ≤ 246.

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.