Maths Olympiad Prep

Library / /10 of 15

Number theory Difficulty 5.4 AIME, harder Prove it Estonia

Prove that none of the integers that contain one 22, one 11, and all the rest zeros, can be expressed as a sum of two perfect squares or as a sum of two perfect cubes.

Solution

All the numbers described in the problem are divisible by 33 (as their sum of digits is divisible by 33). Note that all perfect squares leave the remainder 00 or 11 when divided by 33, and therefore, for the sum of the two perfect squares to be divisible by 33, they both have to be divisible by 33. Now, as the numbers are both divisible by 33, their squares are divisible by 99 and thus the sum of the squares is divisible by 99. However, the number described in the problem is not divisible by 99, a contradiction.

Note that when a cube number is divided by 33, it will leave the remainder of either 00, 11 or 1-1. Indeed, (3k)3=9(3k3)(3k)^3 = 9(3k^3) and (3k±1)3=27k3±27k2+9k±1=9(3k3±3k2+k)±1(3k \pm 1)^3 = 27k^3 \pm 27k^2 + 9k \pm 1 = 9(3k^3 \pm 3k^2 + k) \pm 1. The numbers described in the problem give the remainder 33 when divided by 99 (as their sum of digits gives the remainder 33 when divided by 99), therefore we conclude that it is impossible to express them as sums of two cubes.

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 and solution reproduced as published; topic and difficulty added by this site.