Gödel proved that there are true sentences that cannot be proved.
Suppose I told you that the Goldbach conjecture is one of those. (The Goldbach conjecture supposes that every even integer number can be expressed as the sum of two odd primes.)
Is that logically possible? (And, no, I haven't proved it!)
So I realize the solution is already posted, but lets think about it
for a second without all this computer programming stuff. Take the
number two. 2 is an even integer, but 2 can not be expressed as the sum
of two odd primes-1 is not a prime and neither is 0... so I fail to see
how this works...?
Posted by sean
on 2005-11-08 11:26:50