The Ramanujan Journal

, Volume 9, Issue 1, pp 77–82

Sum-Avoiding Subsets

Article

DOI: 10.1007/s11139-005-0826-4

Cite this article as:
Ruzsa, I.Z. Ramanujan J (2005) 9: 77. doi:10.1007/s11139-005-0826-4

Abstract

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.

Keywords

sumsetcombinatorial number theory

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.Alfréd Rényi Institute of MathematicsHungary