Integer sets with distinct subset sums
HTML articles powered by AMS MathViewer
- by P. E. Frenkel PDF
- Proc. Amer. Math. Soc. 126 (1998), 3199-3200 Request permission
Abstract:
We give a simple, elementary new proof of a generalization of the following conjecture of Paul Erdős: the sum of the elements of a finite integer set with distinct subset sums is less than 2.References
- S. J. Benkoski and P. Erdős, On weird and pseudoperfect numbers, Math. Comp. 28 (1974), 617–623. MR 347726, DOI 10.1090/S0025-5718-1974-0347726-9
- F. Hanson, J. M. Steele, and F. Stenger, Distinct sums over subsets, Proc. Amer. Math. Soc. 66 (1977), no. 1, 179–180. MR 447167, DOI 10.1090/S0002-9939-1977-0447167-4
- Canadian Mathematical Bulletin 17 (1975), 768, Problem P. 220.
- R. Housberger, Mathematical Gems III, The Dolciani Mathematical Expositions, 1985, 215–223.
Additional Information
- P. E. Frenkel
- Affiliation: Kútvölgyi út 40, Budapest 1125, Hungary
- MR Author ID: 623969
- Email: frenkelp@cs.elte.hu
- Received by editor(s): April 7, 1997
- Additional Notes: The author thanks L. Laczkó for calling his attention to the problem, and M. Laczkovich for his attention and kind help.
- Communicated by: David E. Rohrlich
- © Copyright 1998 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 126 (1998), 3199-3200
- MSC (1991): Primary 11B13; Secondary 11B75
- DOI: https://doi.org/10.1090/S0002-9939-98-04576-6
- MathSciNet review: 1469406