Relevant Courses: EECS 203, Math 297
Proof by Contradiction
First, recall that a Rational Number is a number that can be written as the quotient of an Integer and a non-zero Natural Number. Furthermore, every rational number has a “simplified” form, where the quotient and divisor have no common factors (and thus are Relatively Prime).
Assume for contradiction that is rational. That means that there exists an integer and nonzero such that . If we square both sides, we get that , which implies that . Therefore, is even. This can only be true if is even. But this means that is actually divisible by 4, hence must also be even, and so therefore must be even. So that means both and are even, which is a contradiction to our assumption that they have no common factors.
Therefore, our initial assumption must be false, so is not rational, which means it must be irrational.