Oscillations of a given size of some arithmetic error terms.

A general method of estimating the number of oscillations of a given size of arithmetic error terms is developed. Special attention is paid to the remainder terms in the prime number formula, in the Dirichlet prime number theorem for primes in arithmetic progressions and to the remainder term in the asymptotic formula for the number of square free divisors of an integer. [ABSTRACT FROM AUTHOR]