Number Theory

    

Improved Estimate for the Prime Counting Function

Authors: Theophilus Agama

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}\pi(x)=\Theta(x)+O\bigg(\frac{1}{\log x}\bigg), \nonumber \end{align}where \begin{align}\Theta(x)=\frac{\theta(x)}{\log x}+\frac{x}{2\log x}-\frac{1}{4}-\frac{\log 2}{\log x}\sum \limits_{\substack{n\leq x\\\Omega(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}\pi(x)=\frac{\theta(x)}{\log x}+O\bigg(\frac{x}{\log^2 x}\bigg)\nonumber \end{align}found in the literature.

Comments: 7 Pages.

Download: PDF

Submission history

[v1] 2020-05-28 08:40:36

Unique-IP document downloads: 204 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus