Previous Page 2

Displaying 21 – 30 of 30

Showing per page

On the distribution of the partial sum of Euler's totient function in residue classes

Youness Lamzouri, M. Tip Phaovibul, Alexandru Zaharescu (2011)

Colloquium Mathematicae

We investigate the distribution of Φ ( n ) = 1 + i = 1 φ ( i ) (which counts the number of Farey fractions of order n) in residue classes. While numerical computations suggest that Φ(n) is equidistributed modulo q if q is odd, and is equidistributed modulo the odd residue classes modulo q when q is even, we prove that the set of integers n such that Φ(n) lies in these residue classes has a positive lower density when q = 3,4. We also provide a simple proof, based on the Selberg-Delange method, of a result of T. Dence and...

On the value distribution of a class of arithmetic functions

Werner Georg Nowak (1996)

Commentationes Mathematicae Universitatis Carolinae

This article deals with the value distribution of multiplicative prime-independent arithmetic functions ( α ( n ) ) with α ( n ) = 1 if n is N -free ( N 2 a fixed integer), α ( n ) > 1 else, and α ( 2 n ) . An asymptotic result is established with an error term probably definitive on the basis of the present knowledge about the zeros of the zeta-function. Applications to the enumerative functions of Abelian groups and of semisimple rings of given finite order are discussed.

Oscillations d'un terme d'erreur lié à la fonction totient de Jordan

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

Journal de théorie des nombres de Bordeaux

Let J k ( n ) : = n k p n ( 1 - p - k ) (the k -th Jordan totient function, and for k = 1 the Euler phi function), and consider the associated error term E k ( x ) : = n x J k ( n ) - x k + 1 ( k + 1 ) ζ ( k + 1 ) . When k 2 , both i k : = E k ( x ) x - k and s k : = lim sup E k ( x ) x - k are finite, and we are interested in estimating these quantities. We may consider instead I k : = lim inf n , n d 1 (d)dk ( 12 - { nd} ), since from [AS] i k = I k - ( ζ ( k + 1 ) ) - 1 and from the present paper s k = - i k . We show that I k belongs to an interval of the form 1 2 ζ ( k ) - 1 ( k - 1 ) N k - 1 , 1 2 ζ ( k ) , where N = N ( k ) as k . From a more practical point of view we describe an algorithm capable of yielding arbitrary good approximations of I k . We apply this algorithm...

Currently displaying 21 – 30 of 30

Previous Page 2