Erdős problem 409
If then the iteration 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
FormalConjectures/ErdosProblems/
409.lean
Retained formal statement
How many iterations of are needed before a prime is reached?
∀ (n : ℕ), 0 < n → IsLeast {i | Nat.Prime ((fun x => x.totient + 1)^[i] n)} sorryOpenStatement only, no proof