Erdős Problem #411 — Let $g_1=g(n)=n+\phi(n)$ and $g_k(n)=g(g_{k-1}(n))$ . For which $n$ and $r$ is it true that $g_{k+r}(n)=2g_k(n)$ for all large $k$ ?

Let $g_1=g(n)=n+\phi(n)$ and $g_k(n)=g(g_{k-1}(n))$ . For which $n$ and $r$ is it true that $g_{k+r}(n)=2g_k(n)$ for all large $k$ ?

References

Primary source

Posted 1 month ago · edited 3 weeks ago

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

No solutions have been posted yet.