On the order of magnitude of the difference between consecutive prime numbers (Q5764192)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3023943
Language Label Description Also known as
default for all languages
No label defined
    English
    On the order of magnitude of the difference between consecutive prime numbers
    scientific article; zbMATH DE number 3023943

      Statements

      On the order of magnitude of the difference between consecutive prime numbers (English)
      0 references
      1936
      0 references
      Algebra, number theory
      0 references
      0 references
      It is a question of results of the form \[ p_{n+1} - p_{n} = O\left\{f(p_n)\right\} \tag{A} \] where \(p_n\) is the \(n\)-th prime. It is known (Hoheisel, S.-B. preuß. Akad. Wiss. 1930, no. 33) that (A) is true with \(f(x)=x^{1-\delta}\), \(\delta>0\); and (Westzynthius, this Zbl. \( 3,246) \) that it is false with \(f(x)=\log x\). See also the recent paper of Tchudakoff, this Zbl. 13, 346. On the Riemann hypothesis (A) is true with \( f(x)=\sqrt{x} \log x \) [Cramér, Ark. Mat. Astron. Fys. 15 no. 5 (1920)]. In this paper various arguments are given for supposing that the ultimate truth is given by \(f(x)=(\log x)^2\). The first is a heuristic method founded on probability arguments. Secondly, we assume the Riemann hypothesis, and consider primes \(p_n\) such that the difference \(p_{n+1}-p_{n}\) is exceptionally large, i.e. larger than some function \(f(p_n)\) increasing more rapidly than \((\log p_n)^2\). It is shown that the frequency of such primes is small.
      0 references

      Identifiers