Skip to main content

Theory and Modern Applications

One kind of character sum modulo a prime p and its recurrence formula

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

$$\begin{aligned} N(\chi , f; q)=\sum_{a=1}^{q}\chi \bigl(f(a)\bigr). \end{aligned}$$

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

$$\begin{aligned} \sum_{a=N+1}^{N+M}\chi \bigl(f(a) \bigr), \end{aligned}$$

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

$$\begin{aligned} \sum_{x=N+1}^{N+M}\chi \bigl(f(x) \bigr)\ll p^{\frac{1}{2}}\ln p, \end{aligned}$$
(1)

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

$$\begin{aligned} M_{k}(h,\chi; p)= \sum_{a_{1}=0}^{p-1} \sum_{a_{2}=0}^{p-1}\cdots \sum _{a_{k}=0}^{p-1}\chi \bigl(a_{1}^{h}+a_{2}^{h}+ \cdots +a_{k}^{h} \bigr) \end{aligned}$$

and

$$ N_{k}(h,\chi ; p)=M_{k}(h,\chi ; p)+ M_{k}(h, \overline{\chi }; p). $$

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

$$\begin{aligned} N_{k}(h, \chi ; p)=M_{k}(h, \chi ; p)= \sum _{a_{1}=0}^{p-1}\sum_{a _{2}=0}^{p-1} \cdots \sum_{a_{k}=0}^{p-1}\chi \bigl(a_{1}^{h}+a_{2} ^{h}+\cdots +a_{k}^{h} \bigr)=0. \end{aligned}$$

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

$$\begin{aligned} N_{1}(3,\chi ; p)=2(p-1); \qquad N_{2}(3,\chi ; p)= (p-1)d;\qquad N_{3}(3,\chi ; p)= 6p(p-1) \end{aligned}$$

and

$$\begin{aligned} N_{k}(3,\chi ; p) =3p\cdot N_{k-2}(3,\chi ; p)+ dp\cdot N_{k-3}(3, \chi ; p) \end{aligned}$$

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

$$\begin{aligned} &N_{1}(4, \chi ; p)=2(p-1),\qquad N_{2}(4, \chi ; p) =-4(p-1) \alpha ,\\ & N_{3}(4, \chi ; p)=2(p-1) \bigl(p-2\alpha ^{2} \bigr) \end{aligned}$$

and

$$\begin{aligned} N_{k+4}(4, \chi ; p)=-2pN_{k+2}(4, \chi ;p) + 8p\alpha N_{k+1}(4, \chi ; p)-p \bigl(9p-4\alpha ^{2} \bigr)N_{k}(4, \chi ; p) \end{aligned}$$

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

$$\begin{aligned} N_{1}(4, \chi ; p)=2(p-1),\qquad N_{2}(4, \chi ; p) =4(p-1)\alpha , \qquad N_{3}(4, \chi ; p)=2(p-1) \bigl(2\alpha ^{2}-p \bigr) \end{aligned}$$

and

$$\begin{aligned} N_{k+4}(4, \chi ; p)= 6pN_{k+2}(4, \chi ; p) + 8p\alpha N_{k+1}(4, \chi ; p)+p \bigl(4\alpha ^{2} -p \bigr)N_{k}(4, \chi ; p) \end{aligned}$$

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

$$\begin{aligned} \Biggl\vert \sum_{a=0}^{p-1}\sum _{b=0}^{p-1} \sum_{c=0}^{p-1} \sum_{d=0} ^{p-1}\chi \bigl(a^{3}+b^{3}+c^{3}+ d^{3} \bigr) \Biggr\vert =(p-1)p \cdot \sqrt{9p+4d^{2}}. \end{aligned}$$

Corollary 2

Let \(p=4k+1\) be an odd prime, and let χ be a fourth-order character \(\bmod\ p\). Then we have the identity

$$\begin{aligned} \Biggl\vert \sum_{a=0}^{p-1}\sum _{b=0}^{p-1}\chi \bigl(a^{4}+b^{4} \bigr) \Biggr\vert =2(p-1) \sqrt{p}. \end{aligned}$$

Corollary 3

Let \(p=4k+1\) be an odd prime, and let χ be a fourth-order character \(\bmod\ p\). Then we have the identity

$$\begin{aligned} \Biggl\vert \sum_{a=0}^{p-1}\sum _{b=0}^{p-1}\sum_{c=0}^{p-1} \chi \bigl(a ^{4}+b^{4} +c^{4} \bigr) \Biggr\vert =(p-1)p. \end{aligned}$$

