What Does "Prove That Root 3 Is Irrational" Mean?
To prove that root 3 is irrational means to show, with certainty, that $\sqrt{3}$ cannot be expressed as a fraction $\tfrac{p}{q}$ where $p$ and $q$ are integers and $q \neq 0$. A number that can be written that way is rational; one that cannot is irrational.
We cannot test this by checking fractions one at a time — there are infinitely many. So we use proof by contradiction: assume the thing we want to disprove is true, follow the logic carefully, and arrive at an impossibility. The impossibility means the assumption was wrong, which proves the opposite. It is the same logical move you would use to argue "it must have rained last night" from "the ground is wet and nothing else could have wet it."
The whole argument also leans on the idea of a coprime fraction — one already reduced to lowest terms, so the numerator and denominator share no common factor. Every fraction can be written this way (just cancel), and that one assumption is the lever the entire proof turns on.
How Do You Prove That Root 3 Is Irrational? The Proof by Contradiction
Here is the full proof, one step at a time. Read it slowly; each line earns its place.
Step 1 — Assume the opposite. Suppose, for contradiction, that $\sqrt{3}$ is rational. Then we can write
$$\sqrt{3} = \frac{p}{q},$$
where $p$ and $q$ are integers, $q \neq 0$, and the fraction is in lowest terms — that is, $p$ and $q$ are coprime (their only common factor is 1).
Step 2 — Square both sides. Squaring removes the root:
$$3 = \frac{p^2}{q^2} \quad\Longrightarrow\quad 3q^2 = p^2.$$
Step 3 — Show that 3 divides $p$. The equation $p^2 = 3q^2$ says $p^2$ is a multiple of 3. By the key lemma below, if 3 divides $p^2$, then 3 divides $p$. So we can write $p = 3k$ for some integer $k$.
Step 4 — Substitute and simplify. Replace $p$ with $3k$:
$$3q^2 = (3k)^2 = 9k^2 \quad\Longrightarrow\quad q^2 = 3k^2.$$
Step 5 — Show that 3 divides $q$ as well. Now $q^2 = 3k^2$ says $q^2$ is a multiple of 3, so by the same lemma, 3 divides $q$.
Step 6 — Reach the contradiction. We have shown that 3 divides $p$ and 3 divides $q$. But Step 1 assumed $p$ and $q$ were coprime — sharing no common factor. They cannot share the factor 3 and be coprime at the same time. Contradiction.
Step 7 — Conclude. The only thing we assumed was that $\sqrt{3}$ is rational, and it led to an impossibility. Therefore the assumption is false:
$$\boxed{\sqrt{3} \text{ is irrational.}}$$
This is the standard NCERT Class 10 proof, and the structure is reusable: the same seven steps prove $\sqrt{2}$, $\sqrt{5}$, and $\sqrt{7}$ irrational — only the prime changes.
The Key Lemma: Why "3 Divides $p^2$" Forces "3 Divides $p$"
Steps 3 and 5 both used the same fact, and it is worth pausing on because it is the one place the proof can quietly break if you skip it. The lemma is:
If a prime number divides $p^2$, then it divides $p$.
Three is prime, so this applies. Why does primality matter? Because of how factors split across a product. If 3 divides $p \times p$, then 3 must divide one of the factors — and both factors are $p$, so 3 divides $p$. This works only because 3 is prime; the step would fail for a composite number.
To see why composite numbers break it, try 4. The number $4$ divides $6^2 = 36$, but $4$ does not divide $6$. So "4 divides $p^2$" does not force "4 divides $p$." If you tried to copy the root-3 proof to "prove" $\sqrt{4}$ is irrational, this lemma would refuse to fire — which is exactly right, because $\sqrt{4} = 2$ is rational. The proof only works for primes (and square-free numbers), and the lemma is the gatekeeper.
A Second Check: The Long-Division Method
The contradiction proof is the rigorous one. There is also a hands-on way to see the irrationality, useful as a sanity check: compute $\sqrt{3}$ by long division and watch the decimal never settle.
Carrying out the square-root long-division algorithm on 3 gives
$$\sqrt{3} = 1.7320508075688772\ldots$$
and the digits never terminate and never fall into a repeating block. A rational number always produces a decimal that either terminates (like $0.25$) or repeats (like $0.333\ldots$). Since $\sqrt{3}$ does neither, it cannot be rational. This is not a substitute for the contradiction proof — you can never finish checking infinitely many digits — but it makes the abstract result tangible. The same long-division idea underlies any square root computation.
Examples of Proving Root 3 Is Irrational
These six examples apply the proof and its lemma to related claims — the way a test actually asks the question.
Example 1
Show that $2\sqrt{3}$ is irrational.
Suppose $2\sqrt{3}$ were rational, say $2\sqrt{3} = r$ for a rational $r$. Then $\sqrt{3} = \tfrac{r}{2}$, which is rational divided by 2 — still rational. But $\sqrt{3}$ is irrational (proved above). Contradiction.
Final answer: $2\sqrt{3}$ is irrational.
Example 2
Prove $\sqrt{3}$ is irrational by assuming its decimal terminates — and watch the wrong path first.
Wrong attempt. A student argues: "The calculator shows $1.7320508$, eight digits, so $\sqrt{3} = \tfrac{17320508}{10000000}$ — that's a fraction, so it's rational." Test the claim: square $1.7320508$ and you get $2.99999\ldots$, not exactly 3. The decimal the calculator showed was rounded; it was never the true value. Assuming the decimal terminates assumes the very thing in question.
Correct. You cannot read irrationality off a finite decimal — a calculator only ever shows a truncation. The proof must be by contradiction on the fraction form, as in the main proof: assume $\sqrt{3} = \tfrac{p}{q}$ coprime, derive that 3 divides both $p$ and $q$, contradiction.
Final answer: the terminating-decimal shortcut is invalid; the contradiction proof is the only rigorous route.
Example 3
Use the lemma to fill the gap: $p^2 = 3q^2$ implies what about $p$?
Since $p^2 = 3q^2$, the number 3 divides $p^2$. Because 3 is prime, by the lemma 3 divides $p$.
$$3 \mid p^2 ;\Longrightarrow; 3 \mid p.$$
Final answer: 3 divides $p$, so $p = 3k$ for some integer $k$.
Example 4
Prove that $\sqrt{3} + 5$ is irrational.
Suppose $\sqrt{3} + 5$ were rational, equal to some rational $r$. Then $\sqrt{3} = r - 5$, a difference of two rationals, which is rational. That contradicts $\sqrt{3}$ being irrational.
Final answer: $\sqrt{3} + 5$ is irrational.
Example 5
Prove that $\dfrac{1}{\sqrt{3}}$ is irrational.
If $\tfrac{1}{\sqrt{3}}$ were rational, then its reciprocal $\sqrt{3}$ would also be rational (the reciprocal of a nonzero rational is rational). But $\sqrt{3}$ is irrational. Contradiction.
Final answer: $\dfrac{1}{\sqrt{3}}$ is irrational. (It equals $\tfrac{\sqrt{3}}{3}$, still irrational.)
Example 6
Where does the analogous proof fail for $\sqrt{9}$, and why is that correct?
Following the steps: assume $\sqrt{9} = \tfrac{p}{q}$ coprime, square to get $9q^2 = p^2$, so 9 divides $p^2$. But 9 is not prime, so the lemma "9 divides $p^2$ implies 9 divides $p$" fails — $9 \mid 6^2$ yet $9 \nmid 6$. The proof stalls, correctly, because $\sqrt{9} = 3$ is rational.
Final answer: the proof relies on primality (or square-freeness); it must fail for perfect squares, and it does.
Why This Proof Matters Beyond the Exam
It is easy to see this as a Class 10 ritual to reproduce on a board. It is more than that — it is one of humanity's oldest demonstrations that some quantities simply cannot be captured by whole-number ratios.
It rewrote what "number" means. The discovery that lengths like the diagonal of a unit square (which is $\sqrt{2}$) are irrational forced mathematics to expand beyond fractions — one of the genuine crises in the history of the subject.
It is a template, not a one-off. The same contradiction-plus-prime-lemma structure proves $\sqrt{p}$ irrational for every prime $p$, and with more work, that numbers like $\pi$ and $e$ are irrational too.
It trains the logical muscle. Proof by contradiction is everywhere in higher mathematics and computer science — from showing certain problems are unsolvable to verifying that an algorithm halts. Learning it on $\sqrt{3}$ is learning a tool you will reuse for years.
The destination is bigger than one number: you are learning how mathematicians know things for certain, not just how to compute them.
The Mathematicians Behind the Irrationality of Roots
Euclid (c. 300 BCE, Alexandria, Greece) gave the earliest rigorous treatment of irrational quantities in his Elements, and the prime-divisibility lemma at the core of this proof traces directly to his work on number theory. The contradiction technique itself — assume the opposite, derive an impossibility — is often called reductio ad absurdum and was sharpened into a standard tool by the Greek geometers who followed him.
Where Students Trip Up When Proving Root 3 Is Irrational
The proof is short, which is exactly why its missing pieces are easy to leave out. Three slips cost the most marks.
Mistake 1: Skipping the "coprime" assumption
Where it slips in: Writing $\sqrt{3} = \tfrac{p}{q}$ without stating that $p$ and $q$ share no common factor.
Don't do this: Start from a general fraction. Without "coprime," Step 6 has nothing to contradict — "3 divides both $p$ and $q$" is only a problem if you promised they had no common factor.
The correct way: Always open with "$p$ and $q$ are coprime" (in lowest terms). That single phrase is what the entire contradiction lands on.
Mistake 2: Asserting "3 divides $p$" without invoking primality
Where it slips in: Jumping from "$3 \mid p^2$" straight to "$3 \mid p$" with no justification.
Don't do this: Treat the step as obvious. It is true here only because 3 is prime — and a grader wants to see that reason stated.
The correct way: Name the lemma: "since 3 is prime and $3 \mid p^2$, it follows that $3 \mid p$." The memoriser archetype reproduces the chain of equations perfectly but omits this justification, because they learned the moves without the reason.
Mistake 3: "Proving" it from the calculator decimal
Where it slips in: Concluding $\sqrt{3}$ is irrational because the calculator "doesn't repeat."
Don't do this: Treat a finite, rounded decimal as evidence. A calculator only shows a truncation, so it can never confirm a decimal is non-repeating forever.
The correct way: Use the contradiction proof. The decimal is a useful illustration (see the long-division section), never a proof on its own.
Key Takeaways
To prove that root 3 is irrational, assume $\sqrt{3} = \tfrac{p}{q}$ with $p, q$ coprime, then derive a contradiction.
Squaring gives $3q^2 = p^2$, which forces 3 to divide $p$, then $q$ — contradicting "coprime."
The proof rests on a prime-divisibility lemma: if a prime divides $p^2$, it divides $p$ (true only because 3 is prime).
The calculator decimal and long division illustrate the result but never prove it — only the contradiction argument does.
The same seven-step structure proves $\sqrt{p}$ irrational for any prime $p$.
Practice These Before Moving On
Prove that $\sqrt{5}$ is irrational, copying the seven-step structure.
Prove that $3\sqrt{3}$ is irrational.
Fill the gap: $q^2 = 3k^2$ implies what about $q$, and why?
Explain in one sentence why the proof fails for $\sqrt{9}$.
Prove that $\sqrt{3} - 2$ is irrational.
Answer to Question 1: identical steps with 5 in place of 3; 5 divides both $p$ and $q$, contradiction. Answer to Question 2: if $3\sqrt{3}$ were rational, $\sqrt{3}$ would be too. Answer to Question 3: 3 divides $q$, because 3 is prime and $3 \mid q^2$. Answer to Question 4: 9 is not prime, so the divisibility lemma fails and $\sqrt{9} = 3$ is rational. Answer to Question 5: if $\sqrt{3} - 2$ were rational, $\sqrt{3}$ would be rational. If Question 3 stalled, revisit the key lemma above.
Want a live Bhanzu trainer to walk through more proofs like this with your child? Book a free demo class — online globally.
Was this article helpful?
Your feedback helps us write better content