Prove that is an irrational number using prime factorisation and the method of contradiction.
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
- Assume, for contradiction, that is rational.
- Then it can be written as where and are positive integers with no common factor (lowest terms).
- Square both sides: .
- Factor as : .
- Thus divides , so must divide (if a prime divides a square, it divides the base).
- Write for some integer .
- Substitute back: .
- Again, divides , so divides ; let .
- Then , showing divides at least twice.
- From we get divides , hence divides .
- Thus both and are divisible by , contradicting the assumption that is in lowest terms.
- 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
- 1 Which of the following numbers is a rational number?
- 2 What is the smallest integer that must be added to 245 so that the resulting number is a perfect square?
- 3 What is the smallest integer that must be added to 1729 so that the resulting number is a perfect square? State the integer and the perfect square obtained.
- 4 Find the HCF and LCM of 84 and 150 using prime factorisation, and verify that HCF × LCM equals the product 84 × 150.
- 5 Find the HCF and LCM of 84 and 126 using prime factorisation, and verify that HCF × LCM equals the product of the two numbers.
- 6 Express the repeating decimal 0.123 as a fraction in lowest terms.