An algorithm for the prime-counting function of primes larger than three
Abstract
The prime-counting function π(x) which computes the number of primes smaller or equal to a given real number has a long-standing interest in number theory. The present manuscript proposes a method to compute π(x) with time complexity O(x1/2) without the need to introduce the non-trivial zeros of the Riemann zeta function.
0