Maths Olympiad Prep

Library / /32 of 94

Number theory Difficulty 5.6 AIME, harder Prove it Hong Kong

For a positive integer kk, let f1(k)f_1(k) be the square of the sum of the digits of kk. (For example f1(123)=(1+2+3)2=36f_1(123) = (1+2+3)^2 = 36.) Let fn+1(k)=f1(fn(k))f_{n+1}(k) = f_1(f_n(k)). Determine the value of f2007(22006)f_{2007}(2^{2006}). Justify your claim.

Solution

Firstly, since 22006<1020062^{2006} < 10^{2006}, we have
f(22006)(9×2006)2<1010. f(2^{2006}) \le (9 \times 2006)^2 < 10^{10}.
Secondly, this implies
f2(22006)(9×10)2=8100. f_2(2^{2006}) \le (9 \times 10)^2 = 8100.
Similarly, we find that
f3(22006)(7+9+9+9)2=1156 f_3(2^{2006}) \le (7 + 9 + 9 + 9)^2 = 1156
and
f4(22006)(9×3)2=729. f_4(2^{2006}) \le (9 \times 3)^2 = 729.
It follows that the sum of digits of fk(22006)f_k(2^{2006}) cannot exceed 27 for k4k \ge 4.
Next, since 261(mod9)2^6 \equiv 1 \pmod 9 and 20062(mod6)2006 \equiv 2 \pmod 6, we have
22006224(mod9). 2^{2006} \equiv 2^2 \equiv 4 \pmod 9.
We easily find that fk(22006)7(mod9)f_k(2^{2006}) \equiv 7 \pmod 9 for odd kk and fk(22006)4(mod9)f_k(2^{2006}) \equiv 4 \pmod 9 for even kk. Thus, the sum of digits of f2005(22006)f_{2005}(2^{2006}) can only be 7, 16, 25. This yields f2006(22006)=49,256,625f_{2006}(2^{2006}) = 49, 256, 625 and hence $f_{2007}(2^{2006}) = 169.

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.