SOLVER7 Study. Nothing Else.
2026 Board Paper Q28

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

CBSE Class 10 Maths · Real Numbers

Solution

👶 Simple Explanation

Simple Explanation

Imagine trying to write \( \sqrt{3} \) as a perfectly neat fraction, like \( \frac{1}{2} \) or \( \frac{5}{7} \). We pretend we can do it and follow the rules carefully. But something goes wrong — the same number ends up needing to be shared by both the top and the bottom of the fraction, which is not allowed. It is like claiming a cookie is already cut in half, but then finding out both halves are still whole cookies. That impossibility proves \( \sqrt{3} \) can never be written as a neat fraction at all.

Answer: \( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming \( \sqrt{3} = \frac{p}{q} \) in lowest terms leads to the impossible conclusion that 3 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \).)

📖 Prove that √3 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 factors (i.e., the fraction is in its lowest terms, so \( \gcd(p, q) = 1 \)).
An irrational number CANNOT be written in this form.
To prove that \( \sqrt{3} \) is irrational, we use a technique called Proof by Contradiction. We begin by ASSUMING the opposite — that \( \sqrt{3} \) IS rational — and then show that this assumption leads to a logical impossibility (a contradiction). This means our assumption must be false, so \( \sqrt{3} \) must be irrational.
The key idea used in this proof is: if a prime number \( p \) divides \( a^2 \), then \( p \) also divides \( a \). This is a standard number theory result.

Formula Used

Key Result Used: If a prime \( p \) divides \( a^2 \), then \( p \) divides \( a \).
Definition of Rational: \( \sqrt{3} = \frac{p}{q} \) where \( p, q \in \mathbb{Z} \), \( q \ne 0 \), and \( \gcd(p, q) = 1 \).

Solution

  1. Step 1: Assume the Opposite (Contradiction Hypothesis): 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 \) (meaning the fraction is already in its simplest form — \( p \) and \( q \) share no common factor other than 1).
  2. Step 2: Square Both Sides: Squaring both sides of \( \sqrt{3} = \frac{p}{q} \) gives: \[ 3 = \frac{p^2}{q^2} \]
    Multiplying both sides by \( q^2 \): \[ p^2 = 3q^2 \]
    This tells us that \( 3 \) divides \( p^2 \).
  3. Step 3: Conclude that 3 Divides p: Since \( 3 \) divides \( p^2 \), and \( 3 \) is a prime number, by the standard result (if a prime divides a square, it divides the number itself), we conclude that \( 3 \) divides \( p \).
    So we can write \( p = 3k \) for some integer \( k \).
  4. Step 4: Substitute Back: Substitute \( p = 3k \) into the equation \( p^2 = 3q^2 \): \[ (3k)^2 = 3q^2 \] \[ 9k^2 = 3q^2 \]
    Dividing both sides by 3: \[ q^2 = 3k^2 \]
    This tells us that \( 3 \) divides \( q^2 \).
  5. Step 5: Conclude that 3 Divides q: Since \( 3 \) divides \( q^2 \), and \( 3 \) is prime, by the same result, we conclude that \( 3 \) divides \( q \).
  6. Step 6: Arrive at the Contradiction: We have now shown that \( 3 \) divides both \( p \) and \( q \).
    But this contradicts our original assumption that \( \gcd(p, q) = 1 \) (i.e., \( p \) and \( q \) have no common factor other than 1).
    This is a contradiction!
  7. Step 7: State the Conclusion: Since our assumption that \( \sqrt{3} \) is rational leads to a contradiction, the assumption must be false.
    Therefore, \( \sqrt{3} \) is irrational.

Final Answer

\( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming \( \sqrt{3} = \frac{p}{q} \) in lowest terms leads to the impossible conclusion that 3 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \).)

Common Mistake

