Open Access
Subscription Access
Open 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
Font Size
Information
Abstract Views: 213
PDF Views: 1