Anonymous user
Miller–Rabin primality test: Difference between revisions
m
→Python: Proved correct up to large N
m (→{{header|REXX}}: changed word in the REXX section header, added whitespace and optimization, added option (random seed) to allow for repeatable Miller-Rabin primality tests.) |
|||
Line 3,952:
def is_prime(n, _precision_for_huge_n=16):
if n in _known_primes
return True
if any((n % p) == 0 for p in _known_primes) or n in (0, 1):
return False
d, s = n - 1, 0
| |||