Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

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
Notifications
Font Size


Abstract Views: 213

PDF Views: 1




  • On the Maximum Value of the Number of Partitions of n into k Parts

Abstract Views: 213  |  PDF Views: 1

Authors

Abstract


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.