, Volume 9, Issue 1-2, pp 77-82

Sum-Avoiding Subsets

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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 n 2/5 to e c√log n n .