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).
Retained from Formal Conjectures · not edited here
Formal statements
12 open · 1 test
Erdős Problems says
open
Decision here
No current contribution
Checks
0 checks · 13 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page