Christian Goldbach 提出每个奇合数都可以写作一个质数与一个平方数的二倍之和:
9 = 7 + 2×1**2
15 = 7 + 2×2**2
21 = 3 + 2×3**2
25 = 7 + 2×3**2
27 = 19 + 2×2**2
33 = 31 + 2×1**2
但是这个推测是错误的。
最小的不能写作一个质数与一个平方数的二倍之和的奇合数是多少?
import math
import time
def is_prime(x):
""" 质数判断 """
if x == 1:
return False
if x == 2:
return True
assert math.floor(x) == x and x > 0
x_sqrt = int(math.sqrt(x))
l = [2]
l.extend(range(3, x_sqrt + 1, 2))
for i in l:
if x % i == 0:
return False
return True
t0 = time.time()
primes_list = [3, 5, 7]
num = 7
while 1:
num += 2
if is_prime(num):
primes_list.append(num)
else:
for prime_num in primes_list:
sqrt_num = math.sqrt((num - prime_num) / 2)
if sqrt_num == int(sqrt_num):
# print(str(num) + ' = ' + str(prime_num) + ' + 2 * ' + str(sqrt_num) + ' ** 2')
break
if sqrt_num != int(sqrt_num):
break
print(num)
t1 = time.time()
print(t1 - t0)