Indexed metadata

Explicit bounds for the prime number theorem

Andrew Fiori, Mikko Jaskari

Source record

Source: arXiv

Published: Sep 19, 2026

arXiv: 2609.23222

Open original source ↗

Source abstract

We study the problem of finding tight explicit bounds on sums over zeros of LL-functions near the 11-line with a variety of zero-free regions and zero-density estimates. As an application to demonstrate the techniques, we apply them to the case of the Riemann zeta function and the prime number theorem to obtain new best estimates on the error terms in the prime number theorem. We show that for x21x\geq21 we have ψ(x)x<0.239xexp(0.1982767(1+logloglog(x)15loglog(x))log(x)3/5loglog(x)1/5).|ψ(x)-x| < 0.239 x \exp\left(-0.1982767\left(1+\frac{\log\log\log(x)}{15\log\log(x)}\right) \frac{\log(x)^{3/5}}{\log\log(x)^{1/5}}\right).

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.