arXiv · 1311.1398
An explicit formula for the prime counting function
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 $\pi(n)$ which holds infinitely often.
Explore related subjects
Keep this discovery
Konstantinos N. Gaitanas. 2013-11-03. An explicit formula for the prime counting function. https://doi.org/10.4169/amer.math.monthly.122.03.283
Cite the original work for its findings. Save a collection to share your selection of sources.