olymmath

KURSCHAK 1992 Problem 2

    For any positive integer kk define f1(k)f_1(k) as the square of the digital sum of kk in the decimal system, and fn(k)=f1(fn−1(k))f_{n}(k)=f_1(f_{n-1}(k)) ∀n>1\forall n>1 . Compute f1992(21991)f_{1992}(2^{1991}) .

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator kurschak/1992/p2 · Tag NJ8017YM89 · Edit this page on GitHub · Keys: j next, k previous