On the Maximum Value of the Number of Partitions of n into k Parts
Let pk(n) denote the number of partitions of n into exactly k parts. We obviously have
Σ pk(n) = p(n),
where p(n) denotes the number of unrestricted partitions of n, a function introduced by Euler.
- There are currently no refbacks.