A note on sum-free sets of integers
HTML articles powered by AMS MathViewer
- by Mên Ch’ang Hu PDF
- Proc. Amer. Math. Soc. 80 (1980), 711-712 Request permission
Abstract:
A set S of integers is said to be sum-free if $a,b \in S$ implies $a + b \notin S$. Let $g(n,k)$ denote the cardinality of a largest subset of $\{ 1,2, \ldots ,n\}$ that can be partitioned into k sum-free sets. In this note we show that $g(n,2) = n - [n/5]$.References
- H. L. Abbott and E. T. H. Wang, Sum-free sets of integers, Proc. Amer. Math. Soc. 67 (1977), no. 1, 11–16. MR 485759, DOI 10.1090/S0002-9939-1977-0485759-7
Additional Information
- © Copyright 1980 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 80 (1980), 711-712
- MSC: Primary 05A17; Secondary 10L05
- DOI: https://doi.org/10.1090/S0002-9939-1980-0587962-4
- MathSciNet review: 587962