On the first sign change in Mertens' theorem
The function is known to change sign infinitely often, but so far all calculated values are positive. In this paper we prove that the first sign change occurs well before exp(495.702833165).
The function is known to change sign infinitely often, but so far all calculated values are positive. In this paper we prove that the first sign change occurs well before exp(495.702833165).
As promised in the first paper of this series (Ann. Inst. Fourier, 26-4 (1976), 115-131), these two articles deal with the asymptotic distribution of the fractional parts of where is an arithmetical function (namely , , ) and is an integer (or a prime order) running over the interval . The results obtained are rather sharp, although one can improve on some of them at the cost of increased technicality. Number-theoretic applications will be given later on.
There exist infinitely many integers such that the greatest prime factor of is at least . The proof is a combination of Hooley’s method – for reducing the problem to the evaluation of Kloosterman sums – and the majorization of Kloosterman sums on average due to the authors.