![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)
An Asymptotic Formula in Partitions
Subscribe/Renew Journal
In what follows, p(n, m) denotes the number oi partitions of n into exactly m non-zero summands and p0(n) 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: 195
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0