Prove that \(\sqrt 2\) is an irrational number.
CBSE Class 10 Maths · Real Numbers
CBSE Class 10 Maths · Real Numbers
Imagine you try to write \( \sqrt{2} \) as a neat fraction, like \( \frac{3}{4} \) or \( \frac{7}{5} \). We pretend it is possible and call that fraction \( \frac{p}{q} \) in its simplest form. When we do the maths, we discover that both the top number and the bottom number must be even. But a fraction in its simplest form cannot have two even numbers — that is a contradiction, like saying a door is both open and shut. So our pretend idea was wrong, and \( \sqrt{2} \) cannot be written as any fraction at all.
Answer: \( \sqrt{2} \) is an irrational number. (Proved by contradiction — assuming rationality leads to both \( p \) and \( q \) being divisible by 2, 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 other than 1 (i.e., they are co-prime). An irrational number CANNOT be written in this form.
To prove that \( \sqrt{2} \) is irrational, we use a powerful technique called Proof by Contradiction. The idea is: we ASSUME the opposite of what we want to prove (i.e., assume \( \sqrt{2} \) IS rational), and then show that this assumption leads to a logical contradiction. Since the assumption causes a contradiction, it must be false — meaning \( \sqrt{2} \) must be irrational.
If a prime number \( p \) divides \( a^2 \), then \( p \) also divides \( a \). This is a key number theory result used in the proof.
\( \sqrt{2} \) is an irrational number. (Proved by contradiction — assuming rationality leads to both \( p \) and \( q \) being divisible by 2, contradicting the fact that they are co-prime.)
Many students forget to mention at the start that p and q are co-prime (HCF = 1). Without this condition, there is no contradiction to arrive at — so stating that p and q are co-prime is an essential part of the proof.
\( \sqrt{2} \) is an irrational number. (Proved by contradiction — assuming rationality leads to both \( p \) and \( q \) being divisible by 2, contradicting the fact that they are co-prime.)
One common mistake: Students forget to state at the outset that \( p \) and \( q \) are co-prime. Without this condition, no contradiction arises, because the whole proof depends on showing that the assumption forces a common factor of 2 — which contradicts the co-prime requirement.
Answer: \( \sqrt{2} \) is an irrational number. (Proved by contradiction — assuming rationality leads to both \( p \) and \( q \) being divisible by 2, 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} = \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: \[ 3 = \frac{p^2}{q^2} \] So \[ p^2 = 3q^2 \] This means 3 divides \( p^2 \). Since 3 is prime, 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 since 3 is prime, 3 must also divide \( q \). But now 3 divides both \( p \) and \( q \), which contradicts our assumption that \( \gcd(p, q) = 1 \). Therefore, \( \sqrt{3} \) is irrational.
Answer: \( \sqrt{3} \) is irrational (proved by contradiction).
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{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: \[ 5 = \frac{a^2}{b^2} \] So \[ a^2 = 5b^2 \] This means 5 divides \( a^2 \). Since 5 is prime, 5 must also divide \( a \). Let \( a = 5k \) for some integer \( k \). Substituting back: \[ (5k)^2 = 5b^2 \] \[ 25k^2 = 5b^2 \] \[ b^2 = 5k^2 \] This means 5 divides \( b^2 \), and since 5 is prime, 5 must also divide \( b \). But now 5 divides both \( a \) and \( b \), which contradicts our assumption that \( \gcd(a, b) = 1 \). Therefore, \( \sqrt{5} \) is irrational.
Answer: \( \sqrt{5} \) is irrational (proved by contradiction).
Question: Prove that \( \sqrt{3} \) is an irrational number.
Answer: \( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming \( \sqrt{3} = \frac{p}{q} \) in lowest terms leads to both \( p \) and \( q \) being divisible by 3, contradicting the fact that they are co-prime.)