Back to Problems

erdos_406

Specification

Is it true that there are only finitely many powers of $2$ which have only the digits $0$ and $1$ when written in base $3$?

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_406 : answer(sorry) ↔ { n | n.isPowerOfTwo ∧ Nat.digits 3 n ⊆ [0, 1] }.Finite
ID: ErdosProblems__406__erdos_406
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.