Skip to content

Erdős problem 1

Start work

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

Sources

The source's own material, retained exactly.

8 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

1.lean

Retained formal statement5 of 8

The minimal value of NN such that there exists a sum-distinct set with five elements is 1313.

https://oeis.org/A276661

FormalConjectures/ErdosProblems/1.leanErdos1.erdos_1.variants.least_N_51 lineExact file
IsLeast {N | ∃ A, Erdos1.IsSumDistinctSet A N ∧ A.card = 5} 13
SolvedStatement only, no proof