Jumping Champions

DOI10.1080/10586458.1999.10504393MaRDI QIDQ4523663zbMATH OpenOpenAlexFDO

Authors Marek Wolf, Andrew Odlyzko, Michael O. Rubinstein

Publication date 14 January 2001

Published in Experimental Mathematics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/223761

zbMATH Keywords

consecutive primesHardy-Littlewood prime \(k\)-tuples conjecturejumping championprimorial numbers

Mathematics Subject Classification ID

Distribution of primes (11N05) Values of arithmetic functions; tables (11Y70)

Review text

An integer \(D\) is a ``jumping champion if there is some \(x\geq 2\) such that \(D\) is a most frequent value of \(p_{n+1}- p_n\) for primes \(p_n\leq x\). For values of \(x\leq 1000\) the jumping champion is sometimes 2, sometimes 4 and sometimes 6; and sometimes two or more of these are equally frequent. However between \(10^3\) and \(10^{12}\) the jumping champion is always 6. The paper presents heuristic and numerical evidence suggesting that the jumping champion is always 6 from 1000 to about \(1.7\times 10^{35}\), but is then replaced by 30. It appears that 30 is eventually replaced by 210, and then by 2310, and indeed that the jumping champions are precisely 4 and the ``primorial numbers \(\prod_{j\leq k}p_j\). The heuristics are based on a quantitative form of the Hardy-Littlewood prime \(k\)-tuples conjecture. There are a number of interesting plots of numerical data, corroborating the heuristics.

Recommendations

• The jumping champion conjecture
• Jumping champions and gaps between consecutive primes
• scientific article; zbMATH DE number 4125490
• The \(k\)-tuple prime difference champion
• The jumping champions of the Farey series

Cites work

• scientific article; zbMATH DE number 3467229 (Why is no real title available?)
• scientific article; zbMATH DE number 683826 (Why is no real title available?)
• scientific article; zbMATH DE number 3009067 (Why is no real title available?)
• On the distribution of primes in short intervals
• Small differences between prime numbers

Cited in

(13)

• The \(k\)-tuple prime difference champion
• The most likely common difference of arithmetic progressions among primes
• Prime numbers with a certain extremal type property
• Integers and polynomials: comparing the close cousins \(\mathbb Z\) and \(\mathbb F_q[x]\)
• How do prime numbers jump?
• The k-tuple jumping champions among consecutive primes
• Jumping champions and gaps between consecutive primes
• The jumping champion conjecture
• The jumping champions of the Farey series
• Small primes obtained from a sequence of larger primes
• Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸
• When Euler met Brun
• On large zeros of linear recurrence sequences

This page was built for publication: Jumping Champions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4523663)