- Foundation
- About 16 min
- 5 practice questions
Irrational numbers and proving that √2 is irrational
Recall what makes a number rational or irrational, use the fact that a prime dividing a² must divide a, and follow a proof by contradiction that √2 is irrational.
If something looks wrong, please tell us.
By the end of this lesson you can
- Tell rational and irrational numbers apart and give examples of each.
- State and explain the result: if a prime p divides a², then p divides a.
- Write the proof by contradiction that √2 is irrational, step by step.
In Class 9 you were told that √2, √3 and π are irrational, but you were not shown why. Now that you have the Fundamental Theorem of Arithmetic, you can actually prove it for square roots. The proof uses a powerful style of reasoning called proof by contradiction.
Rational and irrational numbers
A number is rational if it can be written as p/q, where p and q are integers and q ≠ 0. Examples: 3/4, −5 (= −5/1), 0.75 (= 3/4), and 0.333… (= 1/3). A number is irrational if it cannot be written in this form. Examples: √2, √3, √5, π. Every fraction p/q can be reduced to lowest terms, so if a number is rational we can always choose p and q with no common factor other than 1; such p and q are called coprime.
| Number | Rational or irrational? | Reason |
|---|---|---|
| 0.75 | Rational | Equals 3/4 |
| √16 | Rational | Equals 4 = 4/1 |
| √(9/25) | Rational | Equals 3/5 |
| √12 | Irrational | Equals 2√3, and √3 is irrational |
| π | Irrational | Cannot be written as p/q (proved by mathematicians long ago) |
A key result about primes
Let p be a prime number and a a positive integer. If p divides a², then p divides a.
Why is it true? Write a as a product of primes. Then a² uses exactly the same primes, each twice as often. For example, 30 = 2 × 3 × 5, so 900 = 30² = 2² × 3² × 5². By the uniqueness of prime factorisation, a² has no primes other than those of a. So if a prime p divides a², p is one of the primes of a², hence one of the primes of a, so p divides a.
The word prime matters. 4 divides 6² = 36 (36 ÷ 4 = 9), but 4 does not divide 6. Because 4 is not prime, the result does not apply to it.
Proof by contradiction
How a proof by contradiction works
- Assume the opposite Suppose √2 IS rational.
- Write what that means √2 = a/b with a, b coprime, b ≠ 0.
- Reason carefully Square, rearrange and use the prime result.
- Reach something impossible a and b turn out to share the factor 2.
- Conclude The assumption was false, so √2 is irrational.
Worked example 1: prove that √2 is irrational
- Assume, to the contrary, that √2 is rational. Then √2 = a/b, where a and b are coprime integers and b ≠ 0.
- Multiply both sides by b: √2 × b = a. Square both sides: 2b² = a².
- So 2 divides a². Since 2 is prime, 2 divides a (by the key result). Write a = 2c for some integer c.
- Substitute: 2b² = (2c)² = 4c², so b² = 2c².
- So 2 divides b², and again, since 2 is prime, 2 divides b.
- Now 2 divides both a and b. But a and b were chosen coprime, with no common factor other than 1. This is a contradiction.
- The contradiction came from assuming √2 is rational. So √2 is irrational.
Worked example 2: spotting the key step
A student writes: '√2 = a/b, so 2b² = a², so 2 divides a, so a = 2c, so 4c² = 2b², so b² = 2c².' What must come next? Working: from b² = 2c², 2 divides b², so 2 divides b. Combined with 2 dividing a, this contradicts a and b being coprime. The common slip is to forget to say why a and b cannot both be even: it is because we chose the fraction in lowest terms at the start.
Key takeaways: rational numbers can be written as p/q with p, q coprime integers and q ≠ 0; irrational numbers cannot. If a prime p divides a², then p divides a, because a² has the same primes as a. To prove √2 is irrational, assume it equals a/b in lowest terms, show that 2 divides both a and b, and conclude that the assumption was false.
Check your understanding
-
1. If 7 divides a², where a is a positive integer, which of the following must be true?
- 7 divides a
- a = 7
- a² = 7
- 7 divides a only when a is odd
Show answer
Answer: A. 7 is prime, so by the key result, 7 dividing a² means 7 divides a. It does not mean a equals 7; for example, a = 14 gives a² = 196, which 7 divides.
-
2. The statement 'if n divides a², then n divides a' can fail when n is not prime. Which choice shows it failing?
- n = 5, a = 10
- n = 4, a = 8
- n = 3, a = 6
- n = 9, a = 3
Show answer
Answer: D. With n = 9 and a = 3: a² = 9, and 9 divides 9, but 9 does not divide 3. So the statement fails. In the other choices n divides a as well (5 divides 10, 4 divides 8, 3 divides 6), so nothing fails.
-
3. In the proof that √2 is irrational, we assume √2 = a/b with a and b coprime. What contradiction is reached?
- b turns out to be 0
- 2 divides both a and b
- a² turns out to be negative
- √2 turns out to equal 2
Show answer
Answer: B. The proof shows 2 divides a, then 2 divides b. So 2 is a common factor of a and b, which contradicts the choice of a and b as coprime.
-
4. Which of these numbers is irrational?
- √0.25
- √50
- √(9/16)
- 1.212121…
Show answer
Answer: B. √50 = √(25 × 2) = 5√2, which is irrational because √2 is irrational. √0.25 = 0.5 = 1/2, √(9/16) = 3/4, and the repeating decimal 1.2121… equals 120/99, so they are all rational.
-
5. If a² = 2b² for positive integers a and b, which conclusion follows directly?
- b is even
- a = 2b
- a and b are both odd
- a is even
Show answer
Answer: D. a² = 2b² means 2 divides a², and since 2 is prime, 2 divides a, so a is even. The conclusion that b is even needs one more step (substituting a = 2c), and a = 2b would make a² = 4b², not 2b².
Sign in to keep track of the lessons you finish.