- Research
- Open access
- Published:
One kind of character sum modulo a prime p and its recurrence formula
Advances in Difference Equations volume 2019, Article number: 133 (2019)
Abstract
The aim of this paper is to use an analytic method and the properties of the classical Gauss sums to research the computational problem of one kind of character sum of polynomials modulo an odd prime p and obtain several meaningful third- and fourth-order linear recurrence formulae for them.
1 Introduction
Let \(q\ge 3\) be an integer, and let χ be a nonprincipal character \(\bmod \ q\). Then for any integral coefficient polynomial \(f(x)\), we define the character sum of the polynomial as
This sum plays an extremely significant role in analytic number theory, so they have aroused the interest and favor of a great deal of number theorists. A lot of works connected with \(N(\chi , f; q)\) can be found in [1,2,3,4,5,6,7,8,9] and [10,11,12]. In fact, the sums \(N(\chi , f; q)\) are a particular case of the general character sums of the polynomials
where M and N are any positive integers. If \(q=p\) is an odd prime, then Weil (see [2] and [6]) obtained following significant conclusion:
Suppose that χ is a qth-order character \(\bmod \ p\) and \(f(x)\) is not a perfect qth power \(\bmod \ p\). Then we have the estimate
where the constant in “≪” depends only on the degree of \(f(x)\). The estimate in (1) is the best possible.
Now for any odd prime p and any nonprincipal character \(\chi \bmod\ p\), we consider the following problem: for any positive integers k and h, let
and
We inquire if there exists an accurate computational formula for \(N_{k}(h, \chi ; p)\)?
About this contents, from our personal perspective, it appears that none had researched it yet; at least so far, we have not seen any related results before. The problem is meaningful, since it can help scholars to find out more exact information of the character sums.
In our paper, applying analytic methods and the properties of the classical Gauss sums, we researched the problem of calculating \(N_{k}(h, \chi ; p)\) and obtained a significant linear recurrence formula for it. We will prove the following:
Theorem 1
Let p be an odd prime, let h be a positive integer, and let χ be any Dirichlet character \(\bmod\ p\) such that \(\chi ^{h}\neq \chi _{0}\), the principal character \(\bmod\ p\). Then for any positive integer k, we obtain the identity
Theorem 2
Let p be an odd prime with \(p\equiv 1\bmod\ 3\), and let χ be any third-order character \(\bmod\ p\). Then we have the identities
and
for all integers \(k\geq 4\), where d is uniquely determined by \(4p=d^{2}+27b^{2}\) and \(d\equiv 1\bmod\ 3\).
Theorem 3
Let \(p=8h+5\) be a prime, and let χ be any fourth-order character \(\bmod\ p\). Then we have the identities
and
for all \(k\geq 0\), where \(N_{0}(4, \chi ; p)=0\), \(\alpha = \sum_{a=1}^{\frac{p-1}{2}} (\frac{a+\overline{a}}{p} )\), \((\frac{*}{p} )\) denotes the Legendre symbol \(\bmod\ p\), and \(a\overline{a}\equiv 1\bmod\ p\).
Theorem 4
Let \(p=8h+1\) be a prime, and let χ be a fourth-order character \(\bmod\ p\). Then we have the identities
and
for all integers \(k\geq 0\), where \(N_{0}(4, \chi ; p)=0\).
From the methods of proving the theorems, we can also infer the following:
Corollary 1
Let p be a prime with \(p\equiv 1\bmod\ 3\), and let χ be a third-order character \(\bmod\ p\). Then for any integer \(k\geq 0\), we have the identity
Corollary 2
Let \(p=4k+1\) be an odd prime, and let χ be a fourth-order character \(\bmod\ p\). Then we have the identity
Corollary 3
Let \(p=4k+1\) be an odd prime, and let χ be a fourth-order character \(\bmod\ p\). Then we have the identity
Corollary 4
Let \(p=8k+5\) be an odd prime, and let χ be a fourth-order character \(\bmod\ p\). Then we have the identity
Corollary 5
Let \(p=8k+1\) be an odd prime, and let χ be a fourth-order character \(\bmod\ p\). Then we have the identity
2 Several lemmas
In this section, we give several lemmas, which are essential in the proofs of our theorems. Hereinafter, we are going to use some properties of the classical Gauss sums, which can be found in some analytic number theory books, such as [13]; so we will not repeat them here. For convenience, first, we give the definition of the classical Gauss sums \(\tau (\chi )\) as follows: for any integer \(q>1\), let χ be any Dirichlet character \(\bmod\ q\). Then the famous Gauss sum \(\tau ( \chi )\) is defined as
where \(e(y)=e^{2\pi iy}\). With this mark, we have the following:
Lemma 1
Given p be an odd prime with \(p\equiv 1 \bmod\ 3\), and let ψ be any third-order character \(\bmod \ p\). Then we have the identity
where d is uniquely determined by \(4p=d^{2}+27b^{2}\) and \(d\equiv 1 \bmod\ 3\).
Proof
See Lemma 3 of [9] or references [14] and [10]. □
Lemma 2
Given p be an odd prime with \(p\equiv 1\bmod\ 3\), and for any integer b with \((b, p)=1\), let \(U(b, p)=\sum_{a=0}^{p-1}e (\frac{ba^{3}}{p} )\). Then we have the identity
where d is the same as in Lemma 1.
Proof
Let χ be any third-order character \(\bmod\ p\). Then \(\chi ^{2}=\overline{\chi }\), and from Lemma 1 and the properties of Gauss sums we have
Note that \(\chi ^{3}=\chi _{0}\) and \(\tau (\chi )\tau (\overline{ \chi } )=p\), so from (2) we immediately infer that
This proves Lemma 2. □
Lemma 3
Given p be an odd prime with \(p\equiv 1\bmod\ 4\), and let ψ be any fourth-order character \(\bmod\ p\). Then we have the identity
where \(\alpha = \sum_{a=1}^{\frac{p-1}{2}} (\frac{a+\overline{a}}{p} )\), \((\frac{*}{p} )\) denotes the Legendre symbol \(\bmod\ p\), and a̅ denotes the multiplicative inverse of \(a\bmod\ p\), that is, \(a\overline{a}\equiv 1\bmod\ p\).
Proof
In fact, this is Lemma 2.2 in [15]. Therefore we omit its proof. □
Lemma 4
Let p be an odd prime with \(p\equiv 1\bmod\ 4\), and for any integer b with \((b, p)=1\), let \(A(b, p)=\sum_{a=0}^{p-1}e (\frac{ba^{4}}{p} )\). Then we have the identities
where \(C(p)=-3\) if \(p=8k+5\) and \(C(p)=1\) if \(p=8k+1\).
Proof
Let ψ be a fourth-order character \(\bmod\ p\). Then \(\psi ^{2}=\chi _{2}\) (the Legendre symbol \(\bmod\ p\)), and by the properties of Gauss sums we get
Note that \(\psi ^{2}=\overline{\psi }^{2}=\chi _{2}\), \(\tau (\psi ) \tau (\overline{\psi } )=\psi (-1)\tau (\psi )\overline{ \tau (\psi )}=\psi (-1)p\), and \(\tau (\chi _{2})= \sqrt{p}\). Combining (3) and Lemma 2, we have
where \(C(p)=-3\) if \(p=8k+5\) and \(C(p)=1\) if \(p=8k+1\).
Now, according to (4), we have
Applying (5), we immediately deduce that
This proves Lemma 4. □
Lemma 5
Let p be an odd prime with \(p\equiv 1\bmod\ 3\), and let χ be any third-order character \(\bmod\ p\). Then we have the identities
and
for all integers \(k\geq 4\), where d is the same as in Lemma 1.
Proof
It is obvious that \(M_{1}(3,\chi ; p)=p-1\). According to (2) and the properties of Gauss sums, we get
For any integer \(k\geq 4\), according to Lemma 1, we have
Now Lemma 5 follows from (6), (7), and (8). □
Lemma 6
Let \(p=8h+5\) be a prime, and let χ be any fourth-order character \(\bmod\ p\). Then we have the identities
For every integer \(k\geq 0\), we obtain the fourth-order linear recurrence formula
where \(M_{0}(4, \chi ; p)=0\), and α is the same as in Lemma 3.
Proof
Let p be an odd prime with \(p=8h+5\), and let χ be any fourth-order character \(\bmod\ p\). Then this time we obtain \(C(p)=-3\). For any integer \(k\geq 0\), according to the properties of Gauss sums and Lemma 4, we get
where \(M_{0}(4, \chi ; p)=0\).
Suppose that χ is a fourth-order character \(\bmod \ p\). Then we get
Note that \(\overline{\chi }(b) (\frac{b}{p} )=\chi (b)\), so from (4) and (3) we get
In the same way, applying (3) and the orthogonality of the characters \(\bmod \ p\), we also have
Combining (9)–(12), we immediately obtain Lemma 6. □
Lemma 7
Let \(p=8h+1\) be a prime, and let χ be any fourth-order character \(\bmod\ p\). Then we have the identities
For every integer \(k\geq 0\), we have the fourth-order linear recurrence formula
Proof
If \(p=8h+1\), then from Lemma 4 we have
It is not complicated to prove that
Note that \(\overline{\chi }(b) (\frac{b}{p} )=\chi (b)\), \(\tau (\chi )\tau (\overline{\chi })=p\). By the method of proving (11) we have
Similarly, combined with the method of proving (12), we also get
3 Proofs of the theorems
In this section, we complete the proofs of our theorems. First of all, we prove Theorem 1 by mathematical induction. If \(k=1\), then note that \(\chi ^{h}\neq \chi _{0}\). According to the properties of character sums \(\bmod\ p\), we obtain the identity
Suppose that the conclusion holds for an integer \(k= m\geq 1\), that is,
Then for \(k=m+1\), combining (17) and (18) with the properties of the complete residue system \(\bmod\ p\), we have
Thus the conclusion is also correct for \(k=m+1\). This proves Theorem 1.
Now, we are going to prove Theorem 2. From Lemmas 1 and 5, noting that by definition \(N_{k}(h, \chi ; p)=M_{k}(h, \chi ; p)+M_{k}(h, \overline{ \chi }; p)\), we get
and
for all integers \(k\geq 4\). This proves Theorem 2.
Suppose that p is an odd prime with \(p=8h+5\) and that χ is a fourth-order character \(\bmod\ p\). Then applying Lemmas 3 and 6, we have
By the identities \(\overline{\tau (\chi )}^{2}=\tau ^{2} (\overline{ \chi } )\), \(\tau ^{2}(\chi )\tau ^{2} (\overline{\chi } )= \tau ^{2}(\chi )\overline{\tau (\chi )}^{2}=p^{2} \), and
we have
For every integer \(k\geq 0\), we get the fourth-order linear recurrence formula
where \(N_{0}(4, \chi ; p)=0\), and α is the same as in Lemma 3.
Now Theorem 3 follows from (19)–(22).
In the same way, using Lemmas 3 and 7, we can also deduce Theorem 4.
To prove Corollary 1, applying Lemma 5, we get
Then from this formula and Lemma 1, by the identities \(|\tau (\chi )|= \sqrt{p}\) and \(\overline{\tau ^{3} (\chi )}=\tau ^{3} (\overline{ \chi } )\) we have
This proves Corollary 1.
Corollaries 2 and 3 follow from Lemma 6 and the identity \(|\tau ( \chi )|=\sqrt{p}\).
Next, we are going to prove Corollary 4. If \(p=8k+5\), then noting that \(\overline{\tau (\chi )}^{2}=\tau ^{2} (\overline{\chi } )\) and \(|\alpha +\beta |^{2}=|\alpha |^{2}+\alpha \overline{\beta }+\overline{ \alpha }\beta +|\beta |^{2}\), from Lemmas 6 and 3 we have
In the same way, if \(p=8k+1\), then from Lemmas 7 and 3, by the method of proving (23) we have
Combining (23) and (24), we complete the proofs of Corollaries 4 and 5.
References
Burgess, D.A.: On character sums and primitive roots. Proc. Lond. Math. Soc. 12, 179–192 (1962)
Burgess, D.A.: On Dirichlet characters of polynomials. Proc. Lond. Math. Soc. 13, 537–548 (1963)
Granville, A., Soundararajan, K.: Large character sums: pretentious characters and the Pólya–Vinogradov theorem. J. Am. Math. Soc. 20, 357–384 (2007)
Zhang, W.P., Yi, Y.: On Dirichlet characters of polynomials. Bull. Lond. Math. Soc. 34, 469–473 (2002)
Zhang, W.P., Yao, W.L.: A note on the Dirichlet characters of polynomials. Acta Arith. 115, 225–229 (2004)
Weil, A.: On some exponential sums. Proc. Natl. Acad. Sci. USA 34, 204–207 (1948)
Bourgain, J., Garaev, M.Z., Konyagin, S.V., Shparlinski, I.E.: On the hidden shifted power problem. SIAM J. Comput. 41, 1524–1557 (2012)
Zhang, W.P., Liu, H.N.: On the general Gauss sums and their fourth power mean. Osaka J. Math. 42, 189–199 (2005)
Zhang, W.P.: On the number of the solutions of one kind congruence equation \(\bmod\ p\). J. Northwest Univ. Nat. Sci. 46, 313–316 (2016)
Zhang, W.P., Hu, J.Y.: The number of solutions of the diagonal cubic congruence equation \(\bmod\ p\). Math. Rep. 20, 73–80 (2018)
Zhang, H., Zhang, W.P.: The fourth power mean of two-term exponential sums and its application. Math. Rep. 19, 75–83 (2017)
Chen, L., Hu, J.Y.: A linear recurrence formula involving cubic Gauss sums and Kloosterman sums. Acta Math. Sinica (Chin. Ser.) 61, 67–72 (2018)
Apostol, T.M.: Introduction to Analytic Number Theory. Springer, New York (1976)
Berndt, B.C., Evans, R.J.: The determination of Gauss sums. Bull. Am. Math. Soc. 5, 107–128 (1981)
Chen, Z.Y., Zhang, W.P.: On the fourth-order linear recurrence formula related to classical Gauss sums. Open Math. 15, 1251–1255 (2017)
Acknowledgements
The authors would like to thank the editors and referees for their very helpful and detailed comments, which have significantly improved the presentation of this paper.
Funding
This work is supported by the N. S. F. (11771351) and (11826205) of P. R. China.
Author information
Authors and Affiliations
Contributions
Both authors have equally contributed to this work. Both authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that there are no conflicts of interest regarding the publication of this paper.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
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
Zhang, W., Chen, Z. One kind of character sum modulo a prime p and its recurrence formula. Adv Differ Equ 2019, 133 (2019). https://doi.org/10.1186/s13662-019-2073-9
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13662-019-2073-9