英语题翻译6

Goldbach's Conjecture | JXNUOJ

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.

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.

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."

翻译：

在1742年，Christian Goldbach，一个德国业余数学家，给Leonhard Euler写了一封信，他在信中提出了以下猜想：所有大于或等于4的偶数可以被写成两个素数奇数的和。

例如，8=3+5，3和5都是奇数素数；20=3+17=7+13；42=5+37=11+31=13+29=19+23.

至今，这个猜想仍然无法证实是否正确。（噢，等等，我当然有证据，但是写在这个纸上太长了）无论如何，你现在的任务是验证所有小于一百万的偶数的哥德巴赫猜想。

输入将包含一个或多个测试用例。每个测试用例由一个偶数n(6<=n<1000000)组成。输入将由 n 的值为 时0 终止。

对每一个测试用例，一行打印一个n=a+b，其中a和b都是奇数素数。数字和符号之间应该用一个空格分开，像如下样例输出。如果有多于一对奇数素数加起来等于n，选择b-a差值最大的一对。如果没有这样一对数字，打印一句“Goldbach's conjecture is wrong.”。