You've probably seen the proof that √2 is irrational. Uses contradiction. Elegant. It's the classic example — the one every math student meets in their first week of discrete math or number theory. Clean. Shows that assuming √2 = a/b in lowest terms leads to both a and b being even, which is impossible The details matter here. That's the whole idea..
But what about √6?
Most textbooks mention it in passing. " Then they move on. "Similarly, √6 is irrational.Worth adding: the details shift in ways that trip people up. And if you're like me, you nodded along and thought, yeah, sure, same idea. But here's the thing — it's not exactly the same idea. And if you actually sit down to write the proof from scratch without peeking, you might hesitate Worth keeping that in mind..
I did. More than once.
So let's walk through it properly. On top of that, no hand-waving. No "left as an exercise." Just the proof, the pitfalls, and why this particular square root has a few surprises up its sleeve Simple, but easy to overlook..
What Does "Irrational" Actually Mean Here?
Before we touch √6, let's be precise about what we're proving.
A number is irrational if it cannot be written as a ratio of two integers. That is, there do not exist integers p and q (with q ≠ 0) such that the number equals p/q. Equivalently, its decimal expansion never terminates and never repeats.
√6 is the positive number that, when squared, gives 6. Approximately 2.44948974278... The digits go on forever with no pattern. But "looks random" isn't a proof. We need to show that no fraction can equal √6 exactly.
And the standard tool for this? Proof by contradiction.
Assume the opposite — that √6 is rational — and derive something impossible. That's the plan Small thing, real impact..
Why √6 Is Slightly Trickier Than √2
Here's where most people gloss over the difference.
For √2, the contradiction comes from parity: if √2 = a/b in lowest terms, then a² = 2b², so a² is even, so a is even, so a = 2k, then 4k² = 2b², so b² = 2k², so b is even — contradiction, since a and b can't both be even.
Clean. The logic hinges on a single prime: 2.
But 6 = 2 × 3. But two distinct primes. That changes the algebra.
If √6 = a/b in lowest terms, then a² = 6b². Now a² is divisible by 6. Which means does that mean a is divisible by 6? But not necessarily. Divisibility by a composite number doesn't work the same way as divisibility by a prime Most people skip this — try not to..
Some disagree here. Fair enough.
This is the trap. I've seen students write "a² is divisible by 6, so a is divisible by 6" and call it a day. Think about it: that's wrong. a = 6 works. a = 12 works. But a = 2? Still, 2² = 4, not divisible by 6. a = 3? 9, not divisible by 6. Consider this: a = 4? Practically speaking, 16, nope. a = 6? On the flip side, 36, yes. a = 12? 144, yes Which is the point..
So a² divisible by 6 does imply a divisible by 6 — but it's not obvious. You have to argue it via the prime factors: if 2 | a² then 2 | a, and if 3 | a² then 3 | a, so 6 | a. That extra step matters.
And there's another path entirely — one that avoids the composite-number trap. We'll get to both.
The Standard Proof (Prime Factorization Route)
Let's do this carefully.
Theorem: √6 is irrational.
Proof. Suppose, for contradiction, that √6 is rational. Then there exist integers a and b, with b ≠ 0, such that √6 = a/b and the fraction is in lowest terms (gcd(a, b) = 1).
Square both sides:
6 = a² / b²
Multiply:
a² = 6b²
So a² is a multiple of 6. Since 6 = 2 × 3, this means a² is divisible by 2 and by 3 Most people skip this — try not to..
Now — and this is the key lemma — if a prime p divides a², then p divides a. This follows from the fundamental theorem of arithmetic (unique prime factorization). If p appears in the prime factorization of a², it must have come from a, and with twice the exponent.
Apply this with p = 2: 2 | a² ⇒ 2 | a.
Apply with p = 3: 3 | a² ⇒ 3 | a.
Since 2 and 3 are distinct primes, their product divides a: 6 | a.
Write a = 6k for some integer k. Substitute back:
(6k)² = 6b²
36k² = 6b²
6k² = b²
So b² is a multiple of 6. By the same prime-divisibility argument, 6 | b The details matter here..
But now both a and b are divisible by 6. That contradicts gcd(a, b) = 1 Easy to understand, harder to ignore..
Therefore our assumption was false. √6 is irrational. ∎
Why the Prime Lemma Matters
That step — "if p | a² then p | a" — is doing heavy lifting. It's true for primes. And it's false for composites in general. As an example, 4 | 6² (36), but 4 ∤ 6. So you can't just say "6 divides a², so 6 divides a" without justification. The justification is: 2 and 3 each divide a², so each divides a, so their product divides a That alone is useful..
This is the nuance that separates a rigorous proof from a hand-wavy one Worth keeping that in mind..
An Alternative Proof: Using √2 and √3
Here's a different angle. It's shorter if you already know √2 and √3 are irrational — but it requires a lemma about products of irrationals.
Lemma: If x and y are irrational, xy can be rational or irrational. (√2 × √2 = 2, rational. √2 × √3 = √6, irrational — which is what we're proving!)
So you can't just say "product of irrationals is irrational." That's false.
But you can use this approach:
Suppose √6 is rational. Then
Continuing from the point where the alternative line of reasoning begins:
Suppose, for the sake of argument, that √6 can be expressed as a reduced fraction c/d with d ≠ 0 and gcd(c,d) = 1. Plus, hence d² is also a multiple of 6, forcing 6 to divide d as well. Squaring both sides yields 6 = c²/d², or equivalently c² = 6d². This equation tells us that c² is a multiple of 6, and therefore both 2 and 3 divide c². But then both numerator and denominator share the factor 6, contradicting the assumption that the fraction was in lowest terms. Substituting back gives (6k)² = 6d², which simplifies to 6k² = d². That's why consequently, 6 divides c, so we can write c = 6k for some integer k. Worth adding: by the same prime‑divisibility lemma used earlier, each of those primes must also divide c. This contradiction shows that √6 cannot be rational.
The argument above mirrors the classic prime‑factor proof, yet it arrives at the same conclusion by tracing the divisibility of the numerator and denominator simultaneously. It underscores a more general principle: whenever a square integer is divisible by a product of distinct primes, each of those primes must appear in the factorization of the original integer. This principle extends to any non‑square integer n; if n were rational, the same chain of reasoning would force every prime divisor of n to divide both the numerator and denominator, leading to an impossibility.
Another perspective involves viewing √6 as a root of the polynomial x² − 6. Over the integers, this polynomial is primitive (its coefficients have greatest common divisor 1) and irreducible by Eisenstein’s criterion with the prime 2 (or 3). A theorem from algebra—Gauss’s lemma—states that a primitive polynomial that is irreducible modulo a prime remains irreducible over the rationals. Since x² − 6 fails to factor into linear terms with rational coefficients, its sole real root, √6, cannot be rational. This approach bypasses explicit manipulation of divisibility and instead leans on the structural properties of polynomials.
A more constructive angle can be taken by approximating √6 with continued fractions. The simple continued fraction of √6 is [2; 2, 12, 2, 12, …], a purely periodic sequence that never terminates. Now, a terminating continued fraction would correspond to a rational number, while an infinite periodic one signals an irrational square root. Thus the very structure of the expansion confirms the irrationality of √6 without invoking contradiction Took long enough..
Finally, a conceptual take‑away: the irrationality of √6 is not an isolated curiosity but a special case of a broader theorem—the square root of any positive integer that is not a perfect square is irrational. The proof hinges on the uniqueness of prime factorization and the impossibility of “balancing” the exponents of those primes in both numerator and denominator of a reduced fraction. Whether one chooses to highlight divisibility, polynomial irreducibility, or continued fractions, the underlying logical skeleton remains the same The details matter here..
Short version: it depends. Long version — keep reading.
Conclusion
Through several complementary arguments—prime‑factor analysis, simultaneous divisibility, algebraic irreducibility, and continued‑fraction periodicity—we have demonstrated that √6 cannot be expressed as a ratio of integers. Each method reinforces the central idea that the presence of an unbalanced set of prime exponents in a putative rational representation leads to an inevitable contradiction. Hence, √6 stands as an irrational number, consistent with the general rule that the square root of a non‑square integer is irrational That alone is useful..
