Content deleted Content added
PierreAbbat (talk | contribs) m gr,sp |
It is non-multiplicative+ME |
||
Line 1:
''The partition function described here is part of [[number theory]].
The partition [[function]] p(''n'') is a [[multiplicative function|non-multiplicative function]] and represents the [[number]] of possible [[partition]]s 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.
1. smallest [[addend]] is ''k''
2. smallest addend is [[strictly greater than]] than ''k''
The number of partitions meeting the first condition is p(''k'',''n''-''k''). If the reason for this is not immediately apparent, imagine a list of all the partitions of the number ''n''-''k'' into numbers of size at least ''k'', then imagine appending "+''k''" to each partition in the list.
The number of partitions meeting the second condition is p(''k''+1,''n'').
Since the two conditions are [[mutually exclusive]], the number of partitions meeting either condition is p(''k''+1,''n'')+p(''k'',''n''-''k'').
* p(''k'',''n'') = 0 if ''k'' > ''n''
* p(''k'',''n'') = 1 if ''k'' = ''n''
This function will mess with one's [[mind]] if one lets it.
:p(1,4)=5
:p(2,8)=7
:p(3,12)=9
:p(4,16)=11
:p(5,20)=13
:p(6,24)='''16'''
|