Many students forget to state that \( \frac{p}{q} \) is in its lowest terms (i.e., \( \gcd(p, q) = 1 \)) at the beginning. Without this condition, no contradiction arises later — so the proof only works if you clearly assume the fraction is fully reduced from the start.

🪜 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{3} \) is rational. Then it can be expressed as \( \sqrt{3} = \frac{p}{q} \), where \( p \) and \( q \) are integers with \( q \ne 0 \) and \( \gcd(p, q) = 1 \) (the fraction is already fully reduced). — Reason: This is the starting point of a proof by contradiction; we assume the opposite of our goal and look for an impossibility.
  2. Step 2: Square Both Sides: Squaring both sides of \( \sqrt{3} = \frac{p}{q} \) gives \[ 3 = \frac{p^2}{q^2} \] which can be rearranged to \[ p^2 = 3q^2 \] — Reason: Squaring removes the square root, letting us work with integers and apply number theory results.
  3. Step 3: Conclude That 3 Divides p: From \( p^2 = 3q^2 \), we see that \( 3 \) divides \( p^2 \). Since \( 3 \) is a prime number, the key result tells us that \( 3 \) must also divide \( p \). So we can write \( p = 3m \) for some integer \( m \). — Reason: The prime divisibility rule (if a prime divides a square, it divides the base) lets us draw conclusions about \( p \) itself.
  4. Step 4: Substitute Back: Replace \( p \) with \( 3m \) in the equation \( p^2 = 3q^2 \): \[ (3m)^2 = 3q^2 \] \[ 9m^2 = 3q^2 \] Dividing both sides by \( 3 \): \[ 3m^2 = q^2 \] — Reason: Substituting lets us investigate whether \( 3 \) also divides \( q \), which is the key to finding the contradiction.
  5. Step 5: Conclude That 3 Divides q: From \( q^2 = 3m^2 \), we see that \( 3 \) divides \( q^2 \). Again, since \( 3 \) is prime, the same key result tells us that \( 3 \) must also divide \( q \). — Reason: Applying the same prime divisibility rule to \( q \) reveals the contradiction we have been building toward.
  6. Step 6: Identify the Contradiction: We have now shown that \( 3 \) divides \( p \) AND \( 3 \) divides \( q \). This means \( \gcd(p, q) \ge 3 \), which directly contradicts our starting assumption that \( \gcd(p, q) = 1 \). — Reason: A fraction in lowest terms cannot have \( p \) and \( q \) sharing a common factor; this impossibility invalidates the original assumption.
  7. Step 7: Draw the Conclusion: Since assuming \( \sqrt{3} \) is rational leads to the impossible conclusion that \( 3 \) divides both \( p \) and \( q \) simultaneously, the assumption itself must be false. Therefore, \( \sqrt{3} \) is irrational. — Reason: This is how proof by contradiction concludes — a false assumption means the opposite statement must be true.

Final Answer

\( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming \( \sqrt{3} = \frac{p}{q} \) in lowest terms leads to the impossible conclusion that 3 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \).)

Common Mistake

One common mistake: Students forget to state that \( \gcd(p, q) = 1 \) at the beginning, which is essential — without establishing that the fraction is in lowest terms, there is no contradiction to arrive at when 3 is found to divide both \( p \) and \( q \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Assume \( \sqrt{3} \) is rational: Let \( \sqrt{3} = \frac{p}{q} \) where \( p, q \in \mathbb{Z} \), \( q \ne 0 \), and \( \gcd(p, q) = 1 \).
  2. Step 2: Square both sides: Squaring: \[ 3 = \frac{p^2}{q^2} \implies p^2 = 3q^2 \] So 3 divides \( p^2 \), hence 3 divides \( p \). Write \( p = 3m \) for some integer \( m \).
  3. Step 3: Substitute back: Substituting \( p = 3m \): \[ (3m)^2 = 3q^2 \implies 9m^2 = 3q^2 \implies q^2 = 3m^2 \] So 3 divides \( q^2 \), hence 3 divides \( q \).
  4. Step 4: Contradiction: 3 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \). The assumption is false.

