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 neat fraction, like \( \frac{1}{2} \) or \( \frac{5}{7} \). We play a guessing game: suppose such a fraction exists. Following the rules of that guess, we discover something impossible — the two numbers in our fraction would have to share a secret factor of 3, but we said they had no shared secrets at all! A fact cannot be true and false at the same time. So our guess was wrong, and \( \sqrt{3} \) simply cannot be written as any fraction.
Answer: \( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming it is rational leads to the impossibility that the fraction \( \frac{p}{q} \) is in its lowest terms and yet both \( p \) and \( q \) share a common factor of 3.)
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 other than 1 (i.e., they are co-prime). An irrational number CANNOT be written in this form.
To prove that \( \sqrt{3} \) is irrational, we use a 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 (a contradiction). When that happens, the assumption must be false, so the original statement must be true.
Key fact used: If a prime number \( p \) divides \( a^2 \), then \( p \) also divides \( a \). This is a fundamental property of prime numbers.
\( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming it is rational leads to the impossibility that the fraction \( \frac{p}{q} \) is in its lowest terms and yet both \( p \) and \( q \) share a common factor of 3.)
Many students forget to state at the start that \( p \) and \( q \) are co-prime (HCF = 1). This is the critical condition that makes the contradiction possible. Without stating this, you have nothing to contradict at the end of the proof.
\( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming it is rational leads to the impossibility that the fraction \( \frac{p}{q} \) is in its lowest terms and yet both \( p \) and \( q \) share a common factor of 3.)
One common mistake: Students often forget to state at the start that \( p \) and \( q \) are co-prime (i.e., \( \gcd(p, q) = 1 \)). Without this condition, there is no contradiction to arrive at, and the proof falls apart.
Answer: \( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming it is rational leads to the impossibility that the fraction \( \frac{p}{q} \) is in its lowest terms and yet both \( p \) and \( q \) share a common factor of 3.)
Question: Prove that \( \sqrt{5} \) is an irrational number.
Solution: We use proof by contradiction.
Assume 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 divides \( p^2 \). Since 5 is prime, 5 must also divide \( p \).
Let \( p = 5m \) for some integer \( m \). Substituting: \[ (5m)^2 = 5q^2 \] \[ 25m^2 = 5q^2 \] \[ q^2 = 5m^2 \] This means 5 divides \( q^2 \), and since 5 is prime, 5 must also divide \( q \).
But now 5 divides both \( p \) and \( q \), which contradicts our assumption that \( \gcd(p, q) = 1 \).
Therefore, our assumption was wrong, and \( \sqrt{5} \) is irrational.
Answer: \( \sqrt{5} \) is irrational (proved by contradiction).
Question: Prove that \( \sqrt{7} \) is an irrational number.
Solution: We use proof by contradiction.
Assume 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 \) (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, 7 must also divide \( p \).
Let \( p = 7m \) for some integer \( m \). Substituting: \[ (7m)^2 = 7q^2 \] \[ 49m^2 = 7q^2 \] \[ q^2 = 7m^2 \] This means 7 divides \( q^2 \), and since 7 is prime, 7 must also divide \( 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{5} \) is an irrational number.
Answer: \( \sqrt{5} \) is an irrational number. Proved by contradiction — assuming \( \sqrt{5} = \frac{p}{q} \) in lowest terms leads to the conclusion that 5 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \).