A problem of restricted partitions

V. R. R. Uppuluri and J. A. Carpenter

Naval Research Logistics Quarterly, 1974, vol. 21, issue 1, 201-205

Abstract: This paper presents a simple algorithm for finding the number of restricted k‐partitions of a natural number n. The unrestricted k‐partitions of n are expressed as the sum of these restricted k‐partitions, called inadmissible, and the admissible k‐partitions. The simplicity of the algorithm is striking, though all the implications are unclear.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800210115

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:21:y:1974:i:1:p:201-205

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().