A problem of restricted partitions

A problem of restricted partitions

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 strik...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Naval research logistics quarterly 1974-03, Vol.21 (1), p.201-205
Hauptverfasser: Uppuluri, V. R. R., Carpenter, J. A.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0028-1441
1931-9193
DOI:10.1002/nav.3800210115