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: Waiting for Godel (Spoiler) | Comment 2 of 36 |
(In reply to Waiting for Godel (Spoiler) by Penny)

"Riiiiiiiggghht" [he said, right hand in a loose fist, little finger extended and nearly touching the corner of his mouth, his head shaved, his face scarred from an old Luge accident in Rangoon, in his lap an evil cat named Mr. Bigglesworth]
  Posted by Larry on 2004-08-22 09:38:25

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information