>On 20 Mar 00, at 19:01, Stefan Struiker wrote:
>
>> LONDON , March 17 � Two publishers are offering a
>> million dollars to anyone who can prove that all
>> even numbers are the sum of two prime
>> numbers. No one has cracked the problem in the
>> more than 250 years since it was first posed, and
>> Friday�s announcement indicated the publishers
>> aren�t too worried about having to pay up.
I'm guessing the actual conjecture is worded something like,
Each even number can be expressed as the sum of exactly two unequal primes.
Otherwise the question would already be answered, as all evens
can be expressed either as a summation of the value two, or as
n= n/2 + n/2, in which n/2 may be prime or not, but if not, could themselves
be expressed as the sums of primes.
I wonder if this could fall to the approach used in the 4-color map problem.
(If I recall correctly, a combination of subdivision into many subcases,
followed by a lot of computing time.)
Could someone post the actual wording of the conjecture?
Ken
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
