SOLVER7 Study. Nothing Else.
2023 Board Paper Q27

Prove that \(\sqrt5\) is an irrational number.

CBSE Class 10 Maths · Real Numbers

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 Proof: √5 is Irrational

Detailed Explanation

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.

Formula Used

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.

Solution

  1. Step 1: Assume the opposite: Assume, for the sake of contradiction, that \( \sqrt{5} \) is a rational number. Then we can write \( \sqrt{5} = \frac{p}{q} \), where \( p \) and \( q \) are integers, \( q \ne 0 \), and \( p \) and \( q \) have no common factor other than 1 (the fraction is already in its simplest form, i.e., \( \gcd(p, q) = 1 \)).
  2. Step 2: Square both sides: Squaring both sides of \( \sqrt{5} = \frac{p}{q} \): \[ 5 = \frac{p^2}{q^2} \] Multiplying both sides by \( q^2 \): \[ p^2 = 5q^2 \] This tells us that \( p^2 \) is divisible by 5.
  3. Step 3: Conclude that p is divisible by 5: Since \( p^2 \) is divisible by 5, and 5 is a prime number, by Euclid's Lemma, \( p \) itself must be divisible by 5. So we can write \( p = 5m \) for some integer \( m \).
  4. Step 4: Substitute back: Substituting \( p = 5m \) into \( p^2 = 5q^2 \): \[ (5m)^2 = 5q^2 \] \[ 25m^2 = 5q^2 \] Dividing both sides by 5: \[ q^2 = 5m^2 \] This tells us that \( q^2 \) is divisible by 5.
  5. Step 5: Conclude that q is divisible by 5: Since \( q^2 \) is divisible by 5, and 5 is a prime number, by Euclid's Lemma, \( q \) itself must also be divisible by 5.
  6. Step 6: Arrive at the contradiction: We have now shown that both \( p \) and \( q \) are divisible by 5. But this contradicts our original assumption that \( p \) and \( q \) have no common factor other than 1 (i.e., \( \gcd(p, q) = 1 \)). This is a contradiction!
  7. Step 7: State the conclusion: Since our assumption that \( \sqrt{5} \) is rational leads to a contradiction, our assumption must be wrong. Therefore, \( \sqrt{5} \) is irrational. Hence proved.

Final 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.

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Make the Contradiction Assumption: Suppose, contrary to what we want to prove, that \( \sqrt{5} \) is a rational number. Then it can be written as \( \sqrt{5} = \frac{p}{q} \) where \( p \) and \( q \) are integers, \( q \ne 0 \), and \( \gcd(p, q) = 1 \) (meaning the fraction is already fully reduced with no shared factors). — Reason: This is the starting point of Proof by Contradiction; we assume the opposite of what we wish to prove.
  2. Step 2: Square Both Sides: Squaring both sides of \( \sqrt{5} = \frac{p}{q} \) gives \[ 5 = \frac{p^2}{q^2} \] — Reason: Squaring removes the square root on the left side, allowing us to work with whole-number relationships.
  3. Step 3: Rearrange to Isolate the Numerator: Multiplying both sides by \( q^2 \) yields \[ p^2 = 5q^2 \] — Reason: This tells us directly that \( p^2 \) is a multiple of 5, which is the key fact we need for the next step.
  4. Step 4: Deduce That 5 Divides p: Since \( p^2 = 5q^2 \), we know 5 divides \( p^2 \). By Euclid's Lemma (if a prime divides a square, it divides the original number), 5 must also divide \( p \). So we can write \( p = 5m \) for some integer \( m \). — Reason: Euclid's Lemma lets us "step back" from the square to the number itself.
  5. Step 5: Substitute Back: Replace \( p \) with \( 5m \) in the equation \( p^2 = 5q^2 \): \[ (5m)^2 = 5q^2 \] which simplifies to \[ 25m^2 = 5q^2 \] Dividing both sides by 5: \[ q^2 = 5m^2 \] — Reason: Substituting our new expression for \( p \) lets us now investigate what must be true about \( q \).
  6. Step 6: Deduce That 5 Divides q: From \( q^2 = 5m^2 \), we see that 5 divides \( q^2 \). Applying Euclid's Lemma again, 5 must also divide \( q \). — Reason: The same logical argument now applies to \( q \), completing the trap we set for the assumption.
  7. Step 7: Arrive at the Contradiction: We have shown that 5 divides both \( p \) and \( q \). But this directly contradicts our original assumption that \( \gcd(p, q) = 1 \) (i.e., \( p \) and \( q \) share no common factor). A number cannot both have and not have 5 as a common factor — this is a logical impossibility. — Reason: Since the assumption that \( \sqrt{5} \) is rational leads to an impossible conclusion, the assumption must be false, and therefore \( \sqrt{5} \) is irrational.

