File Exchange

image thumbnail

Integer partitions

version 1.3 (1.74 KB) by

Finds all partitions of a set containing homogenous elements, also called integer partitions.

4 Downloads

Updated

View License

This is similar to submission "24185-partitions" in the exchange, but with the set containing identical elements. The partitioning is a also a way of writing the input n as a sum of positive integers.

An optional argument s can be supplied to output a subset of partitions with number of parts less than or equal to s.

The number of ways of partitioning is according to the sequence
http://oeis.org/A000041

Example 1: intpartition(4) gives {[1 1 1 1],[1 1 2],[1 3],[2 2],4}
Example 2: intpartition(10,2) gives {[3,7],[4,6],[5,5],10}

Comments and Ratings (0)

Updates

1.3

--Added optional parameter s to specify maximum size of the partitions.
--Updated to more efficient code (~5x speed), as an unintended consequence, the ordering of partitions in the output cell is changed from the older version.

1.1

corrected description

MATLAB Release
MATLAB 7.11 (R2010b)

Download apps, toolboxes, and other File Exchange content using Add-On Explorer in MATLAB.

» Watch video