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.)
No Subject | Comment 29 of 36 |
The Riemann Hypothesis (RH) is another famous open problem.  Apparently some mathmeticians have assumed the truth of RH to make further  hypothesis.  (I suppose in number theory).  Suppose we admit the Goldbach Conjecture (GC) as a new axiom to construct a new system.  Suppose we construct another system with ~GC as an axiom.  (~GC says the conjecture is false).  If one system led to logical contradicitions could we draw any conclusions?  We would have to assume consistency in the original system tho-lol.
  Posted by Jeff on 2005-07-24 15:23:57
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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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