For a given positive integer $k$ denote the square of the sum of its digits by $f_{1}(k)$ and let $f_{n+1}(k)=f_{1}(f_{n}(k))$. Determine the value of $f_{1991}(2^{1990})$.
Source:
Tags: logarithms, modular arithmetic, Recursive Sequences
For a given positive integer $k$ denote the square of the sum of its digits by $f_{1}(k)$ and let $f_{n+1}(k)=f_{1}(f_{n}(k))$. Determine the value of $f_{1991}(2^{1990})$.