Erdős Problem #411 — Eventual doubling under iterated totient addition
Let be Euler’s totient function, define for positive integers , and recursively define and for . Determine all positive integers and for which there is an integer such that
for every integer . Erdős Problems #411
Background
Erdős and Graham posed this iteration problem in their 1980 collection Old and New Problems and Results in Combinatorial Number Theory. It brings together the multiplicative arithmetic of the totient function and repeated addition through . The problem has also prompted the study of eventual identities with multipliers other than , which give context for the range of possible iteration patterns. Erdős and Graham (1980), p. 81; Erdős Problems #411 Steinerberger, On an iterated arithmetic function problem of Erdős and Graham (2025 preprint)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.