1988 AIME Problem 2

Attempt Problem 2 of the 1988 AIME below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 1988 AIME solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

2.

For any positive integer k,k, let f1(k)f_1(k) denote the square of the sum of the digits of k.k. For n2,n\geq2, let fn(k)=f1(fn1(k)).f_n(k)=f_1(f_{n-1}(k)). Find f1988(11).f_{1988}(11).

Answer: 169
Concepts:digitsrecursionpattern recognition
Difficulty rating: 1690
Small Hint:

Compute the first several iterates until a value repeats

Big Hint:

After the transient values, the sequence alternates between two numbers

Solution:

The iterates begin 4,4, 16,16, 49,49, 169,169, 256,256, followed by 169,169, 256,256, .\ldots. Thus from the fourth iterate onward, even indices give 169169 and odd indices give 256.256. Since 19881988 is even, f1988(11)=169.f_{1988}(11)=169.

← Problem 1#1
Full Exam

Problem 2 in Other Years