Partition function (number theory)
In number theory, the partition function p(n) represents the number of possible partitions of a natural number n, which is to say the number of distinct (and order independent) ways of representing n as a sum of natural numbers. For example, 4 can be partitioned in 5 distinct ways
Related Topics:
Number theory - Number - Partitions - Natural number - Sum
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
:4, 3 + 1, 2 + 2, 2 + 1 + 1, 1 + 1 + 1 + 1
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
So p(4) = 5. By convention p(0) = 1, p(n) = 0 for n negative. Partitions can be graphically visualized with Young diagrams. They occur in a number of branches of mathematics and physics, including the study of symmetric polynomials, the symmetric group and in group representation theory in general.
Related Topics:
Young diagram - Mathematics - Physics - Symmetric polynomial - Symmetric group - Group representation theory
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
~ Table of Content ~
| ► | Introduction |
| ► | Intermediate function |
| ► | Generating function |
| ► | Table of values |
| ► | Rademacher's series |
| ► | Congruences |
| ► | References |
| ► | External links |
~ What's Hot ~
~ Community ~
| ► | History Forum Come and discuss about History, Civilizations, Historical Events and Figures |
| ► | History Web-Ring A community of sites, blogs and forums dedicated to History. Do not hesitate to submit your site. |
and are licensed under the GNU Free Documentation License.
Lexicon - Privacy Policy - Spiritus-Temporis.com ©2005.