Search

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]

AbstractThe main aim of this paper is to present a general method of proving ?-estimates for a class of arithmetic error terms. We assume that error terms in question are boundary values of harmonic functions on the upper half-plane satisfying certain subsidiary conditions. We prove a general theorem for an axiomatically defined class of such functions and then we show how this result can be used to give statements in concrete situations. As examples we treat the classical case of the remainder term in the prime number formula obtaining a new proof of the well-known result of J. E. Littlewood, and the case of the remainder term in the asymptotic formula for the summatory function of the square-free divisor function. In the latter case our result is new. [ABSTRACT FROM AUTHOR]