Displaying 221 – 240 of 484

Showing per page

On a sequence formed by iterating a divisor operator

Bellaouar Djamel, Boudaoud Abdelmadjid, Özen Özer (2019)

Czechoslovak Mathematical Journal

Let be the set of positive integers and let s . We denote by d s the arithmetic function given by d s ( n ) = ( d ( n ) ) s , where d ( n ) is the number of positive divisors of n . Moreover, for every , m we denote by δ s , , m ( n ) the sequence d s ( d s ( ... d s ( d s ( n ) + ) + ... ) + ) m -times = d s ( n ) for m = 1 , d s ( d s ( n ) + ) for m = 2 , d s ( d s ( d s ( n ) + ) + ) for m = 3 , We present classical and nonclassical notes on the sequence ( δ s , , m ( n ) ) m 1 , where , n , s are understood as parameters.

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.

Currently displaying 221 – 240 of 484