Remarks on the differences between consecutive primes
Define \(F(n,k)\), to be the number of solution of \(p_j-p_i=2k\), \((p_j\leq n)\), and let \(f(n,k)\) be the number for which \(j=i+1\). This paper is concerned with the behaviour as \(n\to\infty\) of the maximum values of \(f(n,k)\) and \(F(n,k)\), and with the least values (\(k_n\) and \(K_n\) respectively) for which the maxima are attained. Hardy and Littlewood gave a conjectured asymptotic formula for \(F(n,k)\), for fixed \(k\). On the assumption of this it is shown that \[ f(n,k_n)/\{n(\log n)^{-2}\}\to\infty \] and that \(k_n\to\infty\). In contrast it is shown that \[ F(n,K_n)/\{n(\log\log n)(\log n)^{-2}\}\gg 1 \] without any hypothesis.
- On the several differences between primes
- The \(k\)-tuple prime difference champion
- Consecutive primes modulo 4
- The most likely common difference of arithmetic progressions among primes
- On the differences between consecutive prime numbers. I.
- How do prime numbers jump?
- A remark on Polignac’s conjecture
- scientific article; zbMATH DE number 3966202 (Why is no real title available?)
- scientific article; zbMATH DE number 4068997 (Why is no real title available?)
- The distribution of prime pairs differing by 2
- Small primes obtained from a sequence of larger primes
- scientific article; zbMATH DE number 3241436 (Why is no real title available?)
- scientific article; zbMATH DE number 3190408 (Why is no real title available?)
- Ernst G. Straus (1922-1983)
This page was built for publication: Remarks on the differences between consecutive primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1140115)
