GitHub - maitbayev/primecount-rs: Counts the primes below an integer x ≤ 10^31 efficiently.

primecount-rs is a library that provides APIs for counting the primes below an integer x ≤ 10^31 using highly optimized implementations of the combinatorial prime counting algorithms.

use primecount;

fn main() {
    println!("Primes below 1000 = {}", primecount::pi(1000));
    println!(
        "Numbers below 1000 that are not divisible by 
        any of the first 100 primes (a.k.a. Legendre-sum) = {}",
        primecount::phi(1000, 100)
    );
    println!("10th prime = {}", primecount::nth_prime(10));
}