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.)
Some Thoughts my 2 cents | Comment 4 of 36 |
Well i can't prove that all even numbers are sum of 2 prime numbers, but i remember my teacher saying that's true last yr i think so i'll take it to be true.

And for the reason why it can't be proved, something to do with integers being infinite maybe and to prove that all even numbers are sum of 2 primes u have to test each of them to show that's the case and since we cant try them all we can't prove it?
Does that make sense? And right now there isn't even a way to find primes efficiently so i guess u can't use anything like induction or what ever other proves are out there to deal with these kinds of problems.

  Posted by Steven on 2004-08-22 10:49:02
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 (2)
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