A - Goldbach's Conjecture （埃氏筛法）

最新推荐文章于 2024-09-07 11:44:19 发布

@JDI

最新推荐文章于 2024-09-07 11:44:19 发布

阅读量307

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/DEAR_CXN/article/details/88074291

版权

该博客验证了戈德巴赫猜想，即所有大于6的偶数都可以表示为两个奇素数之和。使用埃氏筛法生成素数表，对不超过100万的偶数进行检查，输出满足条件的最大素数对。当没有找到符合条件的素数对时，提示戈德巴赫猜想错误。

摘要由CSDN通过智能技术生成

题目链接

In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:

Every even number greater than 4 can be
written as the sum of two odd prime numbers.

For example:

8 = 3 + 5. Both 3 and 5 are odd prime numbers.
20 = 3 + 17 = 7 + 13.
42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23.

Today it is still unproven whether the conjecture is right. (Oh wait, I have the proof of course, but it is too long to write it on the margin of this page.)
Anyway, your task is now to verify Goldbach's conjecture for all even numbers less than a million.

Input

The input will contain one or more test cases.
E