Cramér's conjecture

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In number theory, Cramér's conjecture, formulated by the Swedish mathematician Harald Cramér in 1936,[1] is an estimate for the size of gaps between consecutive prime numbers: intuitively, that gaps between consecutive primes are always small, and the conjecture quantifies asymptotically just how small they must be. It states that

where pn denotes the nth prime number, O is big O notation, and "log" is the natural logarithm. While this is the statement explicitly conjectured by Cramér, his heuristic actually supports the stronger statement

and sometimes this formulation is called Cramér's conjecture. However, this stronger version is not supported by more accurate heuristic models, which nevertheless support the first version of Cramér's conjecture. Neither form has yet been proven or disproven.

Conditional proven results on prime gaps[edit]

Cramér gave a conditional proof of the much weaker statement that

on the assumption of the Riemann hypothesis.[1] The best known unconditional bound is

due to Baker, Harman, and Pintz.[2]

In the other direction, E. Westzynthius proved in 1931 that prime gaps grow more than logarithmically. That is,[3]

His result was improved by R. A. Rankin,[4] who proved that

Paul Erdős conjectured that the left-hand side of the above formula is infinite, and this was proven in 2014 by Kevin Ford, Ben Green, Sergei Konyagin, and Terence Tao.[5]

Heuristic justification[edit]

Cramér's conjecture is based on a probabilistic model—essentially a heuristic—in which the probability a number of size x is prime is 1/log x. This is known as the Cramér model of the primes.

In the Cramér random model,

with probability one.[1] However, as pointed out by Andrew Granville,[6] Maier's theorem shows that the Cramér random model does not adequately describe the distribution of primes on short intervals, and a refinement of Cramér's model taking into account divisibility by small primes suggests that (OEISA125313), where is the Euler–Mascheroni constant. János Pintz has suggested that the limit sup may be infinite,[7] and similarly Leonard Adleman and Kevin McCurley write

As a result of the work of H. Maier on gaps between consecutive primes, the exact formulation of Cramér's conjecture has been called into question [...] It is still probably true that for every constant , there is a constant such that there is a prime between and . [8]

Related conjectures and heuristics[edit]

Prime gap function

Daniel Shanks conjectured the following asymptotic equality, stronger than Cramér's conjecture,[9] for record gaps:

In the paper [10] J.H. Cadwell has proposed the formula for the maximal gaps: which is formally identical to the Shanks conjecture but suggests a lower-order term.

Thomas Nicely has calculated many large prime gaps.[11] He measures the quality of fit to Cramér's conjecture by measuring the ratio

He writes, “For the largest known maximal gaps, has remained near 1.13.” However, is still less than 1.

See also[edit]


  1. ^ a b c Cramér, Harald (1936), "On the order of magnitude of the difference between consecutive prime numbers" (PDF), Acta Arithmetica, 2: 23–46 
  2. ^ R. C. Baker, G. Harman, and J. Pintz, The difference between consecutive primes. II. Proc. London Math. Soc. (3), 83 (2001), no. 3, 532-562
  3. ^ 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 .
  4. ^ R. A. Rankin, The difference between consecutive prime numbers, J. London Math. Soc. 13 (1938), 242-247
  5. ^ K. Ford, B. Green, S. Konyagin, and T. Tao, Large gaps between consecutive prime numbers. Ann. of Math. (2) 183 (2016), no. 3, 935–974
  6. ^ Granville, A. (1995), "Harald Cramér and the distribution of prime numbers" (PDF), Scandinavian Actuarial Journal, 1: 12–28, doi:10.1080/03461238.1995.10413946 .
  7. ^ János Pintz, Very large gaps between consecutive primes, Journal of Number Theory 63:2 (April 1997), pp. 286–301.
  8. ^ Leonard Adleman and Kevin McCurley, Open Problems in Number Theoretic Complexity, II. Algorithmic number theory (Ithaca, NY, 1994), 291–322, Lecture Notes in Comput. Sci., 877, Springer, Berlin, 1994.
  9. ^ Shanks, Daniel (1964), "On Maximal Gaps between Successive Primes", Mathematics of Computation, American Mathematical Society, 18 (88): 646–651, JSTOR 2002951, Zbl 0128.04203, doi:10.2307/2002951 .
  10. ^ Cadwell, J. H. (1971), "Large Intervals Between Consecutive Primes", Mathematics of Computation, 25 (116): 909–913, JSTOR 2004355, doi:10.2307/2004355 
  11. ^ Nicely, Thomas R. (1999), "New maximal prime gaps and first occurrences", Mathematics of Computation, 68 (227): 1311–1315, MR 1627813, doi:10.1090/S0025-5718-99-01065-0 .

External links[edit]