Goldbach's Conjecture
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<cmath> #include<cstring> using namespace std; int prime[1000000]; //记录1000000以内的素数个数 int numprime = 0; void IsPrime(int*p) { int i,j; //用flag标记是否有其他公约数 int flag; for(i=2;i<1000000;i++) { flag = 1; for(j=2;j<=(int)sqrt(i);j++) { if(i%j==0) flag = 0; } if(flag==1) { *p = i; p++; numprime++; } } } void IsConjecture(int even) { int i; int k; int j; int find = 0; //采用遍历法 for(i=0;i<numprime;i++) { //做差 k = even-prime[i]; if(k>0) { //判断差是否是素数 for(j=0;j<numprime;j++) { if(k<prime[j]) break; if(k==prime[j]) { find = 1; cout<<even<<" = "<<prime[i]<<" + "<<k<<endl; } } } //按从小到大遍历,找到的第一对一定是差最大的 if(find==1) break; } if(find==0) cout<<"Goldbach's Conjecture is wrong."<<endl; } int main() { //输入 int input[100]; int i; memset(input,0,sizeof(input)); for(i=0;i<100;i++) { cin>>input[i]; if(input[i]==0) break; } //生成素数表 memset(prime,0,sizeof(prime)); IsPrime(prime); //分割 cout<<"---------------------------------------"<<endl; //判断输入是否符合假设 for(i=0;i<100;i++) { if(input[i]!=0) IsConjecture(input[i]); else break; } }