Abstract
Let $\tau(n)$ stand for the number of divisors of the positive integer $n$. We obtain upper bounds for $\tau(n)$ in terms of $\log n$ and the number of distinct prime factors of $n$.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have