TWO SIMPLE ALGORITHMS FOR THE GENERATION OF PARTITIONS OF AN INTEGER.

Published

Journal Article

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 Authors

Cited Authors

  • Tomasi, C

Published Date

  • January 1, 1982

Published In

Volume / Issue

  • 51 / 6

Start / End Page

  • 352 - 356

International Standard Serial Number (ISSN)

  • 0002-6557

Citation Source

  • Scopus