Jumping champions and gaps between consecutive primes
From MaRDI portal
Publication:3173448
Abstract: The most common difference that occurs among the consecutive primes less than or equal to is called a jumping champion. Occasionally there are ties. Therefore there can be more than one jumping champion for a given . In 1999 A. Odlyzko, M. Rubinstein, and M. Wolf provided heuristic and empirical evidence in support of the conjecture that the numbers greater than 1 that are jumping champions are 4 and the primorials 2, 6, 30, 210, 2310,... As a step towards proving this conjecture they introduced a second weaker conjecture that any fixed prime divides all sufficiently large jumping champions. In this paper we extend a method of P. ErdH{o}s and E. G. Straus from 1980 to prove that the second conjecture follows directly from the prime pair conjecture of G. H. Hardy and J. E. Littlewood.
Recommendations
Cited in
(8)- The most likely common difference of arithmetic progressions among primes
- The \(k\)-tuple prime difference champion
- The jumping champion conjecture
- Prime difference champions
- How do prime numbers jump?
- The k-tuple jumping champions among consecutive primes
- The jumping champions of the Farey series
- Jumping Champions
This page was built for publication: Jumping champions and gaps between consecutive primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173448)