A subsequence of a sequence of n distinct integers is said to be sum-free if no integer in it is the sum of distinct integers in it. Let f(n) denote the largest quantity so that every sequence of n distinct integers has a sum-free subsequence consisting of f(n) integers. In this paper we strengthen previous results by Erdos, Choi and Cantor by proving (Formula present) 1975 American Mathematical Society.
ASJC Scopus subject areas
- Applied Mathematics