- Research
- Open Access
- Published:
Character sums over generalized Lehmer numbers
Journal of Inequalities and Applications volume 2016, Article number: 270 (2016)
Abstract
Let \(q>2\) be an integer, \(n\geqslant2\) be a fixed integer with \((n,q)=1\), ψ be a non-principal Dirichlet character modq. An upper bound estimate for character sums of the form
is given, where \(\mathcal{C}(1,q)=\{a \mid 1\leqslant a\leqslant q-1, a\overline{a}\equiv1 (\bmod q), n\nmid(a+\overline{a})\}\).
1 Introduction
Let q be an odd integer, c be a fixed positive integer with \((c,q)=1\). For each integer a with \(1\leqslant a\leqslant q-1\) and \((a,q)=1\), it is clear that there exists one and only one integer b with \(1\leqslant b\leqslant q-1\) such that \(ab\equiv c (\bmod q)\). If a and b are of opposite parity, then a is called a Lehmer number. Let \(\mathcal{A}(c,q)\) denote the set of all Lehmer numbers, and \(r(c,q)\) the number of \(\mathcal{A}(c,q)\). Lehmer [1] posed the problem of finding \(r(1,q)\).
Before proceeding we need to recall that the notations \(U = O(V)\) and \(U \ll V\) are equivalent to \(\vert U\vert \le c V\) for some constant \(c>0\). We write \(\ll_{\rho}\) and \(O_{\rho}\) to indicate that this constant may depend on the parameter ρ. \(\sum^{'}\) means summing over reduced residue classes, a̅ denotes the multiplicative inverse of a modulo q and for a real x we denote \(e(x)=e^{2\pi i x}\), \(\{x\}\) the fractal part of x, and \(\langle x\rangle=\min\{\{x\},1-\{x\}\}\).
In 1993, Zhang [2] proved that
where p, l are two distinct odd primes, α is a positive integer, and \(\phi(q)\) is the Euler function. For arbitrary odd integer \(q\ge3\), he [3] soon obtained
where \(d(q)\) is the classical divisor function.
Later, Lu and Yi [4] generalized this problem to incomplete intervals. In fact, let \(q\ge3\) be an integer, \(n\geqslant2\) and c be two fixed integers with \((n,q)=(c,q)=1\), \(0<\delta_{1},\delta _{2}\leqslant1\), they defined
and got an asymptotic formula as follows:
Recently, interesting connections between Lehmer numbers and character sums were investigated by some scholars. For example, for an odd prime p, and a fixed prime w less than p, let
Then, for any non-principal Dirichlet character \(\chi \bmod w\), Ma, Zhang and Zhang [5] got an upper bound estimate of character sums over \(\mathcal{B}(w,p)\) as
At almost the same time, Han and Zhang [6] obtained an upper bound estimate of the character sums over Lehmer numbers as
where χ is an arbitrary non-principal character modulo an odd prime p.
The results of character sums over other special numbers or polynomials can also be found in [7] and [8]. For more properties of character sums and their various applications, see [9, 10] and the references therein.
It seems that (1.1) cannot be extended to arbitrary integer q by their methods in [6]. However, relying on the methods in [4], we can overcome the obstacles.
Let \(q\ge3\) be an integer, \(n\geqslant2\) be a fixed integer with \((n,q)=1\), ψ be a non-principal Dirichlet character modulo q. If \(n\nmid (a+\overline{a})\), then a is called a generalized Lehmer number. Denote the set of all generalized Lehmer numbers by
Following the same technique as in [4], we obtain the following.
Theorem
Let \(q\ge3\) be an integer, \(n\geqslant2\) be a fixed integer with \((n,q)=1\), ψ be a non-principal Dirichlet character \(\bmod\ q\). Then we have the upper bound estimate
Let \(q\ge3\) be an odd integer, \(n=2\) in the theorem, we may immediately obtain the following.
Corollary 1
Let ψ be a non-principal Dirichlet character modulo q. Then we have
Let q be an odd prime p, \(n=2\) in Corollary 1, then (1.1) can be deduced directly as follows.
Corollary 2
Let ψ be a non-principal Dirichlet character modulo p. Then we have
2 Some lemmas
To prove the theorem, we need the following several lemmas. First we need an upper bound estimate of the general Kloosterman sum \(S(m,n,\chi;q)\) as follows.
Lemma 1
Let q be a positive integer and χ a Dirichlet character \(\bmod\ q\). Then for any integers m and n, we have
where \(S(m,n,\chi;q)\) is defined by
Proof
See Lemma 1 of [7]. □
Lemma 2
Let q be a positive integer, \(\chi_{0}\) be the principal Dirichlet character \(\bmod\ q\), ψ be a non-principal character modq, \(r_{1}\), \(r_{2}\) be integers with \(1\leqslant r_{1}, r_{2}\leqslant q-1\). Then we have
Proof
By Lemma 2 of Chapter 1.2 in [11], we have
where we have used the fact \(\phi(q)/\phi(t)\leqslant q/t\) if \(t \mid q\).
Note that ψ is a non-principal character \(\bmod\ q\), we only need to consider the following cases.
If \((r_{1},q)=1\), we have
If \((r_{1},q)>1\), and ψ is a primitive character \(\bmod\ q\), we have
If \((r_{1},q)>1\), and ψ is a non-primitive character \(\bmod\ q\), then Lemma 5 of Chapter 1.2 in [11] indicates that there exists one and only one \(q^{\ast} \) such that \(q^{\ast} \mid q\), with \(\chi^{\ast}\) the primitive character \(\bmod\ q^{\ast}\) corresponding χ. Thus
Combining the above, we have
□
Lemma 3
Let \(q\ge3\) be an integer, χ, ψ be Dirichlet characters modq such that \(\psi\neq\chi_{0}\) and \(\psi\overline{\psi}=\chi_{0}\). Then we have the estimate
Proof
Combining Lemmas 1 and 2, we have
□
Lemma 4
Let \(0<\rho\leqslant\frac{1}{2}\), \(x_{0},x_{1},\ldots, x_{k}\) be a sequence of real numbers such that
and \(\langle x_{0}\rangle =\min \{\langle x_{1}\rangle , \ldots, \langle x_{k}\rangle \}\). Then we have
Proof
See Lemma 2 of Chapter 5.1 in [11]. □
Lemma 5
Let \(q\ge3\) be an integer, ψ be a character \(\bmod \ q\), \(n\geqslant2\) be a fixed integer with \((n,q)=1\), l be an integer with \(1\leqslant l\leqslant n\). Then we have
Proof
The relations
imply that
And also
Thus
where \(f(l,r,n,q)=1-e ( (\frac{l}{n}-\frac{r}{q} )q )\).
Apply the upper bound
we have
Now write \(\frac{k}{q/d}=\frac{h_{0}}{q_{0}}\), where \(q_{0}\geqslant 1\), \((h_{0},q_{0})=1\), we have \(\frac{q}{kd}=\frac{q_{0}}{h_{0}}\leqslant q_{0}\leqslant \frac{q}{d}\). Then Lemma 4 implies
So we get
Thus
□
3 Proof of the theorem
In this section, we shall complete the proof of the theorem.
Proof of the theorem
From the orthogonality relation for Dirichlet characters \(\bmod\ q\) and the trigonometric sum identity, we can get
First of all, we shall estimate \(E_{1}\). Making use of Lemma 3, we get
Similar to (2.1), we have
Then
Second, we estimate \(E_{2}\). By Lemma 5, we have
In the same way we can get the estimate
References
Guy, RK: Unsolved Problems in Number Theory, pp. 139-141. Springer, New York (1981)
Zhang, WP: On a problem of D. H. Lehmer and its generalization. Compos. Math. 86(3), 307-316 (1993)
Zhang, WP: On a problem of D. H. Lehmer and its generalization (II). Compos. Math. 91(1), 47-56 (1994)
Lu, YM, Yi, Y: On the generalization of the D.H. Lehmer problem. Acta Math. Sin. (Engl. Ser.) 25(8), 1269-1274 (2009)
Ma, R, Zhang, YL, Zhang, GH: On a kind of Dirichlet character. Abstr. Appl. Anal. 2013, Article ID 750964 (2013)
Han, D, Zhang, WP: Upper bound estimate of character sums over Lehmer’s number. J. Inequal. Appl. 2013, 392 (2013)
Xi, P, Yi, Y: On character sums over flat numbers. J. Number Theory 130(5), 1234-1240 (2010)
Ren, GL, He, DD, Zhang, TP: On certain character sums. Quaest. Math. (to appear)
Alkan, M, Simsek, Y: Generating function for q-Eulerian polynomials and their decomposition and applications. Fixed Point Theory Appl. 2013, 72 (2013)
Shparlinski, IE: Open problems on exponential and character sums. In: Ser. Number Theory Appl., vol. 6, pp. 222-242. World Scientific, Hackensack, NJ (2010)
Pan, CD, Pan, CB: Goldbach Conjecture. Science Press, Beijing (1981)
Acknowledgements
This work is supported by the National Natural Science Foundation of China (No. 11201275), the Natural Science Foundation of Shaanxi Province of China (No. 2016JM1017), the Scientific Research Program Funded by Shaanxi Provincial Education Department (No. 16JK1373) and the Fundamental Research Funds for the Central Universities (No. GK201503014). The authors want to express their great thanks to the anonymous referee for his/her helpful comments and suggestions. The first and the fourth authors also gratefully acknowledge the support, hospitality, and excellent conditions of the School of Computer Science and Engineering, School of Mathematics and Statistics of UNSW during their visits.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
HC and ZZQ drafted the manuscript. YKM and TPZ participated in its design and coordination and helped to draft the manuscript. All authors read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Ma, Y., Chen, H., Qin, Z. et al. Character sums over generalized Lehmer numbers. J Inequal Appl 2016, 270 (2016). https://doi.org/10.1186/s13660-016-1213-y
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13660-016-1213-y
MSC
- 11L05
- 11L40
- 11N37
Keywords
- Lehmer number
- character sums
- Kloosterman sums
- upper bound estimate