Final 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.

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Assume Rational: Assume \( \sqrt{5} = \frac{p}{q} \) where \( \gcd(p, q) = 1 \).
  2. Step 2: Square Both Sides: Squaring: \[ p^2 = 5q^2 \] so 5 divides \( p^2 \), hence 5 divides \( p \). Write \( p = 5m \).
  3. Step 3: Show 5 Divides q: Substituting \( p = 5m \): \[ 25m^2 = 5q^2 \Rightarrow q^2 = 5m^2 \] so 5 divides \( q^2 \), hence 5 divides \( q \).
  4. Step 4: Contradiction: 5 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \). Assumption is false.

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.

➕ More Examples

More Examples

Example 1

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).

Example 2

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).

🎯 Try a Similar Question

Try a Similar Question

Question: Prove that \( \sqrt{3} \) is an irrational number.

Solution

  1. Step 1: Assume the opposite (Proof by Contradiction): Assume, for the sake of contradiction, that \( \sqrt{3} \) is a rational number. 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, so \( p \) and \( q \) share no common factors).
  2. Step 2: Square both sides: Squaring both sides of \( \sqrt{3} = \frac{p}{q} \), we get \[ 3 = \frac{p^2}{q^2} \] which gives \[ p^2 = 3q^2 \] This means \( 3 \) divides \( p^2 \).
  3. Step 3: Show that 3 divides p: Since \( 3 \) divides \( p^2 \), and \( 3 \) is a prime number, by Euclid's lemma, \( 3 \) must also divide \( p \). So we can write \( p = 3m \) for some integer \( m \).
  4. Step 4: Substitute back: Substituting \( p = 3m \) into \( p^2 = 3q^2 \), we get \[ (3m)^2 = 3q^2 \] which simplifies to \[ 9m^2 = 3q^2 \] and therefore \[ q^2 = 3m^2 \] This means \( 3 \) divides \( q^2 \).
  5. Step 5: Show that 3 divides q: Since \( 3 \) divides \( q^2 \), and \( 3 \) is prime, by Euclid's lemma, \( 3 \) must also divide \( q \).
  6. Step 6: Reach the Contradiction: We have shown that \( 3 \) divides both \( p \) and \( q \). This means \( \gcd(p, q) \ge 3 \), which contradicts our original assumption that \( \gcd(p, q) = 1 \) (i.e., that \( \frac{p}{q} \) is in lowest terms).
  7. Step 7: Conclusion: Since our assumption that \( \sqrt{3} \) is rational leads to a contradiction, the assumption must be false. Therefore, \( \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.

Everything you get with Solver7

More questions in Real Numbers

Chapter 1 - Theorem Q1 30/4/1 2023 / Section A Q1 430/1/1 2026 / Section A Q1 430/2/1 2026 / Section A Q1 430/3/1 2026 / Section A Q1 430/4/1 2026 / Section A Q1 430/5/1 2024 / Section A Q1 Chapter 1 - Theorem Q2 30/3/1 2026 / Section A Q2 430/1/1 2026 / Section A Q2 430/2/1 2026 / Section A Q2 430/3/1 2026 / Section A Q2 CBSE-ADDL1 2024 / Section A Q2 Chapter 1 - Theorem Q3 430/3/1 2026 / Section A Q3 Chapter 1 - Examples Q1 30/2/1 2023 / Section A Q4 30/2/1 2026 / Section A Q4 Chapter 1 - Examples Q2 Chapter 1 - Examples Q3 30/1/1 2026 / Section A Q6 430/5/1 2023 / Section A Q6 Chapter 1 - Examples Q4 430/2/1 2023 / Section A Q7 430/5/1 2024 / Section A Q7 Chapter 1 - Examples Q5 430/5/1 2024 / Section A Q8 Chapter 1 - Examples Q6 30/1/1 2026 / Section A Q9 Chapter 1 - Examples Q7 30/2/1 2026 / Section A Q10 Exercise 1.1 Q1 (i) Exercise 1.1 Q1 (ii) Exercise 1.1 Q1 (iii) 430/4/1 2024 / Section A Q13 Exercise 1.1 Q1 (iv) 30/1/1 2026 / Section A Q14 Exercise 1.1 Q1 (v) Exercise 1.1 Q2 (i) Exercise 1.1 Q2 (ii) Exercise 1.1 Q2 (iii) 30/2/1 2026 / Section A Q18 Exercise 1.1 Q3 (i) 430/1/1 2026 / Section A Q19 430/2/1 2026 / Section A Q19 CBSE-ADDL2 2024 / Section A Q19 Exercise 1.1 Q3 (ii) 30/5/1 2023 / Section A Q20 430/3/1 2024 / Section A Q20 Exercise 1.1 Q3 (iii) 30/2/1 2023 / Section B Q21 30/4/1 2023 / Section B Q21 430/4/1 2024 / Section B Q21 430/4/1 2026 / Section B Q21 430/5/1 2023 / Section B Q21 CBSE-ADDL1 2024 / Section B Q21 CBSE-ADDL2 2024 / Section B Q21 Exercise 1.1 Q4 430/2/1 2023 / Section B Q22(a) Exercise 1.1 Q5