篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了python Miller Rabinの素数判定法相关的知识，希望对你有一定的参考价值。
"""
Primality Check
"""
from random import randint
def isprime(n):
"""
If given number is prime, this function return true.
"""
if n == 2:
return True
elif n % 2 == 0:
return False
s, d = _represent_format(n - 1)
print(s, d)
testing = randint(1, n - 1)
# TODO we have to check gcd(testing, n) == 1
print(testing)
if _first_condition(testing, n, d) and _second_condition(testing, n, s, d):
return False
return True
def _first_condition(testing, mod, d):
return (testing**d) % mod != 1
def _second_condition(testing, mod, s, d):
for i in range(s):
if testing**((2**i) * d) % mod == mod - 1:
return False
return True
def _represent_format(n):
count = 0
while n % 2 == 0:
count += 1
n = n // 2
return count, n
if __name__ == '__main__':
print(isprime(7))
print(isprime(73))
print(isprime(99923))
以上是关于python Miller Rabinの素数判定法的主要内容，如果未能解决你的问题，请参考以下文章