Proving a Number Is Irrational
The classic proof-by-contradiction template used to show a number can't be written as a fraction of integers — the same skeleton behind the textbook proof that the square root of 2 is irrational.
"Prove is irrational" is a staple interview question, not because the result is useful day-to-day, but because it tests whether a candidate can execute a clean proof by contradiction under pressure — a reasoning pattern that recurs constantly in quantitative work.
The template: assume the opposite of what you want to prove, then show that assumption leads to something impossible. Suppose were rational — writable as in lowest terms, where and share no common factor. Squaring both sides gives , so . This means is even, and since only an even number squared can be even, itself must be even — write . Substituting back: , so , giving — meaning is even too, so is also even. But that contradicts the starting assumption that and share no common factor, since both are now even (sharing a factor of 2). The assumption breaks, so cannot be written as at all — it is irrational.
The same skeleton — assume rationality as a fraction in lowest terms, derive a shared-factor contradiction — extends directly to proving is irrational for any that isn't a perfect square, and interviewers sometimes push candidates to generalize the argument on the spot rather than just reciting the case, which is really the point of asking it.
The standard irrationality proof assumes a number equals a fraction in lowest terms, derives that both and must share a common factor, and uses that contradiction to conclude no such fraction exists — a proof-by-contradiction skeleton worth internalizing rather than memorizing case by case.
Related concepts
Practice in interviews
Further reading
- Standard quant interview puzzle collections