primal 0.2.2

`primal` puts raw power into prime numbers. This crates includes: optimised prime sieves, checking for primality, enumerating primes, factorising numbers, and state-of-the-art estimation of upper and lower bounds for π(n) (the number of primes below n) and p_k (the k-th prime).
Documentation 
extern crate primal;

fn main() {
    let ns = (1..100 + 1).map(|x| x * 100_000).collect::<Vec<_>>();

    // find our upper bound
    let (_lo, hi) = primal::estimate_nth_prime(10_000_000);

    // find the primes up to this upper bound
    let sieve = primal::Sieve::new(hi as usize);

    // now we can efficiently sum them up
    let sum = ns.iter()
                .map(|n| sieve.nth_prime(*n))
                .fold(0, |a, b| a + b);
    println!("the sum is {}", sum);
}