Strong Pseudoprimes to Twelve Prime Bases — mentioned by svat

Mon, 23 Oct 2017 18:32:18 GMT

For what it's worth, here is an implementation of the Miller-Rabin primality test that first tries the smallest 13 primes and then tries some random bases: def is_probable_prime(n, num_random_trials=5): """ An implementation of the Miller-Rabin primality test. If this function returns False, then n is definitely not prime. If this function returns True, then n is probably prime: the probability of n being composite is less than 1/4^(num_random_trials), and nonzero only if n >= 3317044064679887385961981 > 3.3*10^24 > 1.3*2^81 (by https://arxiv.org/abs/1509.00864). """ assert n == abs(int(n))…

Paper and discussion history. A mention is not an endorsement.

Strong Pseudoprimes to Twelve Prime Bases · HackerPapers discussions

Strong Pseudoprimes to Twelve Prime Bases — mentioned by svat