English

Sharper Bounds for the Chebyshev function $\theta(x)$

Number Theory 2021-01-29 v2

Abstract

In this article, we provide explicit bounds for the prime counting function θ(x)\theta(x) in all ranges of xx. The bounds for the error term for θ(x)x\theta (x)- x are of the shape ϵx\epsilon x and ckx(logx)k\frac{c_k x}{(\log x)^k}, for k=1,,5k=1,\ldots,5. Tables of values for ϵ\epsilon and ckc_k are provided.

Cite

@article{arxiv.2002.11068,
  title  = {Sharper Bounds for the Chebyshev function $\theta(x)$},
  author = {Samuel Broadbent and Habiba Kadiri and Allysa Lumley and Nathan Ng and Kirsten Wilk},
  journal= {arXiv preprint arXiv:2002.11068},
  year   = {2021}
}

Comments

There is 41 page accompanying file to the main article which includes longer versions of Tables 8 to 15. This has the additional authors: Andrew Fiori and Josh Swidinsky

R2 v1 2026-06-23T13:53:34.208Z