An algorithm for partitions
HTML articles powered by AMS MathViewer
- by Melvyn B. Nathanson PDF
- Proc. Amer. Math. Soc. 52 (1975), 121-124 Request permission
Abstract:
A class of algorithms is described to represent the positive integers as sums of elements in a prescribed sequence of integers, and results are obtained on the densities of the integers that can be represented by such partitions with a bounded number of summands.Additional Information
- © Copyright 1975 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 52 (1975), 121-124
- MSC: Primary 10A45
- DOI: https://doi.org/10.1090/S0002-9939-1975-0379353-4
- MathSciNet review: 0379353