Corollary 4

Let \(p=8k+5\) be an odd prime, and let χ be a fourth-order character \(\bmod\ p\). Then we have the identity

$$\begin{aligned} \Biggl\vert \sum_{a=0}^{p-1}\sum _{b=0}^{p-1}\sum_{c=0}^{p-1} \sum_{d=0} ^{p-1}\chi \bigl(a^{4}+b^{4} +c^{4}+d^{4} \bigr) \Biggr\vert =4(p-1)p \cdot \sqrt{p+8 \alpha ^{2}}. \end{aligned}$$

Corollary 5

Let \(p=8k+1\) be an odd prime, and let χ be a fourth-order character \(\bmod\ p\). Then we have the identity

$$\begin{aligned} \Biggl\vert \sum_{a=0}^{p-1}\sum _{b=0}^{p-1}\sum_{c=0}^{p-1} \sum_{d=0} ^{p-1}\chi \bigl(a^{4}+b^{4} +c^{4}+d^{4} \bigr) \Biggr\vert =4(p-1)p \cdot \sqrt{9p+16\alpha ^{2}}. \end{aligned}$$

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

$$ \tau (\chi )=\sum_{a=1}^{q}\chi (a)e \biggl(\frac{a}{q} \biggr), $$

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

$$ \tau ^{3} (\psi )+ \tau ^{3} (\overline{\psi } )=dp, $$

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

$$ U^{3}(b,p)=dp+ 3p\cdot U(b, p), $$

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

$$\begin{aligned} U(b,p)&=\sum_{a=0}^{p-1}e \biggl( \frac{ba^{3}}{p} \biggr)=1+\sum_{a=1} ^{p-1}e \biggl(\frac{ba^{3}}{p} \biggr) \\ & =1+ \sum_{a=1}^{p-1} \bigl(1+\chi (a)+ \overline{\chi }(a) \bigr)e \biggl(\frac{ba}{p} \biggr) \\ &= \sum_{a=0}^{p-1}e \biggl(\frac{ba}{p} \biggr)+\sum_{a=1}^{p-1} \chi (a)e \biggl( \frac{ba}{p} \biggr)+ \sum_{a=1}^{p-1} \overline{ \chi }(a)e \biggl(\frac{ba}{p} \biggr) \\ &= \overline{\chi }(b)\tau (\chi )+ \chi (b)\tau (\overline{ \chi } ). \end{aligned}$$
(2)

Note that \(\chi ^{3}=\chi _{0}\) and \(\tau (\chi )\tau (\overline{ \chi } )=p\), so from (2) we immediately infer that

$$\begin{aligned} U^{3}(b,p)&= \bigl(\overline{\chi }(b)\tau (\chi )+ \chi (b)\tau ( \overline{\chi } ) \bigr)^{3} \\ &= \tau ^{3}(\chi )+ 3\tau (\chi )\tau (\overline{\chi } ) \bigl( \overline{\chi }(b)\tau (\chi )+ \chi (b)\tau (\overline{ \chi } ) \bigr)+ \tau ^{3} (\overline{\chi } ) \\ &= \tau ^{3}(\chi )+ \tau ^{3} (\overline{\chi } )+ 3p\cdot U(b, p)=dp+3p\cdot U(b,p). \end{aligned}$$

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

$$ \tau ^{2}(\psi )+ \tau ^{2} (\overline{\psi } )=\sqrt{p} \cdot \sum_{a=1}^{p-1} \biggl(\frac{a+\overline{a}}{p} \biggr)= 2 \sqrt{p}\cdot \alpha , $$

where \(\alpha = \sum_{a=1}^{\frac{p-1}{2}} (\frac{a+\overline{a}}{p} )\), \((\frac{*}{p} )\) denotes the Legendre symbol \(\bmod\ p\), and 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

$$ A^{4}(b,p)=2p \bigl(C(p)+2 \bigr)A^{2}(b,p)+8p\alpha A(b,p) +4p\alpha ^{2}-C^{2}(p)p^{2}, $$

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

