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
Table of values
Some values of the partition function are as follows:
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
- p(1) = 1
- p(2) = 2
- p(3) = 3
- p(4) = 5
- p(5) = 7
- p(6) = 11
- p(7) = 15
- p(8) = 22
- p(9) = 30
- p(10) = 42
- p(100) = 190569292
- p(1000) = 24061467864032622473692149727991
~ Table of Content ~
| ► | Introduction |
| ► | Intermediate function |
| ► | Generating function |
| ► | Table of values |
| ► | Rademacher's series |
| ► | Congruences |
| ► | References |
| ► | External links |
~ What's Hot ~
Up In The Air, Dear John, The Mummy 4 Rise Of The Aztec, Legion, Avatar, Madagascar 3, My Sister S Keeper, Clash Of The Titans, The Hangover, District 9, Lethal Weapon 5, Sorority Row, Alvin And The Chipmunks The Squeakquel, The Blind Side, The Princess And The Frog, The Karate Kid, The Goods Live Hard Sell Hard, 500 Days Of Summer, New Moon, All About Steve,
~ 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.
