- Cite this article as:
- Ruzsa, I.Z. Ramanujan J (2005) 9: 77. doi:10.1007/s11139-005-0826-4
- 100 Downloads
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.