Loading [MathJax]/jax/output/SVG/jax.js
Research article

The fourth power mean value of one kind two-term exponential sums

  • Received: 28 December 2021 Revised: 30 June 2022 Accepted: 11 July 2022 Published: 20 July 2022
  • MSC : 11L03, 11L07

  • In this paper, based on the analytic method and the properties of Gauss sums, we study the computational problems of the fourth power mean value of one kind two-term exponential sums through the classification and estimation of Dirichlet characters and give it a calculation formula or asymptotic formula in different conditions.

    Citation: Jinmin Yu, Renjie Yuan, Tingting Wang. The fourth power mean value of one kind two-term exponential sums[J]. AIMS Mathematics, 2022, 7(9): 17045-17060. doi: 10.3934/math.2022937

    Related Papers:

    [1] Jin Zhang, Wenpeng Zhang . A certain two-term exponential sum and its fourth power means. AIMS Mathematics, 2020, 5(6): 7500-7509. doi: 10.3934/math.2020480
    [2] Wenpeng Zhang, Yuanyuan Meng . On the fourth power mean of one special two-term exponential sums. AIMS Mathematics, 2023, 8(4): 8650-8660. doi: 10.3934/math.2023434
    [3] Wenpeng Zhang, Jiafan Zhang . The hybrid power mean of some special character sums of polynomials and two-term exponential sums modulo $ p $. AIMS Mathematics, 2021, 6(10): 10989-11004. doi: 10.3934/math.2021638
    [4] Xue Han, Tingting Wang . The hybrid power mean of the generalized Gauss sums and the generalized two-term exponential sums. AIMS Mathematics, 2024, 9(2): 3722-3739. doi: 10.3934/math.2024183
    [5] Shujie Zhou, Li Chen . On the sixth power mean values of a generalized two-term exponential sums. AIMS Mathematics, 2023, 8(11): 28105-28119. doi: 10.3934/math.20231438
    [6] Xuan Wang, Li Wang, Guohui Chen . The fourth power mean of the generalized quadratic Gauss sums associated with some Dirichlet characters. AIMS Mathematics, 2024, 9(7): 17774-17783. doi: 10.3934/math.2024864
    [7] Wenpeng Zhang, Yuanyuan Meng . On the sixth power mean of one kind two-term exponential sums weighted by Legendre's symbol modulo $ p $. AIMS Mathematics, 2021, 6(7): 6961-6974. doi: 10.3934/math.2021408
    [8] Yan Zhao, Wenpeng Zhang, Xingxing Lv . A certain new Gauss sum and its fourth power mean. AIMS Mathematics, 2020, 5(5): 5004-5011. doi: 10.3934/math.2020321
    [9] Junfeng Cui, Li Wang . The generalized Kloosterman's sums and its fourth power mean. AIMS Mathematics, 2023, 8(11): 26590-26599. doi: 10.3934/math.20231359
    [10] Xiaoxue Li, Wenpeng Zhang . A note on the hybrid power mean involving the cubic Gauss sums and Kloosterman sums. AIMS Mathematics, 2022, 7(9): 16102-16111. doi: 10.3934/math.2022881
  • In this paper, based on the analytic method and the properties of Gauss sums, we study the computational problems of the fourth power mean value of one kind two-term exponential sums through the classification and estimation of Dirichlet characters and give it a calculation formula or asymptotic formula in different conditions.



    The mean value calculation and upper bound estimation of exponential sums has always been a classical problem in analytic number theory. Exponential sum method plays an important role in many number theory problems. As a special kind of exponential sum, Gauss sum plays an important role not only in the study of analytic number theory, but also in cryptography. Any substantial progress in this field will play an important role in promoting the development of analytic number theory and cryptography. In this paper, we will estimate and calculate the fourth power mean value of one kind two-term exponential sums.

    Let q3 be a positive integer. For any integers m and n, the two-term exponential sums G(m,n,k,h;q) are defined as follows:

    G(m,n,k,h;q)=q1a=0e(mak+nahq),

    where e(y)=e2πiy and i2=1, k and h are both positive integers.

    As a special form of exponential sums, we define the k-th Gauss sums G(m,k;q) as follows:

    G(m,k;q)=q1a=0e(makq).

    In addition, another form of exponential sums

    K(m,n;q)=q1a=0(a,q)=1e(ma+n¯aq),

    which are the famous Kloosterman sums, and ¯a denotes the multiplicative inverse of a mod q, that means a¯a1modq.

    The calculations of exponential sums are important in number theory, because they are related to many classical mathematical problems, such as Waring's problem. Many scholars have studied the properties of G(m,n,k,h;q) in different forms, and obtained many interesting results, see [1,2,3,4]. For example, H. Zhang and W. P. Zhang [5] obtained an important result of G(m,n,3,1;p) and proved an identity

    p1m=1|p1a=0e(ma3+nap)|4={2p3p2, if 3p1,2p37p2, if 3p1,

    where p is an odd prime and gcd (n, p) = 1.

    Z. Y. Chen and W. P. Zhang [6] studied the hybrid mean value of the 4-th Gauss sums and the Kloosterman sums, and obtain the following formula:

    p1m=1|p1a=0e(ma4p)|2|p1c=1e(mc+¯cp)|2=3p33p2+2p32α3p,

    where p is an odd prime with p5mod8.

    L. Chen and X. Wang [7] studied a kind of two-term exponential sums and obtained the following formula:

    p1m=1|p1a=0e(ma4+ap)|4={2p2(p2), if  p=12k+7,2p3, if   p=12k+11,2p(p210p2α2), if  p=24k+1,2p(p24p2α2), if  p=24k+5,2p(p26p2α2), if  p=24k+13,2p(p28p2α2), if   p=24k+17.

    More relevant to it, W. P. Zhang and D. Han [8] studied a kind of two-term exponential sums and obtained an important result

    p1n=1|p1a=0e(a3+nap)|6=5p48p3p2.

    The above formula gives the calculation formulae of the sixth mean value of exponential sums in this form when k=3 and h=1. Inspired by the conclusion, we intended to calculate higher-order forms, such as the case of k=4 and h=1 which are more meaningful. But this form of sixth mean value is too difficult to calculate, and some formulas have not been obtained yet. But yet, we can get a result for the fourth mean value in this condition:

    q1m=0|C(1,m,4,1;q)|4=p1m=0|p1a=0e(a4+map)|4.

    The problem in our paper is more complex than the results in [7] by L. Chen and X. Wang. First of all, these are two completely different sums, and in this case m is multiplied by a instead of a4. Secondly, their summation over m can get rid of the fourth power part of the expansion. Finally, the summation over m in this paper can only deal with the first power part in the expansion process, which means that we have to deal with a higher order trigonometric sum and solve a simultaneous congruence equation. We not only give the essential relationship between the solution of the sum and the number of solutions of the system of congruence equations, but also give a concise and good-looking result in this high-dimensional case, this is also the difficulty of this paper.

    Regarding this problem, we shall prove the following conclusions:

    Theorem 1.1. Let p be a prime with p1mod4, then we have the asymptotic formula

    p1m=0|p1a=0e(a4+map)|4=2p3+O(p52).

    Theorem 1.2. Let p>3 be a prime with p3mod4, then we have the identity

    p1m=0|p1a=0e(a4+map)|4={2p33p2,if  p=12k+7,2p3+p2,if  p=12k+11.

    Corollary 1.1. Let p be a prime, we have the asymptotic formula

    p1m=0|p1a=0e(a4+map)|4=2p3+O(p52).

    Notes. If p>3, the corollary is obvious according to the theorems, now we declaration the condition p3.

    If p=2, according to Euler's formula, we have

    1m=0|1a=0e(a4+ma2)|4=1m=0|1+e(1+m2)|4=|1+e(12)|4+16=|1+cosπ+isinπ|4+16=16=2p3.

    Similarly, if p=3 we can verify the corollary. So the corollary holds for all the primes.

    In this section, we shall give six lemmas that are necessary in the proof of our theorems. According to the elementary and analytical methods, we use the properties of Gauss sums and the character sums to obtain the lemmas as follows:

    Lemma 2.1. Let p be a prime with p=4k+1, λ be a fourth-order character mod p, then we have the estimation

    τ(λ)p1a=0p1b=0¯λ(a4+b4(a+b1)41)=O(p32),

    where τ(λ)=p1a=0λ(a)e(ap) denotes the Gauss sums.

    Proof. By using the properties of fourth-order character and complete residue systems, we know that when a and b are integers, and they pass through a complete residue systems, a1, ab, ka, kb, a+b and 2a+b also pass through a complete residue systems, then we have

    τ(λ)p1a=0p1b=0¯λ(a4+b4(a+b1)41)=τ(λ)p1a=0p1b=0¯λ(4(b1)3+6(b1)2+4(b1)4a(b1)36a2(b1)24a3(b1))=τ(λ)p1a=0p1b=0¯λ(4b3+6b2+4b4ab36a2b24a3b)=τ(λ)p1a=0p1b=1¯λ(4b3+6b2+4b4ab46a2b44a3b4)=τ(λ)p1a=0p1b=1¯λ(b4)¯λ(4¯b+6¯b2+4¯b34a6a24a3).

    For λ be a fourth-order character mod p, then ¯λ(b4)=1, so we have

    τ(λ)p1a=0p1b=1¯λ(4¯b+6¯b2+4¯b34a6a24a3)=τ(λ)p1a=0p1b=0¯λ(4b3+6b2+4b4a36a24a)τ(λ)p1a=0¯λ(4a36a24a)=τ(λ)λ(2)p1a=0p1b=0¯λ(8b3+12b2+8b8a312a28a)+O(p)=τ(λ)λ(2)p1a=0p1b=0¯λ((2b)3+3(2b)2+4(2b)(2a)33(2a)24(2a))+O(p).

    According to the properties of the reduced residue system mod p, we are aware of that if a and b pass through a reduced residue system mod p respectively, obviously, 2a and 2b also pass through the same reduced residue system mod p. So, in the formula ((2b)3+3(2b)2+4(2b)(2a)33(2a)24(2a)) above, we change 2b into b, 2a into a, that equals (b3+3b2+4ba33a24a) mod p. Therefore, we can conclude that

    τ(λ)λ(2)p1a=0p1b=0¯λ((2b)3+3(2b)2+4(2b)(2a)33(2a)24(2a))+O(p)=τ(λ)λ(2)p1a=0p1b=0¯λ(b3+3b2+4ba33a24a)+O(p)=τ(λ)λ(2)p1a=0p1b=0¯λ(b3+3b2+3b+1+b+1a33a23a1a1)+O(p)=τ(λ)λ(2)p1a=0p1b=0¯λ((b+1)3+(b+1)(a+1)3(a+1))+O(p)=τ(λ)λ(2)p1a=0p1b=0¯λ(b3+ba3a)+O(p)=τ(λ)λ(2)p1a=0p1b=0¯λ(b3+3b2a+3ba2+a3+b+aa3a)+O(p)=τ(λ)λ(2)p1a=0p1b=0¯λ(b3+3b2a+3ba2+b)+O(p)=τ(λ)λ(8)p1a=0p1b=0¯λ(b3+3b(2a+b)2+4b)+O(p)=τ(λ)¯λ(2)p1a=0p1b=0¯λ(b3+3ba2+4b)+O(p). (2.1)

    Let χ2=(p), where (p) be the Legendre symbol, directly by using of the conclusions in the reference [8, Lemma 1], we have

    p1a=0p1b=0¯λ(b3+3ba2+4b)=τ(λχ2)τ(λ)p1b=0C(1,0,2;p)χ2(3b4+12b2)¯λ(b3+4b)=C2(1,0,2;p)pp1a=1¯λ(a)χ2(1a)p1b=0χ2(3b4+12b2)¯λ(b3+4b)=χ2(3)p1a=1¯λ(a)χ2(1a)p1b=0χ2(b2+4)¯λ(b3+4b)=χ2(3)p1a=1¯λ(a)χ2(1a)p1b=0χ2(b2+4)¯λ(b2+4)¯λ(b)=χ2(3)p1a=1¯λ(a32a2+a)p1b=0λ(b3+4b), (2.2)

    where

    C(1,0,2;p)=p1a=0e(a2p)=τ(χ2).

    Therefore, we have

    τ(λ)p1a=0p1b=0¯λ(a4+b4(a+b1)41)=τ(λ)¯λ(2)p1a=0p1b=0¯λ(b3+3ba2+4b)=τ(λ)¯λ(2)χ2(3)p1a=1¯λ(a)χ2(1a)p1b=0χ2(b2+4)¯λ(b3+4b)=τ(λ)¯λ(2)χ2(3)p1a=1¯λ(a32a2+a)p1b=0λ(b3+4b).

    From Weil's classical work [9] we know that if χ is a q-th-order character to the prime modulo p, and if polynomial f(x) is not a perfect q-th power modulo p, then we have the estimate

    N+Hx=N+1χ(f(x))=O(p),

    where N and H are any positive integers. So from the estimate we have

    τ(λ)¯λ(2)χ2(3)p1a=1¯λ(a32a2+a)p1b=0λ(b3+4b)=O(p32). (2.3)

    Similarly, we also have

    τ(¯λ)p1a=0p1b=0λ(a4+b4(a+b1)41)=τ(¯λ)λ(2)χ2(3)p1a=1λ(a32a2+a)p1b=0¯λ(b3+4b)+O(p)=O(p32). (2.4)

    This proves Lemma 2.1.

    Lemma 2.2. If p>3 is a prime, χ2 denotes the Legendre symbol, then we have the following results:

    pp1a=0p1b=0χ2(a4+b4(a+b1)41)={2χ2(6)p32+O(p), if  p=4k+1,pχ2(4a3+6a2+4a), if   p=4k+3.

    Proof. From the properties of reduced residue system mod p and Gauss sums, we have

    pp1a=0p1b=0χ2(a4+b4(a+b1)41)=pp1a=0p1b=0χ2(4b3+6b2+4b4ab36a2b24a3b)=pp1a=0p1b=1χ2(4b3+6b2+4b4ab36a2b24a3b)=pp1a=0p1b=0χ2(4b3+6b2+4b4a36a24a)χ2(1)pp1a=0χ2(4a3+6a2+4a)=χ2(2)pp1a=0p1b=0χ2(8b3+12b2+8b8a312a28a)χ2(1)pp1a=0χ2(4a3+6a2+4a)=χ2(2)pp1a=0p1b=0χ2((2b)3+3(2b)2+4(2b)(2a)33(2a)24(2a))χ2(1)pp1a=0χ2(4a3+6a2+4a)=χ2(2)pp1a=0p1b=0χ2((b3+3b2+4ba33a24a)χ2(1)pp1a=0χ2(4a3+6a2+4a)=χ2(2)pp1a=0p1b=0χ2((b+1)3+(b+1)(a+1)3(a+1))χ2(1)pp1a=0χ2(4a3+6a2+4a)=χ2(2)pp1a=0p1b=0χ2(b3+ba3a)χ2(1)pp1a=0χ2(4a3+6a2+4a). (2.5)

    Let p be a prime with p=4k+1, note that χ2(1)=1, then the formula (2.5) equals to

    pp1a=0p1b=0χ2(a4+b4(a+b1)41)=χ2(2)pp1a=0p1b=1χ2(b3+3ba2+4b)pp1a=0χ2(4a3+6a2+4a)=χ2(2)p32p1b=1b3+4b0modpχ2(3b)p1b=1χ2(3b)pp1a=0χ2(4a3+6a2+4a)=χ2(2)p32p1b=1b2+10modpχ2(6b)pp1a=0χ2(4a3+6a2+4a)=2χ2(6)p32pp1a=0χ2(4a3+6a2+4a)=2χ2(6)p32+O(p). (2.6)

    On the other hand, let p>3 be an odd prime with p=4k+3, χ2(1)=1, then we have the identity

    χ2(2)pp1a=0p1b=0χ2(b3+ba3a)=χ2(2)pp1a=0p1b=0χ2(b3b+a3+a)=χ2(2)pp1a=0p1b=0χ2(b3+ba3a)=0. (2.7)

    Combining the identities (2.5) and (2.7), for any prime p>3, if p=4k+3, we obtain

    pp1a=0p1b=0χ2(a4+b4(a+b1)41)=pχ2(4a3+6a2+4a). (2.8)

    Combining the identities (2.6) and (2.8), for any prime p>3, we have the following results:

    pp1a=0p1b=0χ2(a4+b4(a+b1)41)={2χ2(6)p32+O(p), if   p=4k+1,pχ2(4a3+6a2+4a), if   p=4k+3.

    This proves Lemma 2.2.

    Lemma 2.3. Let p>3 be a prime with p=4k+1, λ be a fourth-order character mod p and χ2 denotes the Legendre symbol, then we have the asymptotic formula

    p1a=0p1b=0p1c=0p1d=0a+bc+1modpe(d4(a4+b4c41)p)=3p2+O(p32).

    Proof. Note that λ is a fourth-order character mod p, and χ2 denotes the Legendre symbol, so, if p1mod4, then from the formulas (2.3) and (2.4) we have

    p1a=0p1b=0p1c=0p1d=0a+bc+1modpe(d4(a4+b4c41)p)=p1a=0p1b=0p1c=0p1d=0a+bc+1modp(1+λ(d)+χ2(d)+¯λ(d))e(d(a4+b4c41)p)=pp1a=0p1b=0p1c=0a4+b4c4+1modpa+bc+1modp1+p1a=0p1b=0p1d=0(λ(d)+χ2(d)+¯λ(d))e(d(a4+b4(a+b1)41)p)=τ(λ)p1a=0p1b=0¯λ(a4+b4(a+b1)41)+τ(¯λ)p1a=0p1b=0λ(a4+b4(a+b1)41)+pp1a=0p1b=0χ2(a4+b4(a+b1)41)+pp1a=0p1b=0p1c=0a4+b4c4+1modpa+bc+1modp1=2χ2(6)p32+τ(λ)¯λ(2)χ2(3)p1a=1¯λ(a32a2+a)p1b=0λ(b3+4b)+pp1a=0p1b=0p1c=0a4+b4c4+1modpa+bc+1modp1+τ(¯λ)λ(2)χ2(3)p1a=1λ(a32a2+a)p1b=0¯λ(b3+4b)+O(p)=pp1a=0p1b=0p1c=0a4+b4c4+1modpa+bc+1modp1+O(p32), (2.9)

    where

    p1d=0e(md4p)=p1d=0(1+χ2(d))e(md2p)=p1d=0e(md2p)=p1d=0(1+χ2(d))e(mdp).

    From L. Chen and X. Wang [7], for any prime p>3, if p=24k+13 or p=24k+1, we have

    p1a=0p1b=0p1c=0a4+b4c4+1modpa+bc+1modp1=3p5χ2(7). (2.10)

    For any prime p>3, if p=24k+5 or p=24k+17, we have

    p1a=0p1b=0p1c=0a4+b4c4+1modpa+bc+1modp1=3p1χ2(7). (2.11)

    Thus, for any prime p>3, we have the asymptotic formula

    p1a=0p1b=0p1c=0p1d=0a+bc+1modpe(d4(a4+b4c41)p)=3p2+O(p32).

    This proves Lemma 2.3.

    Lemma 2.4. Let p>3 be a prime with p=4k+3, λ be a fourth-order character mod p and χ2 denotes the Legendre symbol, then we have the identity

    p1a=0p1b=0p1c=0p1d=0a+bc+1modpe(d4(a4+b4c41)p)={3p25p+χ2(7)p+ipp1b=0χ2(4a3+6a2+4a), if   p=12k+7,3p2p+χ2(7)p+ipp1b=0χ2(4a3+6a2+4a), if   p=12k+11.

    Proof. Note that τ(χ2)=ip when p3mod4, then from the definition of Gauss sums and identity (2.8), we have

    p1a=0p1b=0p1c=0p1d=0a+bc+1modpe(d4(a4+b4c41)p)=p1a=0p1b=0p1c=0p1d=0a+bc+1modp(1+χ2(d))e(d(a4+b4c41)p)=pp1a=0p1b=0p1c=0a4+b4c4+1modpa+bc+1modp1+p1a=0p1b=0p1d=0χ2(d)e(d(a4+b4(a+b1)41)p)=ipp1a=0p1b=0χ2(a4+b4(a+b1)41)+pp1a=0p1b=0p1c=0a4+b4c4+1modpa+bc+1modp1=pp1a=0p1b=0p1c=0a4+b4c4+1modpa+bc+1modp1+ipp1b=0χ2(4a3+6a2+4a), (2.12)

    From L. Chen and X. Wang [7], for any prime p>3, if p=12k+7, we have

    p1a=0p1b=0p1c=0a4+b4c4+1modpa+bc+1modp1=3p5+χ2(7). (2.13)

    If p=12k+11, we have

    p1a=0p1b=0p1c=0a4+b4c4+1modpa+bc+1modp1=3p1+χ2(7). (2.14)

    So for any prime p>3, if p3mod4, combining the formulas (2.12)-(2.14), we have

    p1a=0p1b=0p1c=0p1d=0a+bc+1modpe(d4(a4+b4c41)p)={3p25p+χ2(7)p+ipp1b=0χ2(4a3+6a2+4a), if   p=12k+7,3p2p+χ2(7)p+ipp1b=0χ2(4a3+6a2+4a), if   p=12k+11.

    This proves Lemma 2.4.

    Lemma 2.5. Let p>3 be a prime with p=4k+1, λ be a fourth-order character mod p and χ2 denotes the Legendre symbol, then we have the estimation

    p1a=0p1b=0p1c=0a+bcmodpe(a4+b4c4p)=O(p).

    Proof. Note that τ(χ2)=p when p1mod4, then from the definition of Gauss sums we have

    p1a=0p1b=0p1c=0a+bcmodpe(a4+b4c4p)=p1a=0p1b=0a+b0modpe(a4+b4p)+p1a=0p1b=0p1c=1a+bcmodpe(a4+b4c4p)=p1a=0e(2a4p)+p1a=0p1b=0p1c=1a+b1modpe(c4(a4+b41)p)=p1a=0(1+λ(a)+χ2(a)+¯λ(a))e(2ap)+p1a=0p1b=0p1c=0a+b1modpe(c4(a4+b41)p)p1a=0p1b=0a+b1modp1=τ(λ)¯λ(2)+χ(2)p+τ(¯λ)λ(2)+p1a=0p1c=0(λ(c)+χ2(c)+¯λ(c))e(c(2a44a3+6a24a)p)+pp1a=0p1b=0a4+b41modpa+b1modp1p. (2.15)

    For any prime p>3, note that the properties of Gauss sums, we have

    p1a=0p1c=0(λ(c)+χ2(c)+¯λ(c))e(c(2a44a3+6a24a)p)=p1a=0τ(λ)¯λ(2a44a3+6a24a)+p1a=0τ(¯λ)λ(2a44a3+6a24a)+pp1a=0χ2(2a44a3+6a24a)=λ(8)τ(λ)p1a=0¯λ((2a)44(2a)3+12(2a)216(2a))+¯λ(8)τ(¯λ)p1a=0λ((2a)44(2a)3+12(2a)216(2a))+pχ2(2)p1a=0χ2((2a)44(2a)3+12(2a)216(2a))=λ(8)τ(λ)p1a=0¯λ(a44a3+12a216a)+¯λ(8)τ(¯λ)p1a=0λ(a44a3+12a216a)+pχ2(2)p1a=0χ2(a44a3+12a216a)=λ(8)τ(λ)p1a=0¯λ((a1)4+6(a1)27)+¯λ(8)τ(¯λ)p1a=0λ((a1)4+6(a1)27)+pχ2(2)p1a=0χ2((a1)4+6(a1)27)=λ(8)τ(λ)p1a=0¯λ(a4+6a27)+¯λ(8)τ(¯λ)p1a=0λ(a4+6a27)+pχ2(2)p1a=0χ2(a4+6a27)=¯λ(2)τ(λ)p1a=0¯λ(a4+6a27)+λ(2)τ(¯λ)p1a=0λ(a4+6a27)+pχ2(2)p1a=0χ2(a4+6a27)=O(p). (2.16)

    Combining the formulas (2.15) and (2.16), we have the estimation

    p1a=0p1b=0p1c=0a+bcmodpe(a4+b4c4p)=O(p).

    This proves Lemma 2.5.

    Lemma 2.6. Let p be an odd prime with p=4k+3, χ2 denotes the Legendre symbol. Then we have the identity

    p1a=0p1b=0p1c=0a+bcmodpe(a4+b4c4p)=(2χ2(7))pipp1a=0χ2(4a3+6a2+4a).

    Proof. For any prime p>3, if p=4k+3, then χ2(1)=1 and τ(χ2)=ip, we have

    p1a=0p1b=0p1c=0a+bcmodpe(a4+b4c4p)=p1a=0p1c=0acmodpe(a4c4p)+p1a=0p1b=1p1c=0a+bcmodpe(a4+b4c4p)=p+p1a=0p1b=1p1c=0a+1cmodpe(b4(a4c4+1)p)=p+p1a=0p1b=0p1c=0a+1cmodpe(b4(a4c4+1)p)p1a=0p1c=0a+1cmodp1=p1a=0p1b=0p1c=0a+1cmodp(1+χ2(b))e(b(a4c4+1)p)=ipp1a=0χ2(4a36a24a)+pp1a=0p1c=0a4+1c4modpa+1cmodp1=ipp1a=0χ2(4a36a24a)+pp1a=02a3+3a2+2a0modp1=ipp1a=0χ2(4a36a24a)+p+pp1a=12a2+3a+20modp1=ipp1a=0χ2(4a36a24a)+p+pp1a=0(4a+3)27modp1=ipp1a=0χ2(4a36a24a)+(2χ2(7))p. (2.17)

    So for any prime p>3, if p3mod4, we have the identity

    p1a=0p1b=0p1c=0a+bcmodpe(a4+b4c4p)=(2χ2(7))pipp1a=0χ2(4a3+6a2+4a).

    This proves Lemma 2.6.

    In this section, we will complete the proofs of our theorems. Applying several basic lemmas in Section 2, we can easily deduce our theorems.

    p1m=0|p1a=0e(a4+map)|4=p1a=0p1b=0p1c=0p1d=0p1m=0e(a4+b4c4d4+m(a+bcd)p)=pp1a=0p1b=0p1c=0p1d=0a+bc+dmodpe(a4+b4c4d4p)=pp1a=0p1b=0p1c=0a+bcmodpe(a4+b4c4p)+pp1a=0p1b=0p1c=0p1d=1a+bc+dmodpe(a4+b4c4d4p)=pp1a=0p1b=0p1c=0a+bcmodpe(a4+b4c4p)+pp1a=0p1b=0p1c=0p1d=1a+bc+1modpe(d4(a4+b4c41)p)=pp1a=0p1b=0p1c=0a+bcmodpe(a4+b4c4p)+pp1a=0p1b=0p1c=0p1d=0a+bc+1modpe(d4(a4+b4c41)p)pp1a=0p1b=0p1c=0a+bc+1modp1. (3.1)

    For any prime p, if p=4k+1, then from Lemma 2.3 we know that

    pp1a=0p1b=0p1c=0p1d=0a+bc+1modpe(d4(a4+b4c41)p)=3p3+O(p52). (3.2)

    From Lemma 2.5 we know that

    pp1a=0p1b=0p1c=0a+bcmodpe(a4+b4c4p)=O(p2). (3.3)

    Therefore, from the formulas (3.1)-(3.3), we may immediately deduce

    p1m=0|p1a=0e(a4+map)|4=2p3+O(p52),

    when p=4k+1. This proves Theorem 1.1.

    For any prime p>3, if p=4k+3, then from Lemma 2.4 we know that

    pp1a=0p1b=0p1c=0p1d=0a+bc+1modpe(d4(a4+b4c41)p)={3p35p2+χ2(7)p2+ip32p1b=0χ2(4a3+6a2+4a), if\ p = 12k+7 , 3p3p2+χ2(7)p2+ip32p1b=0χ2(4a3+6a2+4a), if\ p = 12k+11 . (3.4)

    From Lemma 2.6 we know that

    pp1a=0p1b=0p1c=0a+bcmodpe(a4+b4c4p)=(2χ2(7))p2ip32p1a=0χ2(4a3+6a2+4a). (3.5)

    Therefore, from the formulas (3.1), (3.4) and (3.5), for any prime p>3, we may immediately deduce

    p1m=0|p1a=0e(a4+map)|4={2p33p2, if  p=12k+7,2p3+p2, if   p=12k+11,

    when p=4k+3. This completes the proof of our main results.

    This paper mainly proposed two theorems, which are all closely related to the fourth power mean of the two-term exponential sums. Theorem 1.1 obtained an asymptotic formula of p1mod4 and an exact formula of p3mod4. The skill of this paper is to solve a class of quartic congruence equations in the process of calculation. In general, this work not only calculates a new kind of two-term exponential sum but also lays a foundation for the follow-up study of related problems.

    This work was supported by the Youth Science and Technology New Star Program of Shaanxi Province (2019KJXX-076), and the Natural Science Basic Research Program of Shaanxi Province (2022JM-013).

    The authors declare that there are no conflicts of interest regarding the publication of this paper.



    [1] T. Cochrane, Z. Y. Zheng, Bounds for certain exponential sums, Asian J. Math., 4 (2000), 757-774. https://doi.org/10.4310/AJM.2000.v4.n4.a3 doi: 10.4310/AJM.2000.v4.n4.a3
    [2] T. Cochrane, C. Pinner, Using Stepanov's method for exponential sums involving rational functions, J. Number Theory, 116 (2006), 270-292. https://doi.org/10.1016/j.jnt.2005.04.001 doi: 10.1016/j.jnt.2005.04.001
    [3] T. Cochrane, Z. Y. Zheng, Upper bounds on a two-term exponential sums, Sci. China Ser. A Math., 44 (2001), 1003-1015. https://doi.org/10.1007/BF02878976 doi: 10.1007/BF02878976
    [4] T. Cochrane, J. Coffelt, C. Pinner, A further refinement of Mordell's bound on exponential sums, Act Arith., 116 (2005), 35-41. https://doi.org/10.4064/aa116-1-4 doi: 10.4064/aa116-1-4
    [5] H. Zhang, W. P. Zhang, The fourth power mean of two-term exponential sums and its application, Math. Reports, 19 (2017), 75-83.
    [6] Z. Y. Chen, W. P. Zhang, On the fourth-order linear recurrence formula related to classical Gauss sums, Open Math., 15 (2017), 1251-1255. https://doi.org/10.1515/math-2017-0104 doi: 10.1515/math-2017-0104
    [7] C. Li, W. Xiao, A new fourth power mean of two-term exponential sums, Open Math., 17 (2019), 407-414. https://doi.org/10.1515/math-2019-0034 doi: 10.1515/math-2019-0034
    [8] W. P. Zhang, D. Han, On the sixth power mean of the two-term exponential sums, J. Number Theory, 136 (2014), 403-413. https://doi.org/10.1016/j.jnt.2013.10.022 doi: 10.1016/j.jnt.2013.10.022
    [9] D. A. Burgess, On Dirichlet characters of polynomials, Proc. London Math. Soc., s3-13 (1963), 537-548. https://doi.org/10.1112/plms/s3-13.1.537 doi: 10.1112/plms/s3-13.1.537
  • This article has been cited by:

    1. Guohui Chen, Wenpeng Zhang, One kind two-term exponential sums weighted by third-order character, 2024, 9, 2473-6988, 9597, 10.3934/math.2024469
    2. Guohui Chen, Tingting Du, The Fourth Hybrid Power Mean Involving the Character Sums and Exponential Sums, 2025, 13, 2227-7390, 1680, 10.3390/math13101680
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1927) PDF downloads(81) Cited by(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog