Goldbach's Conjecture
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 39018 | Accepted: 14944 |
Description
In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:
For example:
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.
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.
Each test case consists of one even integer n with 6 <= n < 1000000.
Input will be terminated by a value of 0 for n.
Each test case consists of one even integer n with 6 <= n < 1000000.
Input will be terminated by a value of 0 for n.
Output
For each test case, print one line of the form n = a + b, where a and b are odd primes. Numbers and operators should be separated by exactly one blank like in the sample output below. If there is more than one pair of odd primes adding up to n, choose the pair where the difference b - a is maximized. If there is no such pair, print a line saying "Goldbach's conjecture is wrong."
Sample Input
8 20 42 0
Sample Output
8 = 3 + 5 20 = 3 + 17 42 = 5 + 37
#include <iostream> #include <cstring> #include <cstdio> #include <stdlib.h> #include <algorithm> using namespace std; const int N = 1000001; int su[N]; bool u[N]; void sai() { memset(u,true,sizeof(u)); int s=1; for(int i=2; i<N; i++) { if(u[i]) su[s++]=i; //将筛中最小数送入素数表 for(int j=1; j<s; j++) // 搜索素数表中的没每个数 { if(i*su[j]>N) break; //若i与当前素数的乘积超出范围,分析下一整数i u[i*su[j]]=false; //将i于当前素数的乘积从筛中筛去 if(i%su[j]==0) break; //若当前素数为i的最小素因子,则分析下一整数i } } } int main() { sai(); int n; while(scanf("%d",&n),n) { int s1,s2; bool flag=true; for(int i=2; i<=n; i++) { if(u[i]) { if(2*i>n) break; int k=n-i; if(u[k]) { flag=false; s1=i; s2=k; break; } } } if(flag) printf("Goldbach's conjecture is wrong.\n"); else printf("%d = %d + %d\n",s1+s2,s1,s2); } return 0; }