Skip to main content

Command Palette

Search for a command to run...

The One Detail That Makes √2 Irrational (and Interviewers Love It)

Updated
2 min read
The One Detail That Makes √2 Irrational (and Interviewers Love It)

Cover image: diagram explaining the √2 proof{width="600"}

The decisive move in the classic √2 proof isn't just “use contradiction” — it's the requirement that the fraction is in lowest terms. That's what closes the argument.

Here's the proof, laid out to show exactly where that single constraint matters.

  1. Assume √2 is rational. Then we can write a/b = √2 where a and b are integers and, crucially, a/b is in lowest terms (a and b share no common factor).

  2. Square both sides: a²/b² = 2 ⇒ a² = 2b².

  3. From a² = 2b² we see a² is even, so a must be even. (If a were odd, a² would be odd.)

  4. Write a = 2k for some integer k and substitute back: (2k)² = 2b² ⇒ 4k² = 2b² ⇒ b² = 2k².

  5. Now b² is even, so b is even. Therefore both a and b are divisible by 2.

  6. That contradicts the original assumption that a/b was in lowest terms (no common factors). The contradiction means the assumption that √2 is rational is false. Hence √2 is irrational.

Why this matters: the algebraic manipulations produce the parity conclusions (a and b are even). Without the explicit “lowest-terms” constraint, you wouldn't have a contradiction — you would only conclude that the fraction can be simplified further. The contradiction arises because we forbade any common factor at the start.

Why interviewers like this proof

  • It shows clear logical structure: an assumption, deduction, and a pinpointed contradiction.
  • It tests attention to hidden but crucial assumptions (like "in lowest terms").
  • It demonstrates fluency with basic number theory ideas (parity, divisibility) and proof techniques (proof by contradiction).

Quick generalization

The same pattern proves √p is irrational for any prime p: assume a/b in lowest terms with a² = p b². Then p divides a, write a = p k, substitute, and conclude p divides b too — contradicting lowest terms.

Takeaway

The “lowest-terms” requirement is the single detail that turns routine algebra into a contradiction. Recognizing and using such constraints is exactly why this proof is a favorite in interviews and teaching: it rewards careful assumptions and clean reasoning.

More from this blog

B

bugfree.ai

363 posts

bugfree.ai is an advanced AI-powered platform designed to help software engineers and data scientist to master system design and behavioral and data interviews.