### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 307-313 |

Number of pages | 7 |

Journal | Transactions of the American Mathematical Society |

Volume | 212 |

DOIs | |

Publication status | Published - 1975 |

### Keywords

- Integers
- Subsequence
- Sum-free

### ASJC Scopus subject areas

- Mathematics(all)
- Applied Mathematics

## Fingerprint Dive into the research topics of 'On sum-free subsequences'. Together they form a unique fingerprint.

## Cite this

Choi, S. L. G., Komlôs, J., & Szemerédi, E. (1975). On sum-free subsequences.

*Transactions of the American Mathematical Society*,*212*, 307-313. https://doi.org/10.1090/S0002-9947-1975-0376594-1