On the prime counting function and the partial sum of reciprocals of odd primes

Abstract

We present a function that tests for primality, factorizes composites and builds a closed form expression of $\pi (n^2)$ in terms of ${\sum }_{3\le p\le n}\frac{1}{p}$ and a weaker version of $\omega (n)$.

arXiv comment18 pages