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
Gdel 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.)
Solution zero and infinity | Comment 34 of 36 |
There are two distinct problems with this paradox. It is unsolvable because of the numbers and 0. Like zero, infinity is a number which is neither odd or even. You cannot possibly find the number infinity because it is simply unachievable in classical mathematics. It is in fact a real number, just like zero, but you cannot simply determine whether or not the immense number is odd or even. Infinity is not divisible nor is it changable. ( Infinity * infinity = infinity) (Infinity / infinity = infinity). The same concepts go for zero.  This break in the realm of mathematics causes the paradox to be unsolvable. 
  Posted by matt on 2006-08-06 20:34:07
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 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information