On an exam, you see the words "Prove \sqrt{n} is irrational." Before you think about anything else, a single bell should ring in your head: proof by contradiction, using the parity of prime exponents. That reflex is the whole skill. The rest of the proof writes itself once the reflex fires.

This article is about building that bell — recognising the signal, reaching for the right opening, and executing the squaring step that turns "irrational" into a statement about whether integers have an odd or even number of each prime factor.

The signal

The moment you read the phrase "prove \sqrt{n} is irrational" (where n is a positive integer that is not a perfect square), this should be your internal monologue:

  1. Contradiction. Assume \sqrt{n} is rational.
  2. Lowest terms. Write \sqrt{n} = p/q with \gcd(p, q) = 1.
  3. Square to kill the root. n q^2 = p^2.
  4. Prime-exponent parity. A perfect square has every prime appearing an even number of times in its factorisation. So p^2 is a square and q^2 is a square. Whatever primes live in n with an odd exponent cannot be balanced by the square on the other side.
  5. Contradiction lands — either n has a prime factor that forces q to share a factor with p, or the parity of exponents simply cannot match.

Five beats. They fire in sequence every single time. The only thing that changes between \sqrt{2}, \sqrt{3}, \sqrt{7}, \sqrt{12} is which prime you pivot on.

Why squaring + prime parity is the natural tool

The key observation is almost embarrassingly simple. Consider the prime factorisation of any positive integer m:

m = 2^{a_1} \cdot 3^{a_2} \cdot 5^{a_3} \cdot 7^{a_4} \cdots

Now square it:

m^2 = 2^{2a_1} \cdot 3^{2a_2} \cdot 5^{2a_3} \cdot 7^{2a_4} \cdots

Every exponent doubles, so every prime appears an even number of times in the factorisation of any perfect square. That is the universal signature of "being a square": all prime exponents are even.

Why: unique prime factorisation (the fundamental theorem of arithmetic) guarantees that the exponents in m are well-defined. Squaring m multiplies every exponent by 2, which sends all exponents to even numbers. Reverse the direction: if some prime appears with an odd exponent in a number, that number is not a perfect square.

Now look at the equation n q^2 = p^2. The right side is a perfect square — all its prime exponents are even. On the left, q^2 has all even exponents. So for the two sides to match, every prime exponent in n must also be even — i.e. n itself must be a perfect square. If n is not a perfect square, the equation is impossible over the integers. Done.

The recognition flowchart

Decision flow for proving √n irrational A flowchart starting from the question "See √n, need to prove irrational?". An arrow leads to "Is n a perfect square?". The yes branch leads to "Then √n is rational — no proof needed, it's an integer". The no branch leads to "Contradiction + prime parity", which then fans into steps: assume p/q lowest terms, square to get nq² = p², look at prime exponents, find parity mismatch, contradict lowest terms. See √n to prove irrational Is n a perfect square? yes no √n is rational e.g. √4 = 2, √9 = 3 — no proof needed Reach for contradiction + prime-exponent parity 1. Assume √n = p/q, gcd(p,q)=1 2. Square: nq² = p² 3. Find odd-exponent prime in n 4. Force shared factor — contradict
The two-step filter: first check whether $n$ is a perfect square (if yes, nothing to prove). If not, the prime-parity contradiction is on autopilot. The same four inner steps work for every non-square $n$.

The canonical execution: √2

Prove $\sqrt{2}$ is irrational

Step 1–2. Suppose \sqrt{2} = p/q with \gcd(p, q) = 1.

Step 3. Square: 2 q^2 = p^2.

Step 4 (prime parity). The right side p^2 has the prime 2 appearing an even number of times (as every prime in a square does). The left side 2 q^2 has the prime 2 appearing 1 + (\text{even}) = \text{odd} times. Parity mismatch.

Concretely: p^2 is even, so p is even. Write p = 2k. Then 2q^2 = 4k^2, so q^2 = 2k^2, so q^2 is even, so q is even. But then 2 \mid p and 2 \mid q — they share a factor, contradicting \gcd(p, q) = 1. \blacksquare

The whole proof is three lines of algebra hanging off a one-line idea: squares have all-even prime exponents.

The template extends: √3

Prove $\sqrt{3}$ is irrational

Suppose \sqrt{3} = p/q in lowest terms. Square: 3 q^2 = p^2. The prime 3 appears in 3q^2 an odd number of times (1 plus double whatever q contributes), but in p^2 an even number of times. So 3 \mid p^2, which means 3 \mid p (Euclid's lemma). Write p = 3k. Then 3q^2 = 9k^2, so q^2 = 3k^2, so 3 \mid q. Both p and q share a factor of 3 — contradiction. \blacksquare

The word-for-word same script, with "3" in place of "2". The pivot prime is 3 because 3 is the prime appearing with odd exponent in n = 3.

A composite target: √12

Prove $\sqrt{12}$ is irrational

12 = 2^2 \cdot 3. The prime 2 appears an even number of times (good), but the prime 3 appears once — an odd exponent. That is the pivot.

Suppose \sqrt{12} = p/q in lowest terms. Square: 12 q^2 = p^2, i.e. 2^2 \cdot 3 \cdot q^2 = p^2. The exponent of 3 on the left is 1 plus 2 \cdot (\text{exponent of } 3 \text{ in } q), which is odd. The exponent of 3 on the right is 2 \cdot (\text{exponent of } 3 \text{ in } p), which is even. The two sides cannot be equal by unique factorisation — contradiction. \blacksquare

You could also write \sqrt{12} = 2\sqrt{3} and reduce to "\sqrt{3} is irrational, therefore 2\sqrt{3} is irrational," but the direct prime-parity argument is just as clean and shows you the general shape.

When the signal does NOT apply

If n is a perfect square, stop. You should not be proving irrationality, because \sqrt{n} is actually rational — in fact, a non-negative integer.

So before you launch into the contradiction proof, run the one-second check: is n in the list 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, \dots? If yes, the question is ill-posed or testing whether you spot it. If no, the signal fires.

The signal in one sentence

See "\sqrt{n}, prove irrational," n not a perfect square, think immediately:

"Assume \sqrt{n} = p/q in lowest terms; square; pick the prime in n with odd exponent; derive that the same prime divides both p and q; contradict lowest terms."

That sentence, rewritten in algebra, is the entire proof. Every time. The recognition is the work — the execution is mechanical.

Related: Real Numbers — Properties · "Prove X Is Irrational" — Reach for Contradiction with p/q in Lowest Terms · Is √4 Irrational Because It's Under a Root Sign? · Tennenbaum's Picture-Proof That √2 Is Irrational