# Partitions of an integer

バージョン 1.21.0.0 (5.61 KB) 作成者:
List all partitions of an integer
ダウンロード: 6.1K

ライセンスの表示

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.

### 引用

John D'Errico (2024). Partitions of an integer (https://www.mathworks.com/matlabcentral/fileexchange/12009-partitions-of-an-integer), MATLAB Central File Exchange. 取得済み .

すべてのリリースと互換性あり
##### プラットフォームの互換性
Windows macOS Linux
##### 謝辞

ヒントを得たファイル: partitiontable.m

ヒントを与えたファイル: nsumk

### Community Treasure Hunt

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

Start Hunting!

#### partitions/html/

バージョン 公開済み リリース ノート
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.