Back to Problems

erdos_494.variant.k_eq_2_card_not_pow_two

Specification

Selfridge and Straus [SeSt58] showed that the conjecture is true when $k = 2$ and $|A| \ne 2^l$ for $l \ge 0$. They also gave counterexamples when $k = 2$ and $|A| = 2^l$.

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement
theorem erdos_494.variant.k_eq_2_card_not_pow_two :
    ∀ card : ℕ, (∀ l : ℕ, card ≠ 2 ^ l) → Erdos494Unique 2 card
ID: ErdosProblems__494__erdos_494.variant.k_eq_2_card_not_pow_two
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.