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 statement8 of 8

The trivial lower bound is $N \gg 2^n / n$ .

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

1∃ C > 0, ∀ (N : ℕ) (A : Finset ℕ), Erdos1.IsSumDistinctSet A N → N ≠ 0 → C * 2 ^ A.card / ↑A.card < ↑N

TextbookStatement only, no proof