ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A finite set A⊆{1,…,N}A\subseteq\{1,\dots,N\} is sum-distinct if all subset sums

∑a∈Sa,S⊆A,\sum_{a\in S} a,\qquad S\subseteq A,

are distinct. Erdős asked whether there is an absolute constant C>0C>0 such that every sum-distinct set A⊆{1,…,N}A\subseteq\{1,\dots,N\} satisfies

N>C 2∣A∣.N>C\,2^{|A|}.

The conjecture is false: for every ε>0\varepsilon>0 there are arbitrarily large nn and sum-distinct sets A⊆{1,…,N}A\subseteq\{1,\dots,N\} with

∣A∣=n,N≤ε2n.|A|=n,\qquad N\le \varepsilon 2^n.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.