Partitions of an integer

版本 1.21.0.0 (5.6 KB) 作者: John D'Errico
List all partitions of an integer
4.9
(18)
6.1K 次下载
更新时间 2018/3/11

查看许可证

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. 检索时间: .

MATLAB 版本兼容性
创建方式 R14SP1
兼容任何版本
平台兼容性
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/

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.