Displaying 301 – 320 of 498

Showing per page

On the distribution of the Euler function of shifted smooth numbers

Stefanie S. Loiperdinger, Igor E. Shparlinski (2010)

Colloquium Mathematicae

We give asymptotic formulas for some average values of the Euler function on shifted smooth numbers. The result is based on various estimates on the distribution of smooth numbers in arithmetic progressions which are due to A. Granville and É. Fouvry & G. Tenenbaum.

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 divisor function over Piatetski-Shapiro sequences

Hui Wang, Yu Zhang (2023)

Czechoslovak Mathematical Journal

Let [ x ] be an integer part of x and d ( n ) be the number of positive divisor of n . Inspired by some results of M. Jutila (1987), we prove that for 1 < c < 6 5 , n x d ( [ n c ] ) = c x log x + ( 2 γ - c ) x + O x log x , where γ is the Euler constant and [ n c ] is the Piatetski-Shapiro sequence. This gives an improvement upon the classical result of this problem.

On the error term of the logarithm of the lcm of a quadratic sequence

Juanjo Rué, Paulius Šarka, Ana Zumalacárregui (2013)

Journal de Théorie des Nombres de Bordeaux

We study the logarithm of the least common multiple of the sequence of integers given by 1 2 + 1 , 2 2 + 1 , , n 2 + 1 . Using a result of Homma [5] on the distribution of roots of quadratic polynomials modulo primes we calculate the error term for the asymptotics obtained by Cilleruelo [3].

On the Euler Function on Differences Between the Coordinates of Points on Modular Hyperbolas

Igor E. Shparlinski (2008)

Bulletin of the Polish Academy of Sciences. Mathematics

For a prime p > 2, an integer a with gcd(a,p) = 1 and real 1 ≤ X,Y < p, we consider the set of points on the modular hyperbola a , p ( X , Y ) = ( x , y ) : x y a ( m o d p ) , 1 x X , 1 y Y . We give asymptotic formulas for the average values ( x , y ) a , p ( X , Y ) x y * φ ( | x - y | ) / | x - y | and ( x , y ) a , p ( X , X ) x y * φ ( | x - y | ) with the Euler function φ(k) on the differences between the components of points of a , p ( X , Y ) .

Currently displaying 301 – 320 of 498