Partition function (number theory): Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
m (wrong template)
imported>Richard Pinch
(subpages)
Line 1: Line 1:
{{subpages}}
In [[number theory]] the '''partition function''' ''p''(''n'') counts the number of [[partition]]s 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).
In [[number theory]] the '''partition function''' ''p''(''n'') counts the number of [[partition]]s 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).



Revision as of 16:25, 13 December 2008

This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

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

References