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).

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/409.lean

Formal Conjectures

FormalConjectures/ErdosProblems/409.leanErdos409.erdos_409.parts.i1 lineExact file
∀ (n : ℕ), 0 < nIsLeast {i | Nat.Prime ((fun x => x.totient + 1)^[i] n)} sorry
OpenStatement only, no proof

Continue

Search problems.science

Find a Problem, Result, source, or page