Erdős Problem #414 — Common iterates of the divisor-counting map
For each positive integer , let be the number of its positive divisors and define . Define the iterates by and, for every integer , . Is it true that for every pair of positive integers there are positive integers such that
Background
The question was asked by Spiro and appears in the Erdős–Graham problem collection; Erdős and Graham believed the answer was yes. Each step strictly increases the input, since , so the question asks whether the forward trajectories of this particular map always eventually meet—not whether an orbit settles into a periodic cycle. A useful equivalent viewpoint is the undirected graph on the positive integers with an edge between and : the question asks whether this graph is connected. Erdős Problems #414 Kernel-Checked Frontier Certificates for Erdős Problem 414 Square-Annular Dynamics and Coalescence Frontiers for n+τ(n)
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.