Partition function (number theory): Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (subpages) |
imported>Richard Pinch (moving References to Bibliography) |
||
Line 12: | Line 12: | ||
:<math> p(n) \sim \frac{\exp\left(\pi\sqrt{2/3}\sqrt n\right)}{4n\sqrt3} .</math> | :<math> p(n) \sim \frac{\exp\left(\pi\sqrt{2/3}\sqrt n\right)}{4n\sqrt3} .</math> | ||
Revision as of 16:32, 13 December 2008
In number theory the partition function p(n) counts the number of partitions of a positive integer n, that is, the number of ways of expressing n as a sum of positive integers (where order is not significant).
Thus p(3) = 3, since the number 3 has 3 partitions:
- 3
- 2+1
- 1+1+1
Properties
The partition function satisfies an asymptotic relation