def is_divisible(num,prime=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199]):
for j in prime:
if (num % j) == 0:
return True
return False
第一部分
def find_primes(N):
prime = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199]
primes = []
n = range(2,N+1)
for num in n:
if is_divisible(num) is False:
primes.append(num)
return(prime+primes)
第二部分
def brun(N):
list = find_primes(N-1)
list2 = find_primes(N)
combs = []
for x in list:
for y in list2:
if x - y ==2:
combs.append((1/x)+(1/y))
print(brun(10000))
运行这个程序,最后我没有。我不知道是什么问题,请帮忙