Maths Olympiad Prep

Library / /9 of 62

Number theory Difficulty 4.8 AIME Prove it Ukraine

a) Determine if there exist positive integer numbers x,y,zx, y, z such that
2016=x3+y3+z3? 2016 = x^3 + y^3 + z^3?

b) Determine if there exist positive integer numbers x,y,z,tx, y, z, t such that
2016=x3+y3+z3+t3? 2016 = x^3 + y^3 + z^3 + t^3?

Solution

b) It is enough to provide an example: 2016=1000+1000+8+82016 = 1000 + 1000 + 8 + 8.

a) Let us first note that 2016=253272016 = 2^5 \cdot 3^2 \cdot 7. And consider remainders of a3,b3,c3a^3, b^3, c^3 modulo 77. The remainders could equal to 00 or ±1\pm 1. Thus, if 2016=x3+y3+z32016 = x^3 + y^3 + z^3 then at least one of the numbers is divisible by 77. It is easy to see that it must be 77, because 73=343<20167^3 = 343 < 2016, and the next number 143=2744>201614^3 = 2744 > 2016. Thus two other numbers must satisfy the condition y3+z3=1673y^3 + z^3 = 1673.

Now, suppose that yzy \le z. Since 123=1728>167312^3 = 1728 > 1673 then z11z \le 11. Moreover, 1673=y3+z32z31673 = y^3 + z^3 \le 2z^3, then 837z3837 \le z^3, and it means that 10z10 \le z. To finish the solution we just need to check cases z=10,11z=10,11.

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.