MathDB
M 15

Source:

May 25, 2007
logarithmsmodular arithmeticRecursive Sequences

Problem Statement

For a given positive integer kk denote the square of the sum of its digits by f1(k)f_{1}(k) and let fn+1(k)=f1(fn(k))f_{n+1}(k)=f_{1}(f_{n}(k)). Determine the value of f1991(21990)f_{1991}(2^{1990}).