On two sums related to the Lehmer problem over short intervals

<abstract><p>In this article, we study sums related to the Lehmer problem over short intervals, and give two asymptotic formulae for them. The original Lehmer problem is to count the numbers coprime to a prime such that the number and the its number theoretical inverse are in different parities in some intervals. The numbers which satisfy these conditions are called Lehmer numbers. It prompts a series of investigations, such as the investigation of the error term in the asymptotic formula. Many scholars investigate the generalized Lehmer problems and get a lot of results. We follow the trend of these investigations and generalize the Lehmer problem.</p></abstract>

On the Generalization of Lehmer Problem and High-Dimension Kloosterman Sums

For any fixed integerk≥2and integerrwithr, p=1, it is clear that there existkintegers1≤ai≤p-1 i=1, 2, …, ksuch thata1a2⋯ak≡r mod p. LetN(k,r;p)denote the number of alla1, a2, ⋯aksuch thata1a2⋯ak≡r mod pand 2†a1+a2+⋯ + ak. In this paper, we will use the analytic method and the estimate for high-dimension Kloosterman sums to study the asymptotic properties ofN(k,r;p)and give two interesting asymptotic formulae for it.

High-Dimensional D. H. Lehmer Problem over Quarter Intervals

The high-dimensional D. H. Lehmer problem over quarter intervals is studied. By using the properties of character sum and the estimates of DirichletL-function, the previous result is improved to be the best possible in the case ofq = p, an odd prime withp≡1(mod 4), which is shown by studying the mean square value of the error term.

GENERALIZED D. H. LEHMER PROBLEM OVER SHORT INTERVALS

Let n ≥ 2 be a fixed positive integer, q ≥ 3 and c, ℓ be integers with (nc, q)=1 and ℓ|n. Suppose and consist of consecutive integers which are coprime to q. We define the cardinality of a set: The main purpose of this paper is to use the estimates of Gauss sums and Kloosterman sums to study the asymptotic properties of N(, , c, n, ℓ; q), and to give an interesting asymptotic formula for it.