python求n以内的孪生素数对

Question

如题所述

Answer 1

def is_prime(m):
"""判断m是否素数"""
if m < 2:
return False
for i in range(2, int(m**(1/2))+1):
if m % i == 0:
return False
return True
def twin_primes(n):
"""求n以内的孪生素数对"""
m, res = 3, {}
while m < n - 1:
if is_prime(m) and is_prime(m + 2):
res[m] = m + 2
m += 2
m += 2
return res
print(twin_primes(100))

程序缩进如图所示