$$\begin{aligned} A(b,p)&=\sum_{a=0}^{p-1}e \biggl( \frac{ba^{4}}{p} \biggr)=1+\sum_{a=1} ^{p-1}e \biggl(\frac{ba^{4}}{p} \biggr) \\ & = 1+ \sum_{a=1}^{p-1} \bigl(1+\psi (a)+ \chi _{2}(a)+ \overline{ \psi }(a) \bigr)e \biggl(\frac{ba}{p} \biggr) \\ &= \sum_{a=0}^{p-1}e \biggl(\frac{ba}{p} \biggr)+\sum_{a=1}^{p-1} \psi (a)e \biggl( \frac{ba}{p} \biggr)+ \sum_{a=1}^{p-1}\chi _{2}(a)e \biggl(\frac{ba}{p} \biggr)+ \sum _{a=1}^{p-1}\overline{\psi }(a)e \biggl( \frac{ba}{p} \biggr) \\ &= \chi _{2}(b)\tau (\chi _{2})+ \overline{\psi }(b)\tau ( \psi )+ \psi (b)\tau (\overline{\psi } ). \end{aligned}$$
(3)

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

$$\begin{aligned} A^{2}(b,p)={}& \bigl(\chi _{2}(b)\tau (\chi _{2})+ \overline{\psi }(b) \tau (\psi )+ \psi (b)\tau (\overline{\psi } ) \bigr) ^{2} \\ ={}& p + 2\chi _{2}(b)\sqrt{p} \bigl( \overline{\psi }(b)\tau (\psi )+ \psi (b)\tau (\overline{\psi } ) \bigr)+ \chi _{2}(b) \bigl(\tau ^{2}(\psi )+ \tau ^{2} (\overline{\psi } ) \bigr) \\ &{}+ 2\tau (\psi )\tau (\overline{\psi } ) \\ ={}& p +2\chi _{2}(b)\sqrt{p}A(b, p)-2p+ \chi _{2}(b)2\sqrt{p} \cdot \alpha + \psi (-1)2p \\ = {}&C(p)p +2\chi _{2}(b)\sqrt{p}A(b, p)+ \chi _{2}(b)2\sqrt{p} \cdot \alpha , \end{aligned}$$
(4)

where \(C(p)=-3\) if \(p=8k+5\) and \(C(p)=1\) if \(p=8k+1\).

Now, according to (4), we have

$$\begin{aligned} \bigl(A^{2}(b, p)-C(p)p \bigr)^{2}&=A^{4}(b, p)-2C(p)p A^{2}(b,p)+C ^{2}(p)p^{2} \\ &= \bigl(2\sqrt{p}A(b,p)+ 2\sqrt{p}\cdot \alpha \bigr)^{2}=4p \bigl(A^{2}(b,p)+2\alpha A(b,p)+\alpha ^{2} \bigr). \end{aligned}$$
(5)

Applying (5), we immediately deduce that

$$ A^{4}(b,p)=2p \bigl(C(p)+2 \bigr)A^{2}(b,p)+8p\alpha A(b,p) +4p\alpha ^{2}-C^{2}(p)p^{2}. $$

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

$$\begin{aligned} M_{1}(3, \chi ; p)=p-1;\qquad M_{2}(3,\chi ;p)= \frac{p-1}{p} \cdot \tau ^{3}(\chi );\qquad M_{3}(3,\chi ; p)= 3p(p-1) \end{aligned}$$

and

$$\begin{aligned} M_{k}(3, \chi ; p) =3p\cdot M_{k-2}(3,\chi ; p)+ dp\cdot M_{k-3}(3, \chi ; p) \end{aligned}$$

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

$$\begin{aligned} M_{2}(3, \chi ; p)&=\frac{1}{\tau (\overline{\chi } )} \sum _{b=1}^{p-1}\overline{\chi }(b)\sum _{c=0}^{p-1}\sum_{d=0}^{p-1} e \biggl(\frac{b(c^{3}+d^{3})}{p} \biggr) \\ &= \frac{1}{\tau (\overline{\chi } )}\sum_{b=1}^{p-1}\overline{ \chi }(b) \bigl(\overline{\chi }(b)\tau (\chi )+ \chi (b)\tau (\overline{ \chi } ) \bigr)^{2} \\ &= \frac{1}{\tau (\overline{\chi } )}\sum_{b=1}^{p-1}\overline{ \chi }(b) \bigl(\overline{\chi }^{2}(b)\tau ^{2}(\chi )+ 2p+ \chi ^{2}(b) \tau ^{2} (\overline{\chi } ) \bigr) \\ &= \frac{\tau ^{2}(\chi )}{\tau (\overline{\chi } )} \cdot (p-1)=\frac{p-1}{p}\cdot \tau ^{3}(\chi ), \end{aligned}$$
(6)
$$\begin{aligned} M_{3}(3, \chi ; p)&=\frac{1}{\tau (\overline{\chi } )} \sum _{b=1}^{p-1}\overline{\chi }(b)\sum _{c=0}^{p-1}\sum_{d=0}^{p-1} \sum_{e=0}^{p-1} e \biggl(\frac{b(c^{3}+d^{3}+e^{3})}{p} \biggr) \\ &= \frac{1}{\tau (\overline{\chi } )}\sum_{b=1}^{p-1}\overline{ \chi }(b) \bigl(\overline{\chi }(b)\tau (\chi )+ \chi (b)\tau (\overline{ \chi } ) \bigr)^{3} \\ &= \frac{1}{\tau (\overline{\chi } )}\sum_{b=1}^{p-1}\overline{ \chi }(b) \bigl(\tau ^{3}(\chi )+ 3pU(b,p)+ \tau ^{3} ( \overline{ \chi } ) \bigr) = 3p(p-1). \end{aligned}$$
(7)

