On the divisors of
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 . We give asymptotic formulas for the average values and with the Euler function φ(k) on the differences between the components of points of .
Improving on some results of J.-L. Nicolas [15], the elements of the set , for which the partition function (i.e. the number of partitions of with parts in ) is even for all are determined. An asymptotic estimate to the counting function of this set is also given.
We show that is powerfull for integers at most, thus answering a question of P. Ribenboim.