Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1990_01_01_erdos_granville_pomerance_spiro: The 1990 paper proves that the number of totient iterations needed to reach one has normal and average order alpha log n for some alpha > 0, provided a strong form of the Elliott–Halberstam conjecture holds; it is unproven.
Linked from (1)
Graph