MathDB
SMT 2013 Team #1

Source:

February 4, 2013

Problem Statement

Let f1(n)f_1(n) be the number of divisors that nn has, and define fk(n)=f1(fk1(n))f_k(n)=f_1(f_{k-1}(n)). Compute the smallest integer kk such that fk(20132013)=2f_k(2013^{2013})=2.