Integer partition
Definition
Let be a natural number. A partition of is a finite multiset of positive integers whose sum is . Its elements are the parts of the partition.
Equivalently, a partition of is a finite sequence of positive integers with .
Remarks
The order of the parts does not matter. A sum in which the order matters is a composition. The partitions of are , , , and . The number has exactly one partition, the empty partition. The number of partitions of is the partition function , and a Young diagram draws a partition.
Where this leads
5 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Integer_partition, lead section
About this page
| Tag | 0404R9P9J3 |
|---|---|
| URI | m2://0404R9P9J3 |
| Kind | definition |
| Writing | W1 stated |
| MSC | 05A17 |
| Defines | Integer partition |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.