Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Prove by contradiction that is irrational. Follow the shape of the proof for , but you will need a new fact in place of "if is even, then is even". First prove that fact: for an integer , if is divisible by , then is divisible by . Use the contrapositive and split into cases by the remainder of on division by . Then write the full proof by contradiction, and say exactly which statement is contradicted.
Contradiction: assume the claim is false and reach something impossible. Cases: split the possibilities so that every one is covered, and prove the claim in each. Squares leave remainder or on division by .
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. The fact, by contrapositive and cases. Suppose is not divisible by .
In both cases leaves remainder , so does not divide . This proves: if divides , then divides .
Step 2. Assume the opposite. Suppose , with whole numbers , , , in lowest terms.
Step 3. Square. , so divides , and by Step 1, divides . Write .
Step 4. Again. gives . So divides , and divides .
Step 5. The contradiction. divides both and . This contradicts the assumption that is in lowest terms.
Conclusion. So is irrational. Proof complete.
Log in to join the discussion.
Loading…