An algorithm for the prime-counting function of primes larger than three
General Mathematics
2020-03-24 v3
Abstract
The prime-counting function 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 with time complexity without the need to introduce the non-trivial zeros of the Riemann zeta function.
Cite
@article{arxiv.2002.12797,
title = {An algorithm for the prime-counting function of primes larger than three},
author = {Yuri Heymann},
journal= {arXiv preprint arXiv:2002.12797},
year = {2020}
}
Comments
Issue with double counting of composites