Search arXivSearch

arXiv · 2505.24017

On the number of exceptional intervals to the prime number theorem in short intervals

Abstract

For a fixed exponent $0 < θ\leq 1$, it is expected that we have the prime number theorem in short intervals $\sum_{x \leq n < x+x^θ} Λ(n) \sim x^θ$ as $x \to \infty$. From the recent zero density estimates of Guth and Maynard, this result is known for all $x$ for $θ> \frac{17}{30}$ and for almost all $x$ for $θ> \frac{2}{15}$. Prior to this work, Bazzanella and Perelli obtained some upper bounds on the size of the exceptional set where the prime number theorem in short intervals fails. We give an explicit relation between zero density estimates and exceptional set bounds, allowing for the most recent zero density estimates to be directly applied to give upper bounds on the exceptional set via a small amount of computer assistance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ayla Gafni, Terence Tao. 2025-05-29. On the number of exceptional intervals to the prime number theorem in short intervals. https://doi.org/10.2140/ent.2026.5.221

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT