Prove that is an irrational number.
Answer
is irrational, proved by contradiction.
Step-by-step solution
- Assume the opposite of what we want to prove: suppose is rational.
- Then it can be written as , where and are integers, , and and have no common factor other than .
- Squaring both sides gives , so .
- This means divides . Since is prime, must also divide . Write for some integer .
- Substitute back: , so , which gives .
- By the same argument, divides , and therefore divides .
- So is a common factor of both and . That contradicts the assumption that they had no common factor other than .
- The assumption must therefore be false, and is irrational.
Common mistake: Forgetting to state at the start that and share no common factor. Without that condition there is no contradiction at the end and the proof collapses.
Concept tested: Proving irrationality by contradiction
Related questions
- 1 Without performing long division, state whether 13/3125 has a terminating or a non-terminating repeating decimal expansion. Write the expansion if it terminates.
- 2 Explain why 7 × 11 × 13 + 13 is a composite number.
- 3 Find the zeros of the quadratic polynomial x^2-5x+6.
- 4 Determine whether the pair of equations 5x - 2y = 7 and 10x - 4y = 20 are consistent, inconsistent, or represent the same straight line. Justify your answer.
- 5 Check whether 6^n can end with the digit 0 for any natural number n.
- 6 Find the HCF and the LCM of 306 and 657, and verify that HCF × LCM = product of the two numbers.