Function num_prime::nt_funcs::is_prime

source · 
pub fn is_prime<T: PrimalityBase>(
    target: &T,
    config: Option<PrimalityTestConfig>
) -> Primality
where
    for<'r> &'r T: PrimalityRefBase<T>,
Expand description

Primality test

This function re-exports PrimeBufferExt::is_prime() with a new NaiveBuffer distance

Examples found in repository?
examples/find_mersenne_primes.rs (line 7)
4
5
6
7
8
9

fn list_mersenne() -> Vec<u64> {
    primes(128)
        .into_iter()
        .filter(|p| is_prime(&(2u128.pow(*p as u32) - 1), None).probably())
        .collect()
}