2000 character limit reached
Improving bounds on prime counting functions by partial verification of the Riemann hypothesis
Published 6 Sep 2021 in math.NT | (2109.02249v2)
Abstract: Using a recent verification of the Riemann hypothesis up to height $3\cdot 10{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that $|\pi(x)-\text{li}(x)|<\sqrt{x}\log x/8\pi$ for $2657\leq x\leq 1.101\cdot 10{26}$. We also provide weaker bounds that hold for a wider range of $x$, and an application to an inequality of Ramanujan.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.