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

Sources

The source's own material, retained exactly.

13 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

409.lean

Retained formal statement13 of 13

If n>0n > 0, then the iteration n↦ϕ(n)+1n\mapsto\phi(n) + 1 necessarily reaches a prime.

FormalConjectures/ErdosProblems/409.leanErdos409.erdos_409.variants.termination1 lineExact file
∀ (n : ℕ), 0 < n → ∃ i, Nat.Prime ((fun x => x.totient + 1)^[i] n)
TestStatement only, no proof