Indexed metadata
On existence of generalised Lehmer numbers modulo primes
Bikram Misra, Bidisha Roy, B. Sury
Source abstract
In this article, we discuss a multivariable analogue of Lehmer's parity problem. We generalise the notions of Lehmer numbers as Lehmer -tuples for a fixed odd prime . We count the number of Lehmer -tuples and derive an asymptotic estimate with explicit error terms. This deals with estimating various character sums and Deligne's bound for incomplete exponential sums.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.