Back to Problems

erdos_1.variants.least_N_9

Specification

The minimal value of $N$ such that there exists a sum-distinct set with nine elements is $161$. https://oeis.org/A276661

Mathematics prize
Prize

$500

Paul Erdős

Lean 4 Statement 
theorem erdos_1.variants.least_N_9 :
    IsLeast { N | ∃ A, IsSumDistinctSet A N ∧ A.card = 9 } 161
ID: ErdosProblems__1__erdos_1.variants.least_N_9
Actions

Submit a Proof

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

Submit Proof
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.