Authors and affiliations
In the paper the following explicit formulae for the prime counting function π are proposed and proved:
where τ is the number-of-divisors function, θ is either the sum-of-divisors function σ or Dedekind function ψ and ⌊⌋ is the floor function. Also an important general theorem (see Theorem 5) which gives an exact formula (depending on an arbitrary arithmetic function with strictly positive values, satisfying certain condition) for the prime counting function π is formulated and proved. This theorem generalizes all other main results in the paper.
- Prime number
- Composite number
- Arithmetic function
- Sierpiński, W. Elementary Number Theory, 2nd Edition, North Holland, Amsterdam, 1988.
- Mitrinović, D., M. Popadić. Inequalities in Number Theory. University of Niš, 1978.
Cite this paperAPA
Vassilev–Missana, Mladen (2013). Exact formulae for the prime counting function, Notes on Number Theory and Discrete Mathematics, 19(4), 77-85.Chicago
Vassilev–Missana, M. “Exact Formulae for the Prime Counting Function.” Notes on Number Theory and Discrete Mathematics 19, no. 4 (2013): 77-85.MLA
Vassilev–Missana, M. “Exact Formulae for the Prime Counting Function.” Notes on Number Theory and Discrete Mathematics 19.4 (2013): 77-85. Print.