The largest sum-free subsequence from a sequence of $n$ numbers
HTML articles powered by AMS MathViewer
- by S. L. G. Choi PDF
- Proc. Amer. Math. Soc. 39 (1973), 42-44 Request permission
Abstract:
Let $g(n)$ denote the largest integer so that from any sequence of $n$ real numbers one can always select a sum-free subsequence of $g(n)$ numbers. Erdös has shown that $g(n) > {2^{ - 1/2}}{n^{1/2}}$. In this paper we obtain an improved estimate by a different method.References
- P. Erdős, Extremal problems in number theory, Proc. Sympos. Pure Math., Vol. VIII, Amer. Math. Soc., Providence, R.I., 1965, pp. 181–189. MR 0174539
Additional Information
- © Copyright 1973 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 39 (1973), 42-44
- MSC: Primary 10L99
- DOI: https://doi.org/10.1090/S0002-9939-1973-0313216-3
- MathSciNet review: 0313216