An algorithm for partitions
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.
Retrieve articles in Proceedings of the American Mathematical Society with MSC: 10A45
Retrieve articles in all journals with MSC: 10A45
Keywords: Partitions, representation of integers, density of sequences
Article copyright: © Copyright 1975 American Mathematical Society