Prove that \(\sqrt 3\) is an irrational number.
CBSE Class 10 Maths · Real Numbers
CBSE Class 10 Maths · Real Numbers
Imagine you try to write \( \sqrt{3} \) as a neat fraction, like \( \frac{2}{5} \) or \( \frac{7}{3} \). We pretend it IS a fraction and follow the math carefully. Soon we find something impossible — both the top and bottom numbers would have to share a common factor of 3, but we said they had no shared factors at all. That is a contradiction, like saying a box is both full and empty at the same time. Because our pretend assumption breaks the rules, it must be false, so \( \sqrt{3} \) cannot be written as any fraction.
Answer: \( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming it is rational leads to the impossible conclusion that \( p \) and \( q \) share a common factor of 3, contradicting their co-prime nature.)
An irrational number is a number that cannot be written in the form \( \frac{p}{q} \), where \( p \) and \( q \) are integers and \( q \ne 0 \), with \( p \) and \( q \) having no common factors other than 1 (i.e., they are co-prime). To prove that \( \sqrt{3} \) is irrational, we use a technique called Proof by Contradiction. In this method, we assume the opposite of what we want to prove, and then show that this assumption leads to an impossible or contradictory situation. The contradiction tells us our assumption was wrong, so the original statement must be true.
If a prime number \( p \) divides \( a^2 \), then \( p \) also divides \( a \). This is a key number theory result used in this proof.
\( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming it is rational leads to the impossible conclusion that \( p \) and \( q \) share a common factor of 3, contradicting their co-prime nature.)
A common mistake is forgetting to state that \( p \) and \( q \) are co-prime at the start. Without this condition, there is no contradiction to arrive at, and the proof breaks down. Always clearly state that HCF\( (p, q) = 1 \) in your assumption.
\( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming it is rational leads to the impossible conclusion that \( p \) and \( q \) share a common factor of 3, contradicting their co-prime nature.)
One common mistake: Students forget to explicitly state that \( p \) and \( q \) are co-prime at the beginning, and then have no contradiction to point to at the end — always declare the co-prime condition upfront so the final contradiction is clear.
Answer: \( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming it is rational leads to the impossible conclusion that \( p \) and \( q \) share a common factor of 3, contradicting their co-prime nature.)
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 gives \[ 5 = \frac{p^2}{q^2} \] so \[ p^2 = 5q^2. \] This means 5 divides \( p^2 \). Since 5 is prime, by the fundamental property of primes, 5 must also divide \( p \). So we can write \( p = 5m \) for some integer \( m \). Substituting back: \[ (5m)^2 = 5q^2 \] which gives \[ 25m^2 = 5q^2 \] and therefore \[ q^2 = 5m^2. \] This means 5 divides \( q^2 \), and since 5 is prime, 5 also divides \( q \). But now both \( p \) and \( q \) are divisible by 5, which contradicts our assumption that \( \gcd(p, q) = 1 \). Hence 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: 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 \) (the fraction is in its lowest terms). Squaring both sides gives \[ 7 = \frac{a^2}{b^2} \] so \[ a^2 = 7b^2. \] This means 7 divides \( a^2 \). Since 7 is prime, it must also divide \( a \). So we can write \( a = 7k \) for some integer \( k \). Substituting back: \[ (7k)^2 = 7b^2 \] which gives \[ 49k^2 = 7b^2 \] and therefore \[ b^2 = 7k^2. \] This means 7 divides \( b^2 \), and since 7 is prime, 7 also divides \( b \). But now both \( a \) and \( b \) are divisible by 7, which contradicts our assumption that \( \gcd(a, b) = 1 \). Hence 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 \).)