Difference between revisions of "Partition"
IntrepidMath (talk | contribs) |
(reworded definition and fixed some typos) |
||
| Line 1: | Line 1: | ||
| − | + | A partition of a number is a way of expressing it as the sum of some number of positive integers. For example, the partitions of 3 are: 3, 2+1, and 1+1+1 (notice how the order of the addends is disregarded). There is no known, simple formula that gives the number of partitions of a number. | |
| − | A | ||
| − | |||
=== Resources === | === Resources === | ||
* [http://www.artofproblemsolving.com/Resources/Papers/LaurendiPartitions.pdf Partitions of Integers by Joseph Laurendi] | * [http://www.artofproblemsolving.com/Resources/Papers/LaurendiPartitions.pdf Partitions of Integers by Joseph Laurendi] | ||
Revision as of 23:21, 19 June 2006
A partition of a number is a way of expressing it as the sum of some number of positive integers. For example, the partitions of 3 are: 3, 2+1, and 1+1+1 (notice how the order of the addends is disregarded). There is no known, simple formula that gives the number of partitions of a number.
