Project Euler Problem 46

wxinbeings

于 2018-06-27 23:15:28 发布

阅读量220

点赞数

CC 4.0 BY-SA版权

分类专栏： Project Euler 文章标签： Project Euler

本文链接：https://blog.csdn.net/wxinbeings/article/details/80836363

Project Euler 专栏收录该内容

56 篇文章

订阅专栏

本文探讨了哥德巴赫的一个猜想：每个奇合数可以表示为一个素数加上一个平方数的两倍。通过编程验证了该猜想的错误，并找出最小的无法用这种方式表达的奇合数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem 46

It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square.

9 = 7 + 2×1²
15 = 7 + 2×2²
21 = 3 + 2×3²
25 = 7 + 2×3²
27 = 19 + 2×2²
33 = 31 + 2×1²

It turns out that the conjecture was false.

What is the smallest odd composite that cannot be written as the sum of a prime and twice a square?

克里斯蒂安·哥德巴赫曾经猜想，每个奇合数可以写成一个素数和一个平方的两倍之和。

9 = 7 + 2×1²
15 = 7 + 2×2²
21 = 3 + 2×3²
25 = 7 + 2×3²
27 = 19 + 2×2²
33 = 31 + 2×1²

最终这个猜想被推翻了。

最小的不能写成一个素数和一个平方的两倍之和的奇合数是多少？

def isprime(x):
    if x <= 1:
        return False
    for i in range(2,int(x**0.5+1)):
        if x % i == 0:
            return False
    return True

odd = {2*n+1 for n in range(10000) if not isprime(2*n+1)}
primes = [x for x in range(10000) if isprime(x)]
product = set()
for i in primes:
    for j in range(1,1000):
        product.add(i + 2*j**2)
for k in odd:
    if k not in product:
        print(k)