Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Prove by cases that for every integer , leaves remainder or when divided by . Use your result to prove that no number of the form is a perfect square. Then count two things. How many perfect squares from to leave remainder on division by ? For how many whole numbers from to does leave remainder ? Explain the second count with your cases.
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 cases.
Every integer falls in one case, so the remainder is always or .
Step 2. Numbers . They leave remainder , which no square leaves. So none is a perfect square.
Step 3. First count. So perfect squares from to leave remainder .
Step 4. Second count. Remainder comes from the that are not multiples of . From to there are multiples of , so values.
Check. : , remainder . : , remainder .
Answer: squares, and values of .
Log in to join the discussion.
Loading…