Back to Problems

erdos_936.variants.two_pow_sub_one

Specification

Is $2^n - 1$ powerful for finitely many $n$?

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_936.variants.two_pow_sub_one :
   answer(sorry) ↔ EventuallyNotPowerful (2 ^ · - 1)
ID: ErdosProblems__936__erdos_936.variants.two_pow_sub_one
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.