The Number of Partitions of the Integer N into M Nonzero Positive Integers

DOI10.2307/2007632zbMath0487.10013OpenAlexW4251842908MaRDI QIDQ3947724

W. J. A. Colman

Publication date: 1982

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2007632

zbMATH Keywords

number of partitionsSylvester formulacomputationally more efficient expansion

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Related Items (2)

New upper bounds for the number of partitions into a given number of parts ⋮ On number of partitions of an integer into a fixed number of positive integers

This page was built for publication: The Number of Partitions of the Integer N into M Nonzero Positive Integers