Function Problem | AIME I, 1988 | Question 2

For any positive integer k, let \(f_1(k)\) denote the square of the sum of the digits of k. For \(n \geq 2\), let \(f_n(k)=f_1(f_{n-1}(k))\), find \(f_{1988}(11)\).

\(f_1(11)=4\)

or, \(f_2(11)=f_1(4)=16\)

or, \(f_3(11)=f_1(16)=49\)

or, \(f_4(11)=f_1(49)=169\)

or, \(f_5(11)=f_1(169)=256\)

or, \(f_6(11)=f_1(256)=169\)

or, \(f_7(11)=f_1(169)=256\)

This goes on between two numbers with this pattern, here 1988 is even,

or, \(f_1988(11)=f_4(11)=169\).

AMC - AIME Boot Camp... for brilliant students.

Use our exclusive one-on-one plus group class system to prepare for Math Olympiad

Learn More

Subscribe to Cheenta at Youtube