Needs a steward / erdos-412
Steward erdos-412
Let $σ_1(n)=σ(n)$, the sum of divisors function, and $σ_k(n) = σ(σ_{k-1}(n))$. Is it true that, for every $m, n ≥ 2$, there exist some $i, j$ such that $σ_i(m) = σ_j(n)$?
What the role asks
- Understand what the network proves on this problem.
- Write it up, and sign the explainer of the proof that closes it.
- Best efforts, no deadline: step down at any time.