Real Numbers | Exercise 1.2
Question 1
Prove that is irrational.
Solution
Understand the Question
- We use the method of contradiction to prove that is irrational.
- First, assume the contrary: that is a rational number, meaning it can be written as , where and are co-prime integers () with no common factors other than .
- If we can show that both and share a common factor of , it contradicts our assumption of co-primality, proving that must be irrational.
Step 1 · Assume is Rational and Show 5 Divides
Let us assume, to the contrary, that is rational.
Then, there exist co-prime integers and (where ) such that:
Squaring both sides
Since divides , by the fundamental theorem of arithmetic, must also divide .
Step 2 · Show 5 Divides and Establish Contradiction
Since divides , we can write for some integer .
Substitute into equation (1)
This means divides , and therefore also divides .
From Step 1 and Step 2, both and have at least as a common factor.
This contradicts the fact that and are co-prime. Our assumption that is rational is false.
Answer
Hence, it is proved that is irrational.
Common Mistakes
- Omitting the Co-prime Assumption: Forgetting to state that and are co-prime (having no common factor other than ), which is the core property being contradicted.
- Divisibility Rule for Primes: Assuming that if a composite number divides , it divides . This theorem strictly holds because is a prime number.