Displaying 261 – 280 of 709

Showing per page

On an estimate of Walfisz and Saltykov for an error term related to the Euler function

Y.-F. S. Pétermann (1998)

Journal de théorie des nombres de Bordeaux

The technique developed by A. Walfisz in order to prove (in 1962) the estimate H ( x ) ( log x ) 2 / 3 ( log log x ) 4 / 3 for the error term H ( x ) = n x φ ( n ) n - 6 π 2 x related to the Euler function is extended. Moreover, the argument is simplified by exploiting works of A.I. Saltykov and of A.A. Karatsuba. It is noted in passing that the proof proposed by Saltykov in 1960 of H ( x ) ( log x ) 2 / 3 ( log log x ) 1 + ϵ is erroneous and once corrected “only” yields Walfisz’ result. The generalizations obtained can be applied to error terms related to various classical - and less classical - arithmetical...

On certain arithmetic functions involving the greatest common divisor

Ekkehard Krätzel, Werner Nowak, László Tóth (2012)

Open Mathematics

The paper deals with asymptotics for a class of arithmetic functions which describe the value distribution of the greatest-common-divisor function. Typically, they are generated by a Dirichlet series whose analytic behavior is determined by the factor ζ2(s)ζ(2s − 1). Furthermore, multivariate generalizations are considered.

On differences of two squares

Manfred Kühleitner, Werner Nowak (2006)

Open Mathematics

The arithmetic function ρ(n) counts the number of ways to write a positive integer n as a difference of two squares. Its average size is described by the Dirichlet summatory function Σn≤x ρ(n), and in particular by the error term R(x) in the corresponding asymptotics. This article provides a sharp lower bound as well as two mean-square results for R(x), which illustrates the close connection between ρ(n) and the number-of-divisors function d(n).

Currently displaying 261 – 280 of 709