Difference between revisions of "Partition"
(added jomlarticle but still needs more content) |
IntrepidMath (talk | contribs) |
||
| Line 1: | Line 1: | ||
| + | |||
| + | A partion of a number is the number of ways to express that integer as a sum of another. For example, the partions of 3 are: 3, {2,1}, and {1,1,1}. There is no simple formula that gives the number of partitions of a number, but many techniques can be found in the article below. | ||
| + | |||
| + | |||
=== 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 22:00, 19 June 2006
A partion of a number is the number of ways to express that integer as a sum of another. For example, the partions of 3 are: 3, {2,1}, and {1,1,1}. There is no simple formula that gives the number of partitions of a number, but many techniques can be found in the article below.
