An explicit formula for the prime counting function
Number Theory
2015-11-16 v1
Abstract
In this paper we use a theorem first proved by S.W.Golomb and a famous inequality by J.B. Rosser and L.Schoenfeld in order to prove that there exists an exact formula for which holds infinitely often.
Keywords
Cite
@article{arxiv.1311.1398,
title = {An explicit formula for the prime counting function},
author = {Konstantinos N. Gaitanas},
journal= {arXiv preprint arXiv:1311.1398},
year = {2015}
}