We estimate the maximal number of elements that can be selected from a set of n numbers so that the sum of two selected elements are never in the original set. We improve Choi’s upper bound of n2/5 to ec√log n n.
Keywordssumset combinatorial number theory
Unable to display preview. Download preview PDF.
- 1.S.L.G. Choi, “On a combinatorial problem in number theory,” Proc. London Math. Soc. 23 (1971), 629–641.Google Scholar