Related topics
Integer partition
In number theory and combinatorics, a partition of a non-negative integern, also called an integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. (If order matters, the sum becomes a composition.) For example, 4 can be partitioned in five distinct ways: 43 + 12 + 22 + 1 + 11 + 1 + 1 + 1The only partition of zero is the empty sum, having no parts.
*As an Amazon Associate I earn from qualifying purchases.