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.)
My thought is.... | Comment 6 of 36 |

Before the Pythagorean Theorem was proved, somebody might have said that it was "true but cannot be proved". How do you prove that something cannot be proved ? The conjecture that every even integer is the sum of two odd primes could conceivably be proved by mathematical induction. It might be proved that way sometime in the future. A single counterexample might disprove it sometime in the future.

So I don't think anybody can say right now that it is either true or not provable/disprovable.   


  Posted by Penny on 2004-08-22 12:27:19
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 (1)
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