Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A number theorist wants to prove that no integer of the form is a sum of three squares of integers, so , and are not. First list the possible remainders of a square on division by . Then show that a sum of three of these remainders is never modulo . Finally count the integers with that the proof rules out, and find the largest of them.
means . Congruences add, subtract, multiply and take powers like equations. A small power congruent to or cuts a large exponent down:
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.
Given. Integers and the modulus .
Plan. List the squares modulo , add three of them in every way, and see that never appears.
Step 1. Squares modulo 8. , , , , , , , . So a square is , or modulo .
Step 2. Sums of three. Each term is , or . The sums are , which modulo are . The remainder is missing.
Step 3. Conclusion. So , and no number is a sum of three squares. Proof complete.
Step 4. The count. The numbers are , since . There are of them.
Check. is above , so is the last one.
Answer: numbers from to , the largest being .
What if? A famous theorem of Legendre says that these, together with the numbers , are the only positive integers that are not sums of three squares. The proof of that converse is much harder.
Log in to join the discussion.
Loading…