For any integer \(k\geq 4\), according to Lemma 1, we have

$$\begin{aligned} M_{k}(3, \chi ; p)&=\frac{1}{\tau (\overline{\chi } )} \sum _{b=1}^{p-1}\overline{\chi }(b) \Biggl(\sum _{a=0}^{p-1}e \biggl(\frac{ba ^{3}}{p} \biggr) \Biggr)^{k} \\ &= \frac{1}{\tau (\overline{\chi } )}\sum_{b=1}^{p-1}\overline{ \chi }(b)U^{k-3}(b, p) \bigl(\tau ^{3}(\chi )+\tau ^{3} (\overline{ \chi } )+3p U(b,p) \bigr) \\ &= \frac{3p}{\tau (\overline{\chi } )}\sum_{b=1}^{p-1} \overline{ \chi }(b)U^{k-2}(b,p)+ \frac{dp}{\tau (\overline{\chi } )}\sum _{b=1}^{p-1}\overline{ \chi }(b)U^{k-3}(b,p) \\ &= 3pM_{k-2}(3,\chi ; p)+dp\cdot M_{k-3}(3, \chi ; p). \end{aligned}$$
(8)

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

$$\begin{aligned} &M_{1}(4, \chi ; p)=p-1; \\ &M_{2}(4, \chi ; p) =2(p-1)\sqrt{p}\cdot \frac{\tau (\chi )}{\tau (\overline{ \chi })}=- \frac{2(p-1)}{\sqrt{p}}\cdot \tau ^{2}(\chi ); \\ &M_{3}(4, \chi ; p)=(p-1) \frac{\tau ^{3}(\chi )}{\tau (\overline{\chi })}=-\frac{p-1}{p}\cdot \tau ^{4}(\chi ). \end{aligned}$$

For every integer \(k\geq 0\), we obtain the fourth-order linear recurrence formula

$$\begin{aligned} M_{k+4}(4, \chi ; p)=-2pM_{k+2}(4, \chi ;p) + 8p\alpha M_{k+1}(4, \chi ; p) -p \bigl(9p-4\alpha ^{2} \bigr)M_{k}(4, \chi ; p), \end{aligned}$$

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

$$\begin{aligned} M_{k+4}(4, \chi ; p)&=\frac{1}{\tau (\overline{\chi })}\sum _{x_{1}=0} ^{p-1}\sum_{x_{2}=0}^{p-1} \cdots \sum_{x_{k+4}=0}^{p-1}\sum _{b=1}^{p-1}\overline{ \chi }(b) e \biggl( \frac{b(x_{1}^{4}+x_{2}^{2}+\cdots +x_{k+4}^{4})}{p} \biggr) \\ &= \frac{1}{\tau (\overline{\chi })}\sum_{b=1}^{p-1} \overline{\chi }(b) \Biggl(\sum_{x=0}^{p-1}e \biggl(\frac{bx^{4}}{p} \biggr) \Biggr)^{k+4}=\frac{1}{ \tau (\overline{\chi })}\sum _{b=1}^{p-1}\overline{\chi }(b)A^{k+4}(b, p) \\ &= \frac{1}{\tau (\overline{\chi })}\sum_{b=1}^{p-1} \overline{\chi }(b)A ^{k}(b,p) \bigl(-2pA^{2}(b,p)+8p\alpha A(b,p)-p \bigl(9p-4\alpha ^{2} \bigr) \bigr) \\ &= -2pM_{k+2}(4, \chi ; p) + 8p\alpha M_{k+1}(4, \chi ; p)-p \bigl(9p-4 \alpha ^{2} \bigr)M_{k}(4, \chi ; p), \end{aligned}$$
(9)

