**Book A Free Math Class**

# Prove That Root 3 Is Irrational — Full Proof

## TL;DR  
To prove that root 3 is irrational, assume the opposite — that \(\sqrt{3} = \tfrac{p}{q}\) for coprime integers — then show 3 must divide both p and q, contradicting "coprime." This article gives the full proof by contradiction step by step, the key divisibility lemma it rests on, a long-division check, worked examples, and the mistakes that quietly break the argument.

## 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≠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.

## 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  
\[ 3 = \frac{p^2}{q^2} \]  
where p and q are integers, q≠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.** 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:

\[ \sqrt{3} \text{ is irrational.} \]

## 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.

## 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…\) 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…). Since \(\sqrt{3}\) does neither, it cannot be rational.

## 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 23\(\sqrt{3}\) is irrational.** Suppose 23\(\sqrt{3}\) were rational, say 23 = r\(\sqrt{3} = r\). Then 3 = \(\frac{r}{2}\), which is rational divided by 2 — still rational. But \(\sqrt{3}\) is irrational (proved above). Contradiction.

**Final answer:** 23\(\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, so 3 = \(\frac{17320508}{10000000}\), that's a fraction, so it's rational." Test the claim: square 1.7320508 and you get 2.99999… not exactly 3. The decimal the calculator showed was _rounded_; it was never the true value.  
_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.

**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.

**Final answer:** 3 divides p, so \(p=3k\) for some integer k.

### Example 4  
**Prove that \(3 + 5\sqrt{3}\) is irrational.**  
Suppose \(3 + 5\sqrt{3}\) were rational, equal to some rational r. Then 3 = r - 5\(\sqrt{3}\), a difference of two rationals, which is rational. That contradicts \(\sqrt{3}\) being irrational.

**Final answer:** \(3 + 5\sqrt{3}\) is irrational.

### Example 5  
**Prove that \(13\frac{1}{\sqrt{3}}\) is irrational.**  
If \(13\frac{1}{\sqrt{3}}\) were rational, then its reciprocal \(\sqrt{3}\) would also be rational. But \(\sqrt{3}\) is irrational. Contradiction.

**Final answer:** \(13\frac{1}{\sqrt{3}}\) is irrational.

### Example 6  
**Where does the analogous proof fail for 9\(\sqrt{9}\), and why is that correct?**  
Following the steps: assume 9 = \(\frac{p}{q}\) coprime, square to get 9q^2 = p^2, so 9 divides p^2. But 9 is _not prime_, so the lemma fails — \(9|6^2\) yet \(9\nmid6\). The proof stalls, correctly, because 9 = 3 is rational.

**Final answer:** the proof relies on primality; 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 are irrational forced mathematics to expand beyond fractions.  
- **It is a template, not a one-off.** The same contradiction-plus-prime-lemma structure proves \(p\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.

## The Mathematicians Behind the Irrationality of Roots  
Euclid (c. 300 BCE, Alexandria, Greece) gave the earliest rigorous treatment of irrational quantities in his _Elements_.

## Where Students Trip Up When Proving Root 3 Is Irrational  
### Mistake 1: Skipping the "coprime" assumption  
**Where it slips in:** Writing 3 = \(\frac{p}{q}\) without stating that p and q share no common factor.  
**Don't do this:** Start from a general fraction.  
**The correct way:** Always open with "p and q are coprime."

### Mistake 2: Asserting "3 divides p" without invoking primality  
**Where it slips in:** Jumping straight to "3|p" with no justification.  
**Don't do this:** Treat the step as obvious.  
**The correct way:** Name the lemma: "since 3 is prime, it follows that 3|p."

### 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.  
**The correct way:** Use the contradiction proof; the decimal is a useful illustration, but never a proof on its own.

## Key Takeaways  
- To **prove that root 3 is irrational**, assume \(\sqrt{3}=\frac{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.  
- The calculator decimal and long division illustrate the result but never prove it.  
- The same seven-step structure proves \(p\sqrt{p}\) irrational for any prime p.