Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 

 

An algorithm for partitions


Author: Melvyn B. Nathanson
Journal: Proc. Amer. Math. Soc. 52 (1975), 121-124
MSC: Primary 10A45
MathSciNet review: 0379353
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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.


References [Enhancements On Off] (What's this?)

  • [1] I. Kátai, Some algorithms for the representation of natural numbers, Acta Sci. Math. (Szeged) 30 (1969), 99–105. MR 0240039

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 10A45

Retrieve articles in all journals with MSC: 10A45


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1975-0379353-4
Keywords: Partitions, representation of integers, density of sequences
Article copyright: © Copyright 1975 American Mathematical Society