本文探讨了数学中著名的未解决问题——哥德巴赫猜想，即所有大于2的偶数都可以表示为两个素数之和。文章通过提供一个检查此猜想在107以内的整数是否成立的编程任务，介绍了如何利用打表和存储素数的方法，如欧拉筛法和埃氏筛法来解决这个问题。并给出了样例输入和输出。
Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:
Every even integer, greater than 2, can be expressed as the sum of two primes [1].
Now your task is to check whether this conjecture holds for integers up to 107.
Input
Input starts with an integer T (≤ 300), denoting the number of test cases.
Each case starts with a line containing an integer n (4 ≤ n ≤ 107, n is even).
Output
For each case, print the case number and the number of ways you can express n as sum of two primes. To be more specific, we want to find the number of (a, b) where
1) Both a and
最低0.47元/天 解锁文章
扫一扫
1325
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
