← All problems

Erdős Problem #414 — Common iterates of the divisor-counting map

46 years old · traced to

For each positive integer nn, let τ(n)\tau(n) be the number of its positive divisors and define h(n)=n+τ(n)h(n)=n+\tau(n). Define the iterates by h1=hh_1=h and, for every integer k≥2k\ge 2, hk=h∘hk−1h_k=h\circ h_{k-1}. Is it true that for every pair of positive integers m,nm,n there are positive integers i,ji,j such that

hi(m)=hj(n)?h_i(m)=h_j(n)?

Erdős Problems #414

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 τ(n)≥1\tau(n)\ge 1, 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 nn and h(n)h(n): 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

Progress summary

Never refreshed

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.