![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
On the Maximum Value of the Number of Partitions of n into k Parts
Subscribe/Renew Journal
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.
Subscription
Login to verify subscription
User
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 171
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 1