Prove that \(\sqrt5\) is an irrational number.
CBSE Class 10 Maths · Real Numbers
CBSE Class 10 Maths · Real Numbers
Imagine trying to write \( \sqrt{5} \) as a neat fraction, like \( \frac{3}{4} \) or \( \frac{7}{2} \). We pretend it is possible and call that fraction \( \frac{a}{b} \), where a and b share no common pieces. When we do the maths, we find that 5 must divide into both a and b. That is a contradiction — like finding two puzzle pieces that are supposed to be different but turn out identical! Because the pretend-fraction always breaks its own rule, \( \sqrt{5} \) simply cannot be a fraction.
Answer: \( \sqrt{5} \) is an irrational number. (Proved by contradiction — assuming it is rational leads to the impossible conclusion that \( a \) and \( b \) share a common factor of 5, contradicting the fact that they are co-prime.)
A rational number is any number that can be written in the form \( \frac{p}{q} \), where \( p \) and \( q \) are integers and \( q \ne 0 \), and \( p \) and \( q \) have no common factors (i.e., they are co-prime, meaning their HCF is 1). An irrational number CANNOT be written in this form.
To prove that \( \sqrt{5} \) is irrational, we use the method of proof by contradiction. We assume the opposite of what we want to prove — that \( \sqrt{5} \) IS rational — and then show that this assumption leads to a logical impossibility (a contradiction). This contradiction means our assumption was wrong, so \( \sqrt{5} \) must be irrational.
A key fact we use: if a prime number \( p \) divides \( a^2 \), then \( p \) must also divide \( a \). This is a standard number theory result used in such proofs.
Key fact used: If a prime \( p \) divides \( a^2 \), then \( p \) divides \( a \).
Rational number form: \( \frac{p}{q} \) where \( p, q \) are integers, \( q \ne 0 \), and \( \gcd(p, q) = 1 \).
\( \sqrt{5} \) is an irrational number. (Proved by contradiction — assuming it is rational leads to the impossible conclusion that \( a \) and \( b \) share a common factor of 5, contradicting the fact that they are co-prime.)
Many students forget to clearly state at the start that \( a \) and \( b \) are co-prime (HCF = 1). Without this condition, the contradiction in the final step does not hold, and the proof is incomplete. Always mention that \( \frac{a}{b} \) is in its simplest (lowest) form.
\( \sqrt{5} \) is an irrational number. (Proved by contradiction — assuming it is rational leads to the impossible conclusion that \( a \) and \( b \) share a common factor of 5, contradicting the fact that they are co-prime.)
One common mistake: Students forget to state that \( a \) and \( b \) are co-prime at the beginning, which is the very condition that the contradiction at the end violates — without it, the proof does not work.
Answer: \( \sqrt{5} \) is an irrational number. (Proved by contradiction — assuming it is rational leads to the impossible conclusion that \( a \) and \( b \) share a common factor of 5, contradicting the fact that they are co-prime.)
Question: Prove that \( \sqrt{3} \) is an irrational number.
Solution: Assume, for the sake of contradiction, that \( \sqrt{3} \) is rational. Then we can write \( \sqrt{3} = \dfrac{p}{q} \) where \( p \) and \( q \) are integers, \( q \ne 0 \), and \( \gcd(p, q) = 1 \) (i.e., the fraction is in its lowest terms). Squaring both sides: \[ 3 = \frac{p^2}{q^2} \] So \[ p^2 = 3q^2 \] This means \( 3 \) divides \( p^2 \). Since \( 3 \) is prime, by Euclid's Lemma, \( 3 \) must also divide \( p \). Let \( p = 3m \) for some integer \( m \). Substituting back: \[ (3m)^2 = 3q^2 \] \[ 9m^2 = 3q^2 \] \[ q^2 = 3m^2 \] This means \( 3 \) divides \( q^2 \), and again by Euclid's Lemma, \( 3 \) divides \( q \). But now \( 3 \) divides both \( p \) and \( q \), which contradicts our assumption that \( \gcd(p, q) = 1 \). Therefore, our assumption was wrong, and \( \sqrt{3} \) is irrational.
Answer: \( \sqrt{3} \) is irrational (proved by contradiction).
Question: Prove that \( \sqrt{7} \) is an irrational number.
Solution: Assume, for the sake of contradiction, that \( \sqrt{7} \) is rational. Then we can write \( \sqrt{7} = \dfrac{p}{q} \) where \( p \) and \( q \) are integers, \( q \ne 0 \), and \( \gcd(p, q) = 1 \) (i.e., the fraction is in its lowest terms). Squaring both sides: \[ 7 = \frac{p^2}{q^2} \] So \[ p^2 = 7q^2 \] This means \( 7 \) divides \( p^2 \). Since \( 7 \) is prime, by Euclid's Lemma, \( 7 \) must also divide \( p \). Let \( p = 7k \) for some integer \( k \). Substituting back: \[ (7k)^2 = 7q^2 \] \[ 49k^2 = 7q^2 \] \[ q^2 = 7k^2 \] This means \( 7 \) divides \( q^2 \), and again by Euclid's Lemma, \( 7 \) divides \( q \). But now \( 7 \) divides both \( p \) and \( q \), which contradicts our assumption that \( \gcd(p, q) = 1 \). Therefore, our assumption was wrong, and \( \sqrt{7} \) is irrational.
Answer: \( \sqrt{7} \) is irrational (proved by contradiction).
Question: Prove that \( \sqrt{7} \) is an irrational number.
Answer: \( \sqrt{7} \) is an irrational number. (Proved by contradiction — assuming \( \sqrt{7} = \dfrac{a}{b} \) in lowest terms leads to the conclusion that 7 divides both \( a \) and \( b \), contradicting the fact that they are co-prime.)