where \(M_{0}(4, \chi ; p)=0\).

Suppose that χ is a fourth-order character \(\bmod \ p\). Then we get

$$\begin{aligned} M_{1}(4, \chi , p)=\sum_{a=0}^{p-1} \chi \bigl(a^{4} \bigr)=\sum_{a=0}^{p-1} \chi ^{4} (a )=p-1. \end{aligned}$$
(10)

Note that \(\overline{\chi }(b) (\frac{b}{p} )=\chi (b)\), so from (4) and (3) we get

$$\begin{aligned} M_{2}(4, \chi ; p)&= \frac{1}{\tau (\overline{\chi })}\sum _{b=1}^{p-1}\overline{ \chi }(b) \Biggl(\sum _{x=0}^{p-1}e \biggl(\frac{bx^{4}}{p} \biggr) \Biggr) ^{2} \\ &= \frac{1}{\tau (\overline{\chi })}\sum_{b=1}^{p-1} \overline{\chi }(b) \bigl(-3p+\chi _{2}(b)2\sqrt{p}A(b,p)+ \chi _{2}(b)2\sqrt{p}\alpha \bigr) \\ &= \frac{2\sqrt{p}}{\tau (\overline{\chi })}\sum_{b=1}^{p-1}\chi (b)A(b,p) \\ &= \frac{2\sqrt{p}}{\tau (\overline{\chi })}\sum_{b=1}^{p-1}\chi (b) \bigl(\chi _{2}(b)\sqrt{p}+ \overline{\chi }(b)\tau (\chi )+ \chi (b) \tau (\overline{\chi } ) \bigr) \\ &= -\frac{2(p-1)}{\sqrt{p}}\cdot \tau ^{2}(\chi ). \end{aligned}$$
(11)

In the same way, applying (3) and the orthogonality of the characters \(\bmod \ p\), we also have

$$\begin{aligned} M_{3}(4, \chi ; p)&= \frac{1}{\tau (\overline{\chi })}\sum _{b=1}^{p-1}\overline{ \chi }(b) \Biggl(\sum _{x=0}^{p-1}e \biggl(\frac{bx^{4}}{p} \biggr) \Biggr) ^{3} \\ &= \frac{1}{\tau (\overline{\chi })}\sum_{b=1}^{p-1} \overline{\chi }(b) \bigl(\chi _{2}(b)\sqrt{p}+ \overline{\chi }(b)\tau (\chi )+ \chi (b) \tau (\overline{\chi } ) \bigr)^{3} \\ &= \frac{3p}{\tau (\overline{\chi })}\sum_{b=1}^{p-1} \overline{\chi }(b) \chi (b)\tau (\overline{\chi } )+ \frac{1}{\tau (\overline{ \chi })}\sum _{b=1}^{p-1}\tau ^{3}(\chi )+ \frac{3}{\tau (\overline{ \chi })}\sum_{b=1}^{p-1}\tau (\chi ) \tau ^{2} (\overline{\chi } ) \\ &= -\frac{p-1}{p}\cdot \tau ^{4}(\chi ). \end{aligned}$$
(12)

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

$$\begin{aligned} &M_{1}(4, \chi ; p)=p-1; \\ &M_{2}(4, \chi ; p) =2(p-1)\sqrt{p}\cdot \frac{\tau (\chi )}{\tau (\overline{ \chi })}= \frac{2(p-1)}{\sqrt{p}}\cdot \tau ^{2}(\chi ); \\ &M_{3}(4, \chi ; p)=\frac{p-1}{p}\cdot \tau ^{4} (\chi ). \end{aligned}$$

For every integer \(k\geq 0\), we have the fourth-order linear recurrence formula

$$\begin{aligned} M_{k+4}(4, \chi ; p) = 6pM_{k+2}(4, \chi ; p) + 8p\alpha M_{k+1}(4, \chi ; p)+p \bigl(4\alpha ^{2} -p \bigr)M_{k}(4, \chi ; p). \end{aligned}$$

Proof

If \(p=8h+1\), then from Lemma 4 we have

