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 simple fraction, like \( \frac{3}{4} \) or \( \frac{7}{2} \). We play a little game: pretend it IS a fraction, then see what goes wrong. When we do the maths, we find that both the top number and the bottom number must be divisible by 5. But a fraction in its simplest form cannot have that happen. It is like a contradiction — a statement that breaks its own rule. So the pretend must be false, and \( \sqrt{5} \) cannot be a fraction at all.
Answer: \( \sqrt{5} \) is an irrational number. This is proved by contradiction: assuming \( \sqrt{5} = \frac{p}{q} \) in lowest terms leads to the conclusion that both \( p \) and \( q \) are divisible by 5, which contradicts the assumption that they share no common factor.
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 factor other than 1 (i.e., the fraction is in its lowest terms). An irrational number is one that CANNOT be written in this form.
To prove that \( \sqrt{5} \) is irrational, we use a powerful technique called Proof by Contradiction. The idea is: assume the opposite of what you want to prove, and then show that this assumption leads to a logical impossibility. If the assumption leads to a contradiction, it must be false — so the original statement must be true.
Key fact used: If \( p^2 \) is divisible by a prime number \( k \), then \( p \) itself is also divisible by \( k \). This is a standard result known as Euclid's Lemma.
\( \sqrt{5} \) is an irrational number. This is proved by contradiction: assuming \( \sqrt{5} = \frac{p}{q} \) in lowest terms leads to the conclusion that both \( p \) and \( q \) are divisible by 5, which contradicts the assumption that they share no common factor.
Many students forget to state at the beginning that \( p \) and \( q \) have no common factor (i.e., the fraction is in its lowest terms / \( \gcd(p,q) = 1 \)). Without this condition, the contradiction in Step 6 cannot be established, and the proof is incomplete.
\( \sqrt{5} \) is an irrational number. This is proved by contradiction: assuming \( \sqrt{5} = \frac{p}{q} \) in lowest terms leads to the conclusion that both \( p \) and \( q \) are divisible by 5, which contradicts the assumption that they share no common factor.
One common mistake: Students often forget to start with the fraction in its lowest terms (i.e., stating \( \gcd(p, q) = 1 \)). Without this condition, reaching a contradiction becomes impossible because you have no assumption to violate.
Answer: \( \sqrt{5} \) is an irrational number. This is proved by contradiction: assuming \( \sqrt{5} = \frac{p}{q} \) in lowest terms leads to the conclusion that both \( p \) and \( q \) are divisible by 5, which contradicts the assumption that they share no common factor.
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} = \frac{a}{b} \] where \( a \) and \( b \) are integers, \( b \ne 0 \), and \( \gcd(a, b) = 1 \) (the fraction is in its lowest terms). Squaring both sides: \[ 3 = \frac{a^2}{b^2} \] which gives \[ a^2 = 3b^2. \] This means \( 3 \mid a^2 \). Since 3 is prime, it follows that \( 3 \mid a \). So we can write \( a = 3k \) for some integer \( k \). Substituting back: \[ (3k)^2 = 3b^2 \] \[ 9k^2 = 3b^2 \] \[ b^2 = 3k^2. \] This means \( 3 \mid b^2 \), and since 3 is prime, \( 3 \mid b \). But now 3 divides both \( a \) and \( b \), which contradicts our assumption that \( \gcd(a, b) = 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} = \frac{a}{b} \] where \( a \) and \( b \) are integers, \( b \ne 0 \), and \( \gcd(a, b) = 1 \). Squaring both sides: \[ 7 = \frac{a^2}{b^2} \] which gives \[ a^2 = 7b^2. \] This means \( 7 \mid a^2 \). Since 7 is prime, it follows that \( 7 \mid a \). So we can write \( a = 7m \) for some integer \( m \). Substituting back: \[ (7m)^2 = 7b^2 \] \[ 49m^2 = 7b^2 \] \[ b^2 = 7m^2. \] This means \( 7 \mid b^2 \), and since 7 is prime, \( 7 \mid b \). But now 7 divides both \( a \) and \( b \), which contradicts our assumption that \( \gcd(a, b) = 1 \). Therefore, our assumption was wrong, and \( \sqrt{7} \) is irrational.
Answer: \( \sqrt{7} \) is irrational (proved by contradiction).
Question: Prove that \( \sqrt{3} \) is an irrational number.
Answer: \( \sqrt{3} \) is an irrational number. Assuming \( \sqrt{3} = \frac{p}{q} \) in lowest terms leads to the conclusion that \( 3 \) divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \). Hence \( \sqrt{3} \) is irrational.