Skip to content

Erdős problem 409

If n>1n > 1 then the iteration nσ(n)1n\mapsto\sigma(n) - 1 necessarily reaches a prime. Note: this is open — it is not clear that the σ iteration always terminates, since it is non-decreasing (unlike the φ iteration which is strictly decreasing).

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Search problems.science

Find a Problem, Result, source, or page