Try to prove the irrationality of √3 using the approach of proof by contradiction. Will the same approach work for √5, √7, or √10?
- 1. Try to prove the irrationality of √3 using the approach of proof by contradiction.
- 2. Will the same approach work for √5, √7, or √10?
Step-by-step solution
Idea: Copy the proof for √2, replacing ‘even’ (divisible by 2) by ‘divisible by 3’. The needed fact: if 3 divides p2, then 3 divides p. This is true for any prime in place of 3.
1. Try to prove the irrationality of √3 using the approach of proof by contradiction.
- Assume √3 = pq with p, q integers, q ≠ 0, and no common factor other than 1. Squaring: p2 = 3q2, so 3 divides p2.½ mark
- Fact: if 3 divides p2, then 3 divides p. (Any integer is 3m, 3m + 1 or 3m + 2. Their squares are 9m2, 9m2 + 6m + 1 and 9m2 + 12m + 4; only the first is divisible by 3.) So p = 3k.1 mark
- Then 3q2 = 9k2, so q2 = 3k2, and by the same fact 3 divides q.½ mark
- So 3 is a common factor of p and q, contradicting lowest terms. Hence √3 is irrational.1 mark
2. Will the same approach work for √5, √7, or √10?
- √5 and √7: yes. Replace 3 by 5 or 7: p2 = 5q2 (or 7q2), and since 5 and 7 are prime, 5 | p2 ⇒ 5 | p and then 5 | q. Same contradiction.1 mark
- √10: yes, using the prime factor 2. p2 = 10q2 is even, so p = 2k; then 4k2 = 10q2 gives 2k2 = 5q2, so 5q2 is even; as 5 is odd, q2 is even, so q is even. Both even: contradiction. (The approach fails only for perfect squares like √4 = 2 or √9 = 3, which are rational.)1 mark
Answer to write in the exam
1.
Suppose √3 = pq, HCF(p, q) = 1, q ≠ 0
p2 = 3q2 ⇒ 3 | p2 ⇒ 3 | p (3 is prime); let p = 3k
9k2 = 3q2 ⇒ q2 = 3k2 ⇒ 3 | q
3 divides both p and q, contradicting HCF(p, q) = 1
∴ √3 is irrational.
2.
√5: p2 = 5q2 ⇒ 5 | p ⇒ 5 | q, contradiction
√7: p2 = 7q2 ⇒ 7 | p ⇒ 7 | q, contradiction
√10: p2 = 10q2 ⇒ p = 2k ⇒ 2k2 = 5q2 ⇒ q even, contradiction
∴ Yes; √5, √7 and √10 are irrational.
Common mistakes that cost marks
- Using ‘even’ in the √3 proof. The argument must use divisibility by 3, not by 2.
- Claiming ‘3 divides p2, so 3 divides p‘ with no reason. For 3 it can be checked with remainders; it works because 3 is prime (it fails for 4: 4 | 36 but 4 ∤ 6).
- Thinking the method proves √4 or √9 irrational. They equal 2 and 3; the step ‘n | p2 ⇒ n | p‘ needs a prime n.
How this can come in the exam
Which of the following is rational?
- √7
- √10
- √49
- √15
Show answer
(C) √49
√49 = 7 = 71.
Prove that √7 is irrational.
Show answer
Suppose √7 = pq in lowest terms; then p2 = 7q2 (1 mark). 7 is prime and divides p2, so 7 | p; write p = 7k, giving q2 = 7k2, so 7 | q (1 mark). 7 is a common factor of p and q: contradiction, so √7 is irrational (1 mark).Try one yourself
Will the same proof show that √12 is irrational? (Hint: 12 = 4 × 3.)
Show answer
Yes: √12 = 2√3, and if 2√3 = r were rational then √3 = r2 would be rational, which is false. So √12 is irrational.
More questions like this
- We have seen how to obtain a line whose length is a rational number. How do we obtain lines whose lengths are irrational?
- Try to extend this method for constructing line segments of lengths √3 and √5 using a ruler and a compass. Generalise this method to construct a line segment of any length of the form √n, where n is a positive integer.
- We know what it means to add 2, 100, or even a lakh terms. What does it mean to add an infinite number of terms?
- It terminates: The division eventually leaves a remainder of 0. The decimal stops. 38 = 0.375. (Can you tell for which rational numbers the decimal will be terminating?)
- It repeats: The division never reaches a remainder of 0, but the sequence of digits begins to loop infinitely. 511 = 0.454545 … = 0.45.