Back to Problems

erdos124.ne_zero_three_four_seven

Specification

All sufficiently large integers can be written as $a + b + c$ where $a$ has only the digits $0, 1$ in base $3$, $b$ only the digits $0, 1$ in base $4$, $c$ only the digits $0, 1$ in base $7$. Provee by Burr, Erdős, Graham, and Li [BEGL96]

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement
lemma erdos124.ne_zero_three_four_seven {k : ℕ} (hk : k ≠ 0) :
    ∀ᶠ n in atTop,
      n ∈ sumsOfDistinctPowers 3 k + sumsOfDistinctPowers 4 k + sumsOfDistinctPowers 7 k
ID: ErdosProblems__124__erdos124.ne_zero_three_four_seven
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.