Maths Olympiad Prep

Library / /39 of 1394

, 2016

Number theory Difficulty 4.6 AIME Prove it United States

Problem:
Let aa and bb be integers (not necessarily positive). Prove that a3+5b32016a^{3} + 5b^{3} \neq 2016.

Solution

Solution:
Since cubes are 00 or ±1\pm 1 modulo 99, by inspection we see that we must have a3b30(mod3)a^{3} \equiv b^{3} \equiv 0 \pmod{3} for this to be possible. Thus aa, bb are divisible by 33. But then we get 3320163^{3} \mid 2016, which is a contradiction.

One can also solve the problem in the same manner by taking modulo 77, since all cubes are 00 or ±1\pm 1 modulo 77. The proof can be copied literally, noting that 720167 \mid 2016 but 7320167^{3} \nmid 2016.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.