TWO SIMPLE ALGORITHMS FOR THE GENERATION OF PARTITIONS OF AN INTEGER.
Publication
, Journal Article
Tomasi, C
Published in: Alta frequenza
January 1, 1982
A very simple recursive techniqe to compute the partitions of an integer k into p parts is described, starting by those of k-1 into p parts or, alternatively, by those of k into p-1 parts. This result is then used to solve some problems encountered in the literature. One of the algorithms presented yields a criterion for arranging all the partitions of integers on a wide-sense binary tree.
Duke Scholars
Published In
Alta frequenza
ISSN
0002-6557
Publication Date
January 1, 1982
Volume
51
Issue
6
Start / End Page
352 / 356
Citation
APA
Chicago
ICMJE
MLA
NLM
Tomasi, C. (1982). TWO SIMPLE ALGORITHMS FOR THE GENERATION OF PARTITIONS OF AN INTEGER. Alta Frequenza, 51(6), 352–356.
Tomasi, C. “TWO SIMPLE ALGORITHMS FOR THE GENERATION OF PARTITIONS OF AN INTEGER.” Alta Frequenza 51, no. 6 (January 1, 1982): 352–56.
Tomasi C. TWO SIMPLE ALGORITHMS FOR THE GENERATION OF PARTITIONS OF AN INTEGER. Alta frequenza. 1982 Jan 1;51(6):352–6.
Tomasi, C. “TWO SIMPLE ALGORITHMS FOR THE GENERATION OF PARTITIONS OF AN INTEGER.” Alta Frequenza, vol. 51, no. 6, Jan. 1982, pp. 352–56.
Tomasi C. TWO SIMPLE ALGORITHMS FOR THE GENERATION OF PARTITIONS OF AN INTEGER. Alta frequenza. 1982 Jan 1;51(6):352–356.
Published In
Alta frequenza
ISSN
0002-6557
Publication Date
January 1, 1982
Volume
51
Issue
6
Start / End Page
352 / 356