Problem 409

Erdős Problem #409: declared status 'open'. Formalized: yes. How many iterations of $n\mapsto \phi(n)+1$ are needed before a prime is reached? Can infinitely many $n$ reach the same prime? What is the density of $n$ which reach any fixed prime? Prize: no. OEIS: A039651, A229487. Tags: iterated functions, number theory.