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

2017/01/19 by Diouf, Madieyna
#11A41 #11A51 #FOS: Mathematics #General Mathematics (math.GM)

paper · doi:10.48550/arxiv.1701.05591

Abstract

We present a function that tests for primality, factorizes composites and builds a closed form expression of π(n²) in terms of ∑_{3 ≤ p ≤ n} (1)/(p) and a weaker version of ω(n).

Related

• On a sum involving the prime counting function π(x)
• Prime Counting Function Identity
• An algorithm for the prime-counting function of primes larger than three
• p-composites of the main sequence of odd numbers as building blocks for π(x)
• New Formulas for Semi-Primes. Testing, Counting and Identification of the n^th and next Semi-Primes