Crate primecount 

Functions

nth_prime

Find the nth prime using a combination of the prime counting function and the sieve of Eratosthenes.

phi

Partial sieve function (a.k.a. Legendre-sum).

pi

Counts the number of primes <= x using Xavier Gourdon’s algorithm. Uses all CPU cores by default.