Goldbach's Conjecture 解题报告

原创 2012年03月30日 08:36:48

Description

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.
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<math.h>
#include<stdio.h>
int h[1000001]={0};
int main()
{
	int  n,a,b,c,d,k=0;
	h[1]=1; //1不是素数。
	b=(int)sqrt(1000000);
	for(a=2;a<=b;a++)
	{
		if(h[a]==0)
		{
			d=1;
			for(c=2;d<1000000;c++)
			{
				d=a*c;  //能相乘得到的都不是素数。
				h[d]=1;
				if(d==1000000)
					break;
			}
		}
	}
	while(scanf("%d",&n)!=EOF)
	{
		k=0;
		if(n==0)
			break;
		else
		{
			for(b=2;b<n;b++)
			{
				if(h[b]==0&&h[n-b]==0)
				{
					k=1;
					printf("%d = %d + %d\n",n,b,n-b);
					break;
				}
			}
			if(k==0)
				printf("Goldbach's conjecture is wrong.\n");
		}
	}
	return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

K - Goldbach's Conjecture解题报告

K - Goldbach's Conjecture Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%...

POJ-2262 Goldbach's Conjecture 解题报告(数论) 哥德巴赫的猜想

连接--K -Goldbach's Conjecture Time Limit:1000MS    Memory Limit:65536KB    64bit IO Format:%I64d &.....

浙大 ACM 解题报告

  • 2015-12-30 21:51
  • 835KB
  • 下载

九度OJ题目1440:Goldbach's Conjecture

题目1440:Goldbach's Conjecture 时间限制:1 秒 内存限制:128 兆 特殊判题:否 题目描述: Goldbach's Conjecture: For any e...

HDU 2000-2099 解题报告.CHM

  • 2013-08-08 20:51
  • 831KB
  • 下载

HDU2501解题报告

  • 2014-07-10 10:44
  • 12KB
  • 下载

poj 2262 Goldbach's Conjecture 筛法 哥德巴赫猜想

poj 2262 Goldbach's Conjecture 筛法 哥德巴赫猜想 In 1742, Christian Goldbach, a German amateur mathematician...

HDU1019(2028)解题报告

  • 2014-07-11 10:05
  • 555B
  • 下载

2014NOIP普及组解题报告

  • 2015-01-30 10:06
  • 38KB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)