Answer: \( \sqrt{3} \) is an irrational number. (Proved by contradiction — assuming \( \sqrt{3} = \frac{p}{q} \) in lowest terms leads to the impossible conclusion that 3 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \).)

➕ More Examples

More Examples

Example 1

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: \[ 5 = \frac{p^2}{q^2} \] So \[ p^2 = 5q^2 \] This means \( 5 \mid p^2 \). Since 5 is prime, by Euclid's Lemma, \( 5 \mid p \). Therefore, we can write \( p = 5m \) for some integer \( m \). Substituting back: \[ (5m)^2 = 5q^2 \] \[ 25m^2 = 5q^2 \] \[ q^2 = 5m^2 \] This means \( 5 \mid q^2 \), and since 5 is prime, by Euclid's Lemma, \( 5 \mid q \). But now we have shown that 5 divides both \( p \) and \( q \), which contradicts our assumption that \( \gcd(p, q) = 1 \). Therefore, our assumption that \( \sqrt{5} \) is rational is false, and \( \sqrt{5} \) is irrational.

Answer: \( \sqrt{5} \) 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{p}{q} \] where \( p \) and \( q \) are integers, \( q \ne 0 \), and \( \gcd(p, q) = 1 \) (the fraction is in its lowest terms). Squaring both sides: \[ 7 = \frac{p^2}{q^2} \] So \[ p^2 = 7q^2 \] This means \( 7 \mid p^2 \). Since 7 is prime, by Euclid's Lemma, \( 7 \mid p \). Therefore, we can write \( p = 7k \) for some integer \( k \). Substituting back: \[ (7k)^2 = 7q^2 \] \[ 49k^2 = 7q^2 \] \[ q^2 = 7k^2 \] This means \( 7 \mid q^2 \), and since 7 is prime, by Euclid's Lemma, \( 7 \mid q \). But now 7 divides both \( p \) and \( q \), which contradicts our assumption that \( \gcd(p, q) = 1 \). Therefore, our assumption that \( \sqrt{7} \) is rational is false, 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{5} \) is an irrational number.

Solution

  1. Step 1: Assume the contrary: Assume, for the sake of contradiction, that \( \sqrt{5} \) is rational. Then we can write \( \sqrt{5} = \dfrac{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).
  2. Step 2: Square both sides: Squaring both sides of \( \sqrt{5} = \dfrac{p}{q} \) gives \[ 5 = \frac{p^2}{q^2} \] which means \[ p^2 = 5q^2. \]
  3. Step 3: Conclude that 5 divides p: From \( p^2 = 5q^2 \), we see that 5 divides \( p^2 \). Since 5 is prime, by the fundamental property of primes, 5 must also divide \( p \). So we can write \( p = 5k \) for some integer \( k \).
  4. Step 4: Substitute back: Substituting \( p = 5k \) into \( p^2 = 5q^2 \): \[ (5k)^2 = 5q^2 \] \[ 25k^2 = 5q^2 \] \[ q^2 = 5k^2. \] This means 5 divides \( q^2 \), and since 5 is prime, 5 must also divide \( q \).
  5. Step 5: Arrive at a contradiction: We have shown that 5 divides both \( p \) and \( q \). This means \( \gcd(p, q) \ge 5 \), which contradicts our assumption that \( \gcd(p, q) = 1 \).
  6. Step 6: Conclusion: Since our assumption that \( \sqrt{5} \) is rational leads to a contradiction, we conclude that \( \sqrt{5} \) is irrational.

Answer: \( \sqrt{5} \) is an irrational number. (Proved by contradiction — assuming \( \sqrt{5} = \dfrac{p}{q} \) in lowest terms leads to the conclusion that 5 divides both \( p \) and \( q \), contradicting \( \gcd(p, q) = 1 \).)

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