Partitions of an integer

List all partitions of an integer

Version 1.21.0.0 (5,61 ko)
6,2K téléchargements
(18)
11 mars 2018

Vous suivez désormais cette soumission

The money changing problem is a simple one to state. For example, how many different ways can one form change of a dollar (100 cents) by using only coins of denomination [1 5 10 25 50] ? (The answer is 292.)
Its an example of a general problem, i.e., in how many unique ways can an integer be partitioned as a sum of smaller positive integers?
http://en.wikipedia.org/wiki/Integer_partition
I wrote partitions to solve the fully general problem, but it can be used with restrictions too. You can constrain the set of elements in the sum, and the maximum number of times any one elements can appear, as well as fixing the total number of terms that will appear in the final sum.
See the demo for a few examples of use.

Citation pour cette source

John D'Errico (2026). Partitions of an integer (https://fr.mathworks.com/matlabcentral/fileexchange/12009-partitions-of-an-integer), MATLAB Central File Exchange. Extrait(e) le .

Remerciements

Inspiré par : partitiontable.m

A inspiré : nsumk

Catégories

En savoir plus sur Functions Supported for Code Acceleration dans Help Center et MATLAB Answers

Informations générales

Compatibilité avec les versions de MATLAB

  • Compatible avec toutes les versions

Plateformes compatibles

  • Windows
  • macOS
  • Linux
Ouvrir dans un nouvel onglet
Version Publié le Notes de version
1.21.0.0

Comment change
1.2.0.0

Fix the plist=partitions(10,[1:5],[1],[4]) bug.
1.0.0.0

Added a new option: a user defined number of terms in the sum.