that is, #Uq = φ(q), the Euler function. For n ∈ Uq we use n to denote the modular inverse of n, that is, nn ≡ 1 (mod q), n ∈ Uq. The classical question of D. H. Lehmer (see [9, Problem F12]) about the joint distribution of the parity of n and n has been solved by W. Zhang [19, 20]. Recently this question has been generalised by E. Alkan, F. Stan and A. Zaharescu [1] as follows. Given vector a ...