On a Generalisation of a Lehmer Problem
Igor Shparlinski
Abstract
We consider a generalisation of the classical Lehmer problem about the distribution of modular inverses in arithmetic progression, introduced by E. Alkan, F. Stan and A. Zaharescu. Using bounds of sums of multiplicative characters instead of traditionally applied to this kind of problem Kloosterman sums, we improve their results in several directions.
Create a lesson
Related papers
Value distribution of multiplicative functions along linear fractional sequences
Sun-Kai Leung
Delta theory of Anderson Modules II: Hodge-Pink structure
Sudip Pandit, Arnab Saha
Integers divisible by a shifted prime in a given interval
Rebecca Abi Abdallah, Valeriya Kovaleva, Jeremy Schlitt et al.
On Piatetski-Shapiro primes from almost primes
Yuhua Zhao, Jinjiang Li, Linji Long et al.
On Consecutive Non-primitive Elements over Finite Fields
Bidushi Sharma, Dhiren Kumar Basnet
Birch's theorem over function fields with quadratically many variables
Matthew Hase-Liu