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

Yes I noticed by many of your postings that you have quite a wit about you. 

Thanks for the info.  I found it quite interesting but far too complex to just absorb (too many references to ordinals cardinals and recursives and wouldn't you know it SYMBOLS).  I got the general idea though. 

Now back to the puzzle.  I think it is possible but improbable. 

  Posted by Bruce Brantley on 2004-08-23 01:08:27
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