$$\begin{aligned} M_{k+4}(4, \chi ; p)&=\frac{1}{\tau (\overline{\chi })}\sum _{x_{1}=0} ^{p-1}\sum_{x_{2}=0}^{p-1} \cdots \sum_{x_{k+4}=0}^{p-1}\sum _{b=1}^{p-1}\overline{ \chi }(b) e \biggl( \frac{b(x_{1}^{4}+x_{2}^{2}+\cdots +x_{k+4}^{4})}{p} \biggr) \\ &= \frac{1}{\tau (\overline{\chi })}\sum_{b=1}^{p-1} \overline{\chi }(b)A ^{k}(b,p) \bigl(6pA^{2}(b, p)+8p\alpha A(b, p)+p \bigl(4\alpha ^{2}-p \bigr) \bigr) \\ &= 6pM_{k+2}(4, \chi ; p) + 8p\alpha M_{k+1}(4,\chi ; p)+p \bigl(4 \alpha ^{2}-p \bigr)M_{k}(4,\chi ; p). \end{aligned}$$
(13)

It is not complicated to prove that

$$\begin{aligned} M_{1}(4, \chi ; p)=\sum_{x=0}^{p-1} \chi \bigl(x^{4} \bigr)=\sum_{x=0}^{p-1} \chi ^{4} (x )=p-1. \end{aligned}$$
(14)

Note that \(\overline{\chi }(b) (\frac{b}{p} )=\chi (b)\), \(\tau (\chi )\tau (\overline{\chi })=p\). By the method of proving (11) we have

$$\begin{aligned} M_{2}(4, \chi ; p)&= \frac{1}{\tau (\overline{\chi })}\sum _{b=1}^{p-1}\overline{ \chi }(b) \Biggl(\sum _{x=0}^{p-1}e \biggl(\frac{bx^{4}}{p} \biggr) \Biggr) ^{2} \\ &= \frac{2\sqrt{p}\cdot \tau (\chi )}{\tau (\overline{\chi })}\sum_{a=1}^{p-1}1 = \frac{2(p-1)}{\sqrt{p}}\cdot \tau ^{2}(\chi ). \end{aligned}$$
(15)

Similarly, combined with the method of proving (12), we also get

$$\begin{aligned} M_{3}(4, \chi ; p)&= \frac{1}{\tau (\overline{\chi })}\sum _{b=1}^{p-1}\overline{ \chi }(b) \Biggl(\sum _{x=0}^{p-1}e \biggl(\frac{bx^{4}}{p} \biggr) \Biggr) ^{3} \\ &= (p-1)\cdot \frac{\tau ^{3}(\chi )}{\tau (\overline{\chi } )}= \frac{p-1}{p}\cdot \tau ^{4}( \chi ). \end{aligned}$$
(16)

Now Lemma 7 follows from (13)–(16). □

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

$$\begin{aligned} \sum_{a=0}^{p-1}\chi \bigl(a^{h} \bigr)=\sum_{a=1}^{p-1}\chi ^{h}(a)=0. \end{aligned}$$
(17)

Suppose that the conclusion holds for an integer \(k= m\geq 1\), that is,

$$\begin{aligned} \sum_{a_{1}=0}^{p-1}\sum _{a_{2}=0}^{p-1}\cdots \sum_{a_{m}=0}^{p-1} \chi \bigl(a_{1}^{h}+a_{2}^{h}+\cdots +a_{m}^{h} \bigr)=0. \end{aligned}$$
(18)

Then for \(k=m+1\), combining (17) and (18) with the properties of the complete residue system \(\bmod\ p\), we have

$$\begin{aligned} &\sum_{a_{1}=0}^{p-1}\sum _{a_{2}=0}^{p-1}\cdots \sum_{a_{m}=0}^{p-1} \sum_{a_{m+1}=0}^{p-1}\chi \bigl(a_{1}^{h}+a_{2}^{h}+ \cdots +a_{m} ^{h}+a_{m+1}^{h} \bigr) \\ &\quad= \sum_{a_{1}=0}^{p-1}\sum _{a_{2}=0}^{p-1}\cdots \sum_{a_{m}=0}^{p-1} \chi \bigl(a_{1}^{h}+a_{2}^{h}+\cdots +a_{m}^{h} \bigr) \\ &\qquad{}+ \sum_{a_{1}=0}^{p-1}\sum _{a_{2}=0}^{p-1}\cdots \sum_{a_{m}=0}^{p-1} \sum_{a_{m+1}=1}^{p-1}\chi \bigl(a_{1}^{h}+a_{2}^{h}+ \cdots +a_{m} ^{h}+a_{m+1}^{h} \bigr) \\ &\quad= \sum_{a_{1}=0}^{p-1}\sum _{a_{2}=0}^{p-1}\cdots \sum_{a_{m}=0}^{p-1} \chi \bigl(a_{1}^{h}+a_{2}^{h}+\cdots +a_{m}^{h}+1 \bigr) \sum_{a_{m+1}=1}^{p-1} \chi ^{h} (a_{m+1} ) \\ &\quad = 0. \end{aligned}$$

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

