New upper bounds for the number of divisors function

From MaRDI portal




Abstract: Let au(n) stand for the number of divisors of the positive integer n. We obtain upper bounds for au(n) in terms of logn and the number of distinct prime factors of n.











This page was built for publication: New upper bounds for the number of divisors function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5126669)