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.

Cited by in corpus (1)

• When $\pi (n)$ does not divide $n$