$$\begin{aligned} &N_{1}(3, \chi ; p)=2(p-1),\qquad N_{3}(3,\chi ; p)= 6p(p-1), \\ &N_{2}(3,\chi ;p)= \frac{p-1}{p}\cdot \tau ^{3}(\chi )+ \frac{p-1}{p} \cdot \tau ^{3} (\overline{\chi } )= d(p-1) \end{aligned}$$

and

$$\begin{aligned} N_{k}(3, \chi ; p) =3p\cdot N_{k-2}(3,\chi ; p)+ dp\cdot N_{k-3}(3, \chi ; p) \end{aligned}$$

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

$$\begin{aligned} &N_{1}(4, \chi ; p)=2(p-1); \end{aligned}$$
(19)
$$\begin{aligned} &N_{2}(4, \chi ; p) =-\frac{2(p-1)}{\sqrt{p}}\cdot \tau ^{2}(\chi )-\frac{2(p-1)}{ \sqrt{p}}\cdot \tau ^{2} (\overline{\chi } )= -4(p-1)\cdot \alpha. \end{aligned}$$
(20)

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

$$ \tau ^{4}(\chi )+\tau ^{4} (\overline{\chi } )= \bigl(\tau ^{2}(\chi )+ \tau ^{2} (\overline{\chi } ) \bigr)^{2}-2\tau ^{2}(\chi )\tau ^{2} (\overline{ \chi } )= 4p\alpha ^{2}-2p ^{2}, $$

we have

$$\begin{aligned} N_{3}(4, \chi ; p)&=-\frac{p-1}{p}\cdot \tau ^{4}(\chi )- \frac{p-1}{p}\cdot \tau ^{4} (\overline{\chi } ) \\ &= -\frac{p-1}{p} \bigl(4p\alpha ^{2}-2p^{2} \bigr)=2 \bigl(p-2\alpha ^{2} \bigr) (p-1). \end{aligned}$$
(21)

For every integer \(k\geq 0\), we get the fourth-order linear recurrence formula

$$\begin{aligned} &N_{k+4}(4, \chi ; p) \\ &\quad = -2pN_{k+2}(4, \chi ;p) + 8p\alpha N_{k+1}(4, \chi ; p) -p \bigl(9p-4 \alpha ^{2} \bigr)N_{k}(4, \chi ; p), \end{aligned}$$
(22)

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

$$ M_{4}(3, \chi ; p)=3(p-1)\tau ^{3}(\chi )+ dp(p-1). $$

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

$$\begin{aligned} &\Biggl\vert \sum_{a=0}^{p-1}\sum _{b=0}^{p-1}\sum_{c=0}^{p-1} \sum_{c=0} ^{p-1}\chi \bigl(a^{3}+b^{3}+c^{3}+d^{3} \bigr) \Biggr\vert \\ &\quad = \bigl\vert 3(p-1) \tau ^{3}(\chi )+ dp(p-1) \bigr\vert \\ &\quad= (p-1) \bigl\vert 3\tau ^{3}(\chi )+dp \bigr\vert =(p-1) \bigl[9p^{3}+3dp \bigl(\tau ^{3}(\chi )+\tau ^{3} ( \overline{\chi } ) \bigr)+d ^{2}p^{2} \bigr]^{\frac{1}{2}} \\ &\quad = (p-1) \bigl[9p^{3}+3d^{2}p^{2}+d^{2}p^{2} \bigr]^{\frac{1}{2}}=(p-1)p \cdot \sqrt{9p+4d^{2}}. \end{aligned}$$

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

$$\begin{aligned} \bigl\vert M_{4}(4, \chi ; p) \bigr\vert & = \bigl\vert 4 \sqrt{p}(p-1)\tau ^{2}(\chi )+8p \alpha (p-1) \bigr\vert \\ &= 4\sqrt{p}(p-1) \bigl\vert \tau ^{2}(\chi )+2\sqrt{p}\alpha \bigr\vert \\ &= 4\sqrt{p}(p-1) \bigl\vert p^{2}+4p\alpha ^{2}+2\sqrt{p} \alpha \bigl(\tau ^{2}(\chi )+\tau ^{2}(\overline{\chi }) \bigr) \bigr\vert ^{\frac{1}{2}} \\ &= 4\sqrt{p}(p-1) \bigl\vert p^{2}+8p\alpha ^{2} \bigr\vert ^{\frac{1}{2}}=4p(p-1) \cdot \sqrt{p+8\alpha ^{2}}. \end{aligned}$$
(23)

