I have been meaning to do this for a while …

Pythagoras was said to be shocked by the proof that is an irrational number (i.e., that it cannot be represented as a ratio of two whole numbers). The proof (by contradiction) is a simple one.

If is rational then and where and are the smallest nominator and denominator possible, i.e, in the lowest terms.

Hence and so must be even (as two odd numbers multiplied always give an odd number – let and be even numbers then ). Hence .

But we also have and thus and and so is even.

So we have and sharing a common factor of 2, so they cannot be the nominator and denominator of the fraction in the lowest terms.

~~But if and are both even then they share a common factor of 2 and : implying that and , an obvious contradiction: hence cannot be a rational.~~

**Update**: I have made the final step of this shorter and clearer.

**Further update**: I have been told (see comments below) I would have been better sticking with a clearer version of the original ending ie., we state that are the lowest terms. Then, plainly as they have a factor in common (2) they cannot be the lowest terms and so we have a contradiction. Would be great if someone could explain why we cannot use the contradiction.

**And another update**: Should have stuck with the original explanation – which I have now restored in a hopefully clearer way. The comments below are really interesting and from serious mathematicians, so please have a look!

###### Related articles

- An interesting inequality (sirjackshen.wordpress.com)
- Heuristic ideas about bounded prime gaps (motls.blogspot.com)
- Online reading seminar for Zhang’s “bounded gaps between primes” (terrytao.wordpress.com)

In your last step, you deduce that from , which isn’t necessarily correct. The only deduction that holds is that .

The part of this proof that usually lends the contradiction is from the fact that would have a 2 in common. In particular, an earlier step in the proof is to generally assume that where and are in lowest terms (and hence have no common factors).

This was one of my favorite proofs as an undergraduate: Thanks for taking the time to share it with others. đź™‚

Thanks. Not a maths graduate, so happy to accept I have got it wrong, but would like to know more đź™‚ I did, essentially, have a version of the fact they were in lowest terms before and then changed it to current version – why doesn’t that necessarily hold?

Sorry for not responding sooner; I haven’t been around much today.

The short answer as to why that doesn’t necessarily hold can be shown by an example: though clearly . As mentioned above, however, .

The longer answer is from abstract algebra: Given a commutative ring with identity , its field of fractions is constructed by “attaching” to the set of multiplicative inverses (namely, reciprocals) of nonzero elements of . This definition is well-defined precisely when the construction is made as an equivalence class in which elements and are considered equal whenever .

Given this construction, the answer for your specific proof lies in the fact that is the field of fractions of , and so uniqueness of “fractions” (elements of ) exists only up to the equivalence mentioned above.

If you ever want to talk about this – or anything mathematical, really – further, don’t hesitate to let me know! đź™‚

Err, yes. I’ve been a bit silly really. Thanks

Also, in my explanation of , I also apparently neglected to mention that if has zero divisors, they also can’t be given reciprocals. To be precise, the definition I gave sort of implies that is assumed to have been an integral domain, though the more general construction for is done similarly. For details, check here:

http://en.wikipedia.org/wiki/Field_of_fractions

One can also quickly complete the proof by saying that a^2 = 2b^2 is impossible because in the factorization of the left hand side to primes, each prime is exponentiated to an even exponent, while the decomposition of the right hand side to a product of primes has an odd power of 2 (because of the extra power of two), so they can’t be equal. One needs to use that the factorization exists for each positive integer and is unique.

Yes, thanks.

“Would be great if someone could explain why we cannot use the a = 2k = k contradiction.” If a/b = c/d and a/b = e/f, it does not imply that c = e and d = f UNLESS both c/d and e/f are in lowest terms. So going from a/b = k/p to a = k without the lowest terms bit is an unjustified leap.

I suppose that is pretty obvious really. Not sure why i let it pass me by. Thanks