ABSTRACT
In the previous chapter we met with a few of the more wellknown arithmetic functions. As can be seen most of these are poorly behaved at first glance. For example, the divisor function, d(n), takes the value 2 infinitely often since there are infinitely many primes, and since d(pa ) = a + 1, when p is a prime, we see that it can be as large as we like infinitely often. It turns out that if we consider d(n) on the average, then its values get smoothed out into a move tractable form.
