arXiv · 2607.04283
Improving on the Brun-Titchmarsh Theorem
Abstract
We prove that the number of primes in an interval of length $N$ is at most $2N/(\log N+3.53)$ when $N$ is large enough. This is obtained through a sieving process which can be seen as a hybrid between the large sieve and the Selberg sieve, and draws on what we call "local models". This paper has been published in {\sc Acta Arithmetica, 2008, vol. 131, nb. 4, pages 351--366}.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Olvier Ramaré, Jan Christoph Schlage-Puchta. 2026-07-05. Improving on the Brun-Titchmarsh Theorem. https://doi.org/10.4064/aa131-4-4
Cite the original work for its findings. Save a collection to share your selection of sources.