Tag Archives: divisor function

Bounds for divisor and Euler’s totient function

The divisor function $d(n)$ counts the number of divisors of an integer $n$. It is a multiplicative function and so can be written as\[d(n) = \prod_{p^a || n} (a + 1).\] We will now show that $d(n) \ll_{\varepsilon} n^{\varepsilon}$ for … Continue reading

Posted in Analytic Number Theory, Divisor function, Euler's totient function | Tagged , | Leave a comment