New upper bounds for the number of divisors function

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$.