All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Paradoxes
Provably unprovable? (Posted on 2004-08-22) Difficulty: 4 of 5
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!)

See The Solution Submitted by Federico Kereki    
Rating: 3.2727 (11 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re(2): A better.... | Comment 9 of 36 |
(In reply to re: A better.... by e.g.)

Larry is right. If Godel proved that there are sentences that are true but cannot be proved, but didn't identify them, the Goldbach Conjecture might be one of them.

But that's just a conjecture. No human being knows whether it is. Only the mystic invisible pink unicorn knows for sure.

(btw, if it's invisible, how do you know it's pink ?)  

  Posted by Penny on 2004-08-22 15:12:34
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information