The prime counting function

2016/03/06 by Igor Turkanov, Turkanov, Igor · 1 citation
Mathematics · #FOS: Mathematics #Number Theory (math.NT) #math.NT

paper · pdf · doi:10.48550/arxiv.1603.02914

5 pages

arxiv created 2016/03/06 · arxiv updated 2016/03/10

Abstract

The theorem below gives another way of computing the distribution prime counting function without using recursion and the values of Prime numbers

Cited by

• The strange story of an almost unknown prime number counter: The Rafael Barrett formula

Related

• A Simple Proof Of The Prime Number Theorem
• A Simple Closed-Form Approximation to the Prime-Counting Function
• An induction property for prime counting functions
• An algorithm for the prime-counting function of primes larger than three
• The Prime Number Theorem and Primorial Numbers