Lesson eLearning

Prove that is an irrational number using prime factorisation and the method of contradiction.

medium 3 marks Class 10 · Mathematics · Real Numbers
Answer
Assuming in lowest terms leads to , implying is divisible by 3; writing gives , so is also divisible by 3, contradicting that is in lowest terms. Hence is irrational.

Step-by-step solution

  1. Assume, for contradiction, that is rational.
  2. Then it can be written as where and are positive integers with no common factor (lowest terms).
  3. Square both sides: .
  4. Factor as : .
  5. Thus divides , so must divide (if a prime divides a square, it divides the base).
  6. Write for some integer .
  7. Substitute back: .
  8. Again, divides , so divides ; let .
  9. Then , showing divides at least twice.
  10. From we get divides , hence divides .
  11. Thus both and are divisible by , contradicting the assumption that is in lowest terms.
  12. Therefore the original assumption is false, and is irrational.
Common mistake: Skipping the step of reducing the fraction to lowest terms before deducing the divisibility, which invalidates the contradiction.

Concept tested: Irrationality proof by contradiction

Published · How this solution was prepared and checked

Related questions

← All Real Numbers questions