Integer partitions

Finds all partitions of a set containing homogenous elements, also called integer partitions.
494 descargas
Actualizado 2 dic 2013

Ver licencia

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

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}

Citar como

Hin Kwan Wong (2024). Integer partitions (, MATLAB Central File Exchange. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R2010b
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Versión Publicado Notas de la versión

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

corrected description