Back to Problems

erdos_494.variant.k_eq_3_card_gt_6

Specification

Selfridge and Straus [SeSt58] also showed that the conjecture is true when 1) $k = 3$ and $|A| > 6$ or 2) $k = 4$ and $|A| > 12$. More generally, they proved that $A$ is determined by $A_k$ (and $|A|$) if $|A|$ is divisible by a prime greater than $k$.

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_3_card_gt_6 :
    ∀ card > 6, Erdos494Unique 3 card
ID: ErdosProblems__494__erdos_494.variant.k_eq_3_card_gt_6
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.