Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Prove by contradiction that there are no integers and with . Then go further. For which whole numbers from to do there exist integers and , positive, negative or zero, with ? Prove your answer in both directions: why the other numbers cannot be reached, and how every number you list can be reached. How many such are there?
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 contradiction. Suppose integers , give . The left side is , a multiple of . But is not. This is impossible, so no such integers exist.
Step 2. Which can be reached. The same argument shows that must be a multiple of .
Step 3. Every multiple of can be reached. From , multiply by : . So every multiple of is reached.
Step 4. Count. The multiples of from to are : that is numbers.
Watch out. If and had to be whole numbers , the answer would change: itself could not be reached.
Answer: no solution for ; exactly the multiples of can be reached.
Log in to join the discussion.
Loading…