eg.
3 = prime
5 = prime
8 = even
3 + 5 = 8
2007-08-05 11:55:49 · 8 answers · asked by Anonymous in Science & Mathematics ➔ Mathematics
This is a very difficult problem. It is usually called the Goldbach Conjecture. It has not been proven yet, despite the efforts of many accomplished mathematicians. Schnirelman proved in 1939 that every even number greater than 4 is the sum of not more that 300000 primes. This is the best result currently known. It has been checked for all numbers up to 3*10^7, and no counterexample was found. See the article below for more info:
2007-08-05 12:05:32 · answer #1 · answered by pki15 4 · 3⤊ 0⤋
Good heavens, are you asking us to prove Goldbach's
conjecture??
This is one of the oldest unsolved problems in
mathematics.
By the way, the latest results on this are
1). The conjecture is true for even n <=10^18.
2). Every sufficiently large even number is
the sum of at most 6 primes. (See Wikipedia
for details.)
2007-08-05 19:24:10 · answer #2 · answered by steiner1745 7 · 0⤊ 0⤋
This answer is easy it is because that the only even prime number is 2. Everyone knows that two odd numbers always will make a even. Therefor explaining the answer they will always make a even because two odds will always make a even.
2007-08-05 19:16:14 · answer #3 · answered by Anonymous · 0⤊ 1⤋
It hasn't been proved yet.
I can prove however that the sum of any two even primes is always the same.
2007-08-05 19:07:31 · answer #4 · answered by Paladin 7 · 1⤊ 0⤋
its like asking to prove 1 and 1 sum to 2...
2007-08-05 19:04:56 · answer #5 · answered by GalNextDoor 4 · 0⤊ 3⤋
because, apart from 2, there are no even primes
2007-08-05 19:05:28 · answer #6 · answered by Anonymous · 0⤊ 3⤋
I agree with pik 15!
He has it right ; )
2007-08-05 19:19:48 · answer #7 · answered by Anonymous · 0⤊ 0⤋
Because god said so
2007-08-05 18:59:30 · answer #8 · answered by yzarc jr 2 · 0⤊ 3⤋