Erdős problem 1 · problems.science

If $A\subseteq\{1, ..., N\}$ with $|A| = n$ is such that the subset sums $\sum_{a\in S}a$ are distinct for all $S\subseteq A$ then $N \gg 2 ^ n.$

Sources

Browse retained paths and inspect the exact material available for this Problem.

8 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

1.lean

Retained formal statement6 of 8

The minimal value of $N$ such that there exists a sum-distinct set with nine elements is $161$ .

https://oeis.org/A276661

FormalConjectures/ErdosProblems/1.leanErdos1.erdos_1.variants.least_N_91 lineExact file

1IsLeast {N | ∃ A, Erdos1.IsSumDistinctSet A N ∧ A.card = 9} 161

SolvedStatement only, no proof