Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Prove that the equation has no solution in integers when leaves remainder or on division by . First find every possible remainder of a cube modulo , then every possible remainder of a sum of three cubes. Finally count the integers from to that this argument rules out, and find the largest of them.
Factor into a product equal to a known number; order the unknowns and bound the smallest; compare remainders modulo a well-chosen number. Pell's equation has the solutions
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. Cubes modulo 9. , , , , , , , , . So a cube is , or modulo .
Step 2. Three cubes. A sum of three numbers from lies between and , so modulo it is one of . The remainders and never occur. Proof complete.
Step 3. Count. From to : gives , which is numbers; gives , another . In all , the largest being .
Answer: numbers are ruled out, and the largest is .
What if? For the other remainders the question is open in general. Only in 2019 did a computer search find three cubes with sum and with sum .
Log in to join the discussion.
Loading…