![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)
A Formula in Partitions
Subscribe/Renew Journal
In what follows, Pm(n) denotes the number of those partitions of n in which the smallest element is m; pm(n) the number of those in which m is the largest element, i.e. the number of partitions of n into exactly m non-zero parts; and p(n) denotes the number of unrestricted partitions of n.
Subscription
Login to verify subscription
User
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 192
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0