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!)
you just have to look past your nose.
it states here that the number one is not prime. and so the number four is the exception to the Goldbach conjecture. It is not a composite of two odd primes. Hah! So there.
Posted by Felix
on 2004-11-12 14:41:11