In the same way, if \(p=8k+1\), then from Lemmas 7 and 3, by the method of proving (23) we have

$$\begin{aligned} \bigl\vert M_{4}(4, \chi ; p) \bigr\vert &= \bigl\vert 12 \sqrt{p}(p-1)\tau ^{2}(\chi )+8p \alpha (p-1) \bigr\vert \\ &= 4\sqrt{p}(p-1) \bigl\vert 3\tau ^{2}(\chi )+2\sqrt{p}\alpha \bigr\vert \\ &= 4\sqrt{p}(p-1) \bigl\vert 9p^{2}+4p\alpha ^{2}+6\sqrt{p} \alpha \bigl(\tau ^{2}(\chi )+\tau ^{2}(\overline{\chi }) \bigr) \bigr\vert ^{\frac{1}{2}} \\ &= 4\sqrt{p}(p-1) \bigl\vert 9p^{2}+16p\alpha ^{2} \bigr\vert ^{\frac{1}{2}}=4p(p-1) \cdot \sqrt{9p+16\alpha ^{2}}. \end{aligned}$$
(24)

Combining (23) and (24), we complete the proofs of Corollaries 4 and 5.

References

  1. Burgess, D.A.: On character sums and primitive roots. Proc. Lond. Math. Soc. 12, 179–192 (1962)

    Article  MathSciNet  Google Scholar 

  2. Burgess, D.A.: On Dirichlet characters of polynomials. Proc. Lond. Math. Soc. 13, 537–548 (1963)

    Article  MathSciNet  Google Scholar 

  3. Granville, A., Soundararajan, K.: Large character sums: pretentious characters and the Pólya–Vinogradov theorem. J. Am. Math. Soc. 20, 357–384 (2007)

    Article  Google Scholar 

  4. Zhang, W.P., Yi, Y.: On Dirichlet characters of polynomials. Bull. Lond. Math. Soc. 34, 469–473 (2002)

    Article  MathSciNet  Google Scholar 

  5. Zhang, W.P., Yao, W.L.: A note on the Dirichlet characters of polynomials. Acta Arith. 115, 225–229 (2004)

    Article  MathSciNet  Google Scholar 

  6. Weil, A.: On some exponential sums. Proc. Natl. Acad. Sci. USA 34, 204–207 (1948)

    Article  MathSciNet  Google Scholar 

  7. Bourgain, J., Garaev, M.Z., Konyagin, S.V., Shparlinski, I.E.: On the hidden shifted power problem. SIAM J. Comput. 41, 1524–1557 (2012)

    Article  MathSciNet  Google Scholar 

  8. Zhang, W.P., Liu, H.N.: On the general Gauss sums and their fourth power mean. Osaka J. Math. 42, 189–199 (2005)

    MathSciNet  MATH  Google Scholar 

  9. 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)

    MathSciNet  MATH  Google Scholar 

  10. Zhang, W.P., Hu, J.Y.: The number of solutions of the diagonal cubic congruence equation \(\bmod\ p\). Math. Rep. 20, 73–80 (2018)

    MathSciNet  MATH  Google Scholar 

  11. Zhang, H., Zhang, W.P.: The fourth power mean of two-term exponential sums and its application. Math. Rep. 19, 75–83 (2017)

    MathSciNet  MATH  Google Scholar 

  12. 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)

    MathSciNet  MATH  Google Scholar 

  13. Apostol, T.M.: Introduction to Analytic Number Theory. Springer, New York (1976)

    MATH  Google Scholar 

  14. Berndt, B.C., Evans, R.J.: The determination of Gauss sums. Bull. Am. Math. Soc. 5, 107–128 (1981)

    Article  MathSciNet  Google Scholar 

  15. Chen, Z.Y., Zhang, W.P.: On the fourth-order linear recurrence formula related to classical Gauss sums. Open Math. 15, 1251–1255 (2017)

    MathSciNet  MATH  Google Scholar 

Download references

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

Authors

Contributions

Both authors have equally contributed to this work. Both authors read and approved the final manuscript.

Corresponding author

Correspondence to Zhuoyu Chen.

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.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/s13662-019-2073-9

MSC

Keywords