Prime difference champions

DOI10.1007/978-3-030-55857-4_9MaRDI QIDQ2232035zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 4 October 2021

Full work available at URL https://arxiv.org/abs/1612.02938

zbMATH Keywords

sieve methodssingular seriesjumping championdifferences between primesHardy-Littlewood prime pair conjecturemaximal prime gapsprimorial numbers

Mathematics Subject Classification ID

Distribution of primes (11N05) Goldbach-type theorems; other additive questions involving primes (11P32) Applications of sieve methods (11N36)

Abstract: A Prime Difference Champion (PDC) for primes up to $x$ is defined to be any element of the set of one or more differences that occur most frequently among all positive differences between primes $lex$. Assuming an appropriate form of the Hardy-Littlewood Prime Pair Conjecture we can prove that for sufficiently large $x$ the PDCs run through the primorials. Numerical results also provide evidence for this conjecture as well as other interesting phenomena associated with prime differences. Unconditionally we prove that the PDCs go to infinity and further have asymptotically the same number of prime factors when counted logarithmically as the primorials.

Recommendations

• The \(k\)-tuple prime difference champion
• Jumping champions and gaps between consecutive primes
• The most likely common difference of arithmetic progressions among primes
• The jumping champion conjecture
• A remark on Polignac’s conjecture

Cited in

(6)

• The most likely common difference of arithmetic progressions among primes
• The \(k\)-tuple prime difference champion
• scientific article; zbMATH DE number 5555046 (Why is no real title available?)
• SanD primes and numbers
• A Graph of Primes
• A remark on Polignac’s conjecture

This page was built for publication: Prime difference champions

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