Improving bounds on prime counting functions by partial verification of the Riemann hypothesis

preprint2022arXivOpen access

Abstract

Using a recent verification of the Riemann hypothesis up to height 3⋅10123\cdot 10^{12}, we provide strong estimates on π(x)π(x) and other prime counting functions for finite ranges of xx. In particular, we get that ∣π(x)−li(x)∣<xlog⁡x/8π|π(x)-\text{li}(x)|<\sqrt{x}\log x/8π for 2657≤x≤1.101⋅10262657\leq x\leq 1.101\cdot 10^{26}. We also provide weaker bounds that hold for a wider range of xx, and an application to an inequality of Ramanujan.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.