Back to Problems

erdos_409.variants.sigma.parts.ii

Specification

Is it true that iterates of $n\mapsto\sigma(n) - 1$ always reach a prime?

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem erdos_409.variants.sigma.parts.ii :
    answer(sorry) ↔ ∀ n > 1, ∃ i, (σ 1 · - 1)^[i] n |>.Prime
ID: ErdosProblems__409__erdos_409.variants.sigma.parts.ii
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.