![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 Number of Factorizations of an Integer
Subscribe/Renew Journal
Let f (n) denote the number of unordered factorizations of a positive integer n into factors larger than 1. We show that the number of distinct values of f (n), less than or equal to x, is at most exp (C √log x / loglog x (1+o(1))), where C = 2π √ 2/3 and x is sufficiently large. This improves upon a previous result of the first author and F. Luca.
User
Subscription
Login to verify subscription
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