On a Generalisation of a Lehmer Problem
نویسنده
چکیده
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 = (a1, . . . , ak+1) ∈ U q and
منابع مشابه
On a Generalised Lehmer Problem for Arbitrary Powers
We consider a generalisation of the classical Lehmer problem about the parity distribution of an integer and its modular inverse. We use some known estimates of exponential sums to study a more general question of simultaneous distribution of the residues of any fixed number of negative and positive powers of integers in prescribed arithmetic progressions. In particular, we improve and generali...
متن کاملOn the Lehmer Constant of Finite Cyclic Groups
Results of Lind on Lehmer’s problem include the value of the Lehmer constant of the finite cyclic group Z/nZ, for n ≤ 5 and all odd n. By complementary observations we determine the Lehmer constant of Z/nZ, for all n except for multiples of 420.
متن کاملLehmer’s Problem for Compact Abelian Groups
We formulate Lehmer’s Problem about the Mahler measure of polynomials for general compact abelian groups, introducing a Lehmer constant for each such group. We show that all nontrivial connected compact groups have the same Lehmer constant, and conjecture the value of the Lehmer constant for finite cyclic groups. We also show that if a group has infinitely many connected components then its Leh...
متن کاملALGEBRAIC INDEPENDENCE OF CERTAIN FORMAL POWER SERIES (I)
We give a proof of the generalisation of Mendes-France and Van der Poorten's recent result over an arbitrary field of positive characteristic and then by extending a result of Carlitz, we shall introduce a class of algebraically independent series.
متن کاملAutomated Generalisation of Function Definitions
We address the problem of finding the common generalisation of a set of Haskell function definitions so that each function can be defined by partial application of the generalisation. By analogy with unification, which derives the most general common specialisation of two terms, we aim to infer the least general common generalisation. This problem has a unique solution in a first-order setting,...
متن کامل