arXivDaily arXiv每日学术速递 周一至周五更新
稍安勿躁,官方尚未更新
arXiv 2109.02249math.NT
收藏

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

Daniel R. Johnston

英文摘要:

Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $π(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that $|π(x)-\text{li}(x)|<\sqrt{x}\log x/8π$ 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