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

Sum-Avoiding Subsets

Purchase on Springer.com

$39.95 / €34.95 / £29.95*

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 .

To Professor Nicolas, on the occasion of his 60th birthday.
2000 Mathematics Subject Classification: Primary—11B75
Supported by Hungarian National Foundation for Scientific Research (OTKA), Grants No. T 38396, T43623 and T42750.