Large prime gaps and probabilistic models

From MaRDI portal
Revision as of 07:18, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6113258

DOI10.1007/S00222-023-01199-0arXiv1908.08613MaRDI QIDQ6113258

Terence C. Tao, William D. Banks, Kevin Ford

Publication date: 8 August 2023

Published in: Inventiones Mathematicae (Search for Journal in Brave)

Abstract: We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we obtain heuristic upper and lower bounds for the size of the largest prime gap in the interval $[1,x]$. Our results are stated in terms of the extremal bounds in the interval sieve problem. The same methods also allow us to rigorously relate the validity of the Hardy-Littlewood conjectures for an arbitrary set (such as the actual primes) to lower bounds for the largest gaps within that set.


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





Cites Work


Related Items (2)





This page was built for publication: Large prime gaps and probabilistic models