Partition function (number theory): Difference between revisions

Revision as of 11:41, 9 April 2004

Revision as of 15:26, 1 July 2004

Line 5:

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''). To see this, 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. Now what is it a list of?