On generalized D. H. Lehmer's problem (Q1309134)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On generalized D. H. Lehmer's problem |
scientific article |
Statements
On generalized D. H. Lehmer's problem (English)
0 references
20 October 1994
0 references
For an odd integer \(q \geq 5\) let \(L(q)\) denote the set of integers \(a\) in the interval \([1,q-1]\) that are coprime with \(q\) and for which \(a + \overline a \equiv 1\) mod 2 holds. Here, \(\overline a\) stands for the solution of the congruence \(ax \equiv 1\) mod \(q\) with \(1 \leq \overline a \leq q-1\). In the present paper the author proves for \(1 \leq N \leq q-1\) the formula \[ \sum _{\substack{ 1 \leq a \leq N\\ a \in L (q)}} 1 = {N \over 2} \cdot {\varphi (q) \over q} + O \Bigl( q^{{1 \over 2}} d(q) \log^ 2q \Bigr), \] where \(d(q)\) is the divisor function. Taking \(N=q-1\), this result answers a question of \textit{Zhang Wenpeng}.
0 references
parity
0 references
Lehmer's problem
0 references
congruence
0 references