Prove that \(\sqrt3\) is an irrational number .
CBSE Class 10 Maths · Real Numbers
CBSE Class 10 Maths · Real Numbers
Imagine trying to write \( \sqrt{3} \) as a perfectly neat fraction, like \( \frac{1}{2} \) or \( \frac{5}{7} \). We pretend we can do it and follow the rules carefully. But something goes wrong — the same number ends up needing to be shared by both the top and the bottom of the fraction, which is not allowed. It is like claiming a cookie is already cut in half, but then finding out both halves are still whole cookies. That impossibility proves \( \sqrt{3} \) can never be written as a neat fraction at all.
Answer: \( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming \( \sqrt{3} = \frac{p}{q} \) in lowest terms leads to the impossible conclusion that 3 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \).)
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., the fraction is in its lowest terms, so \( \gcd(p, q) = 1 \)).
An irrational number CANNOT be written in this form.
To prove that \( \sqrt{3} \) is irrational, we use a technique called Proof by Contradiction. We begin by ASSUMING the opposite — that \( \sqrt{3} \) IS rational — and then show that this assumption leads to a logical impossibility (a contradiction). This means our assumption must be false, so \( \sqrt{3} \) must be irrational.
The key idea used in this proof is: if a prime number \( p \) divides \( a^2 \), then \( p \) also divides \( a \). This is a standard number theory result.
Key Result Used: If a prime \( p \) divides \( a^2 \), then \( p \) divides \( a \).
Definition of Rational: \( \sqrt{3} = \frac{p}{q} \) where \( p, q \in \mathbb{Z} \), \( q \ne 0 \), and \( \gcd(p, q) = 1 \).
\( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming \( \sqrt{3} = \frac{p}{q} \) in lowest terms leads to the impossible conclusion that 3 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \).)
Many students forget to state that \( \frac{p}{q} \) is in its lowest terms (i.e., \( \gcd(p, q) = 1 \)) at the beginning. Without this condition, no contradiction arises later — so the proof only works if you clearly assume the fraction is fully reduced from the start.
\( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming \( \sqrt{3} = \frac{p}{q} \) in lowest terms leads to the impossible conclusion that 3 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \).)
One common mistake: Students forget to state that \( \gcd(p, q) = 1 \) at the beginning, which is essential — without establishing that the fraction is in lowest terms, there is no contradiction to arrive at when 3 is found to divide both \( p \) and \( q \).
Answer: \( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming \( \sqrt{3} = \frac{p}{q} \) in lowest terms leads to the impossible conclusion that 3 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \).)
Question: Prove that \( \sqrt{5} \) is an irrational number.
Solution: Assume, for the sake of contradiction, that \( \sqrt{5} \) is rational. Then we can write \[ \sqrt{5} = \frac{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: \[ 5 = \frac{p^2}{q^2} \] So \[ p^2 = 5q^2 \] This means \( 5 \mid p^2 \). Since 5 is prime, by Euclid's Lemma, \( 5 \mid p \). Therefore, we can write \( p = 5m \) for some integer \( m \). Substituting back: \[ (5m)^2 = 5q^2 \] \[ 25m^2 = 5q^2 \] \[ q^2 = 5m^2 \] This means \( 5 \mid q^2 \), and since 5 is prime, by Euclid's Lemma, \( 5 \mid q \). But now we have shown that 5 divides both \( p \) and \( q \), which contradicts our assumption that \( \gcd(p, q) = 1 \). Therefore, our assumption that \( \sqrt{5} \) is rational is false, and \( \sqrt{5} \) is irrational.
Answer: \( \sqrt{5} \) 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} = \frac{p}{q} \] where \( p \) and \( q \) are integers, \( q \ne 0 \), and \( \gcd(p, q) = 1 \) (the fraction is in its lowest terms). Squaring both sides: \[ 7 = \frac{p^2}{q^2} \] So \[ p^2 = 7q^2 \] This means \( 7 \mid p^2 \). Since 7 is prime, by Euclid's Lemma, \( 7 \mid p \). Therefore, we can write \( p = 7k \) for some integer \( k \). Substituting back: \[ (7k)^2 = 7q^2 \] \[ 49k^2 = 7q^2 \] \[ q^2 = 7k^2 \] This means \( 7 \mid q^2 \), and since 7 is prime, by Euclid's Lemma, \( 7 \mid q \). But now 7 divides both \( p \) and \( q \), which contradicts our assumption that \( \gcd(p, q) = 1 \). Therefore, our assumption that \( \sqrt{7} \) is rational is false, and \( \sqrt{7} \) is irrational.
Answer: \( \sqrt{7} \) is irrational (proved by contradiction).
Question: Prove that \( \sqrt{5} \) is an irrational number.
Answer: \( \sqrt{5} \) is an irrational number. (Proved by contradiction — assuming \( \sqrt{5} = \dfrac{p}{q} \) in lowest terms leads to the conclusion that 5 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \).)