Improved estimate for the prime counting function
arXiv:1805.10303 · doi:10.12691/tjant-7-1-1
Abstract
Using some simple combinatorial arguments, we establish some new estimates for the prime counting function and its allied functions. In particular we show that \begin{align}π(x)=Θ(x)+O\bigg(\frac{1}{\log x}\bigg), \nonumber \end{align}where \begin{align}Θ(x)=\frac{θ(x)}{\log x}+\frac{x}{2\log x}-\frac{1}{4}-\frac{\log 2}{\log x}\sum \limits_{\substack{n\leq x\\Ω(n)=k\\k\geq 2\\2\not| n}} \frac{\log (\frac{x}{n})}{\log 2}.\nonumber \end{align}This is an improvement to the estimate \begin{align}π(x)=\frac{θ(x)}{\log x}+O\bigg(\frac{x}{\log^2 x}\bigg)\nonumber \end{align}found in the literature.
Improvement of the previous version suggested by the referee