Function solovay_strassen::is_prime

pub fn is_prime<T: ToBigUint>(n: &T, k: usize) -> bool

Test whether an integer n is likely prime.

Examples

use solovay_strassen::is_prime;

// Mersenne Prime (2^31 - 1)
let n: u64 = 0x7FFF_FFFF;
// Try the solovay-strassen test 100 times in parallel.
// Fails with a probability of at most `2^{-k}`.
assert!(is_prime(&n, 100));