Prove that is irrational.
Proof:
Assume, to the contrary, that is rational.
Then we can write , where and are coprime integers and .
Squaring both sides:
Therefore,
This means 5 divides .
By Theorem 1.2: If a prime divides , then divides .
Since 5 divides , it follows that 5 divides .
Let for some integer .
Substituting in :
This means 5 divides .
Again by Theorem 1.2, 5 divides .
Contradiction: We have shown that 5 divides both and .
But this contradicts our assumption that and are coprime (have no common factor other than 1).
This contradiction has arisen because of our incorrect assumption that is rational.
∴ Conclusion: is irrational.
Explanation
This proof uses the method of contradiction, similar to the proof that is irrational given in the chapter (Theorem 1.3). The key theorem used is Theorem 1.2: If a prime divides , then divides . By assuming is rational and expressing it as with coprime integers, we derive that 5 divides both and , contradicting the coprime assumption.
Solution Steps
Step 1: Assume is rational, so where , are coprime
Step 2: Square both sides: , so
Step 3: By Theorem 1.2, since 5 divides , therefore 5 divides
Step 4: Let , substitute: , giving
Step 5: By Theorem 1.2, since 5 divides , therefore 5 divides
Step 6: This contradicts that and are coprime
Step 7: Conclude is irrational