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

The hybrid power mean of some special character sums of polynomials and two-term exponential sums modulo p

  • We consider the calculation problem of one kind hybrid power mean involving the character sums of polynomials and two-term exponential sums modulo p, an odd prime, and use the analytic method and the properties of classical Gauss sums to give some identities and asymptotic formulas for them.

    Citation: Wenpeng Zhang, Jiafan Zhang. The hybrid power mean of some special character sums of polynomials and two-term exponential sums modulo p[J]. AIMS Mathematics, 2021, 6(10): 10989-11004. doi: 10.3934/math.2021638

    Related Papers:

    [1] 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
    [2] 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
    [3] Jinmin Yu, Renjie Yuan, Tingting Wang . The fourth power mean value of one kind two-term exponential sums. AIMS Mathematics, 2022, 7(9): 17045-17060. doi: 10.3934/math.2022937
    [4] Wenjia Guo, Xiaoge Liu, Tianping Zhang . Dirichlet characters of the rational polynomials. AIMS Mathematics, 2022, 7(3): 3494-3508. doi: 10.3934/math.2022194
    [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] 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
    [7] 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
    [8] 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
    [9] 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
    [10] Xi Liu . Some identities involving Gauss sums. AIMS Mathematics, 2022, 7(2): 3250-3257. doi: 10.3934/math.2022180
  • We consider the calculation problem of one kind hybrid power mean involving the character sums of polynomials and two-term exponential sums modulo p, an odd prime, and use the analytic method and the properties of classical Gauss sums to give some identities and asymptotic formulas for them.



    The so-called character sums of polynomials means that

    S(χ,f;q)=N+Ma=N+1χ(f(a)),

    where q3 is an integer, χ is any non-principal Dirichlet character modulo q, N and M are positive integers with 1Mq, f(x) is a rational coefficient polynomial of x with degree n.

    Many classic problems in analytic number theory related to the upper bound estimation of S(χ,f;q). For example, the least quadratic non-residue and the primitive root, etc. Therefore, some experts and scholars in the number theory have studied the estimate problem of S(χ,f;q), and obtained many meaningful results. The first thing worth mentioning is Pˊolya and Vinogradov's classical work (see [1]: Theorem 8.21 and Theorem 13.15), they proved that for any non-principal character χmodq, one has the estimate

    N+Ma=N+1χ(a)q12lnq,

    where the symbol AB denotes |A|<cB for some constant c.

    If q=p is an odd prime, A. Weil [4] (or refer to D.A.Burgess [8]) obtained a general conclusion. That is, if χ is a k-th character mod p, polynomial f(x) is not a perfect k-th power mod p, then we have the upper bound estimate

    |N+Mx=N+1χ(f(x))|p12lnp. (1.1)

    In fact, the estimate in (1.1) is the best one, it is impossible to improve the main term p12 in (1.1). Even for the minor term lnp in (1.1), it is also difficult to improve, and it can not even be improved to lnλp for any fixed real number 0<λ<1. Of course, there are many characters modq and special polynomials f(x) (see references [5,6] for details), they satisfy the identity

    |qa=1χ(f(a))|=q.

    For example, if p is an odd prime, for non-real character χmodp, then from the separable Gauss sums (see the Theorem 8.19 in [1]) we have

    |p1a=0χ(a2+1)|=|1+p1a=1(1+χ2(a))χ(a+1)|=|p1a=1χ2(a)χ(a+1)|=|1τ(¯χ)p1b=1¯χ(b)p1a=1χ2(a)e(ba+bp)|=1p|τ(χ2)τ(¯χχ2)|=p,

    where χ2 denotes the Legendre symbol mod p.

    For other papers related the character sums of polynomials, see [7,8,9,10], we will not list them all in here.

    In addition, we will introduce the two-term exponential sums which are used in this paper. For integers m and n, the definition of the two-term exponential sums G(m,n,h,k;q) is

    G(m,n,h,k;q)=qa=0e(mah+nakq),

    where as usual, we abbreviate e2πiy to e(y), and h>k1 are integers.

    In the vast majority of cases, we only consider the case h>1 and k=1. If q=p is an odd prime, these two-term exponential sums are closely related to Fourier analysis on finite fields. In this special case, W. P. Zhang and D. Han [11] obtained an identity for the sixth power mean of the two-term exponential sums. Some related papers can also be found in [12,13,14,15].

    In this paper, we will consider the hybrid power mean involving character sums of polynomials and two-term exponential sums

    p1m=1|p1a=1χ(mah+ak)|2|p1b=0e(mb4+bp)|2. (1.2)

    For this kind hybrid power mean, if p>3 is a prime with (3,p1)=1, and for non-principal even character χmodp, X. Y. Du [14] provided the following identity

    p1m=0|p1a=1χ(ma3+a)|2|p1b=1e(mb3+bp)|2=2p(p2p1)p(2+(3p))p1u=1¯χ(u)p1a=1((a1)(a3u2)p),

    where (p)=χ2 is the Legendre symbol mod p.

    From Du's [14] we may immediately deduce the asymptotic formula:

    p1m=0|p1a=1χ(ma3+a)|2|p1b=1e(mb3+bp)|2=2p3+O(p2).

    The mean values in Du's [14] or in (1.2) are meaningful, that is to say, from an average of sense, most values of these character sums of polynomials and two-term exponential sums are almost p. In addition, the result in [14] shows that the size of values of these character sums of polynomials and two-term exponential sums are complementary, from a probabilistic point of view, their product are almost p. Of course, it would make more sense to give an exact computational formula for these kind mean values. This is our ultimate goal and we believe it is possible.

    The main purpose of this article is to illustrate this point. That is, we used the analytic methods and the properties of the classical Gauss sums to obtain some identities and asymptotic formulas for (1.2) with h=5 and k=1, and proved the following results.

    Theorem 1. Let p be an odd prime with 4(p1). Then for any non-principal even character χmodp (i.e., χ(1)=1), we have the identity

    p1m=1|p1a=1χ(a5+ma)|2|p1a=0e(ma4+ap)|2={2p2(p1),ifχ5χ0,p(p21),ifχ5=χ0,

    where χ0 denotes the principal character modulo p.

    Theorem 2. If p is an odd prime with 4(p1), then for any fourth character χmodp (χ is the fourth character mod p if and only if there exists a character χ1modp such that χ=χ41χ0) with χ5χ0, we have the asymptotic formula

    p1m=1|p1a=1χ(a5+ma)|2|p1a=0e(ma4+ap)|2=4p3+O(p2);

    If χ is a fourth character modp with χ5=χ0, then we have

    p1m=1|p1a=1χ(a5+ma)|2|p1a=0e(ma4+ap)|2=3p3+O(p2).

    Some notes: We have not discussed the trivial cases in the above theorems. In fact, if χ is an odd character modp in Theorem 1 or χ is not a fourth character modp in Theorem 2, then we have the identity

    |p1a=1χ(a5+ma)|2=0.

    So in these cases, we have the trivial results:

    p1m=1|p1a=1χ(a5+ma)|2|p1a=0e(ma4+ap)|2=0.

    If p is a prime with 4(p1), then for any non-principal even character χmodp, whether there exists an exact computational formula for the mean value

    p1m=1|p1a=1χ(a5+ma)|2|p1a=0e(ma4+ap)|2 ?

    This is an open problem. We need to further study.

    In this part, we introduce some elementary properties related to the classical Gauss sums τ(χ) modulo q. As usual, the classical Gauss sums τ(χ) are defined as

    τ(χ)=qa=1χ(a)e(aq).

    Many of its properties can be found in analytic number theory textbooks, such as [1,2,3]. But there are two things we need to emphasize here. If χ is a primitive character modq, then

    qa=1χ(a)e(naq)=¯χ(n)τ(χ) and |τ(χ)|=q.

    By means of these properties, we can prove the following.

    Lemma 1. Let p be an odd prime with p1(mod4), m be any integer with (m,p)=1, χ2=(p) denote the Legendre symbol mod p, and β be a four-order character modp. That is, β4=χ22=χ0. If χ is not a fourth character modp, then we have

    |p1a=1χ(a5+ma)|2=0;

    If χ is a fourth character modp and χ5χ0, then we have the identity

    |p1a=1χ(a5+ma)|2=4p+χ2(m)p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1)+β(m)p1a=1χ(a)p1b=1¯β(b5a41)β(b1)+¯β(m)p1a=1χ(a)p1b=1β(b5a41)¯β(b1);

    If χ is a fourth character modp and χ5=χ0, then we have the identity

    |p1a=1χ(a5+ma)|2=3p+1+χ2(m)p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1)+β(m)p1a=1χ(a)p1b=1¯β(b5a41)β(b1)+¯β(m)p1a=1χ(a)p1b=1β(b5a41)¯β(b1).

    Proof. If χ is not a fourth character modp, then there exists an integer r such that r41(modp) and χ(r)1. So from the properties of the reduced residue system modp we have

    p1a=1χ(a5+ma)=p1a=1χ((ra)5+mra)=χ(r)p1a=1χ(r4a5+ma)=χ(r)p1a=1χ(a5+ma).

    Therefore, we have the identity

    |p1a=1χ(a5+ma)|2=0. (2.1)

    If χ is a fourth character mod p, then note that for any integer m with (m,p)=1 we have the identity

    p1a=0e(ma4p)=1+p1a=1(1+β(a)+β2(a)+¯β(a))e(map)=¯β(m)τ(β)+χ2(m)τ(χ2)+β(m)τ(¯β). (2.2)

    So if χ5χ0, then from the properties of Gauss sums we have

    |p1a=1χ(a5+ma)|2=|1τ(¯χ)p1b=1¯χ(b)p1a=1e(b(a5+ma)p)|2=1p|p1b=1¯χ(b¯a)p1a=1e(b¯a(a5+ma)p)|2 =1p|p1b=1¯χ(b)p1a=1χ(a)e(b(a4+m)p)|2,

    then expand the square and use the properties of the reduced residue system modp we obtain

    1pp1b=1p1d=1¯χ(b¯d)p1a=1p1c=1χ(a¯c)e(b(a4+m)d(c4+m)p)=1pp1a=1p1b=1χ(a¯b)p1c=1p1d=1e(dc4(ba41)+md(b1)p)=1pp1a=1p1b=1χ(a¯b)p1c=0p1d=1e(dc4(ba41)+md(b1)p),

    from the formula (2.2), the above formula is

    p1a=1p1b=1ba41modpχ(a¯b)p1d=1e(md(b1)p)+1pp1a=1p1b=1χ(a¯b)p1d=1β(d(ba41))τ(¯β)e(md(b1)p)+1pp1a=1p1b=1χ(a¯b)p1d=1¯β(d(ba41))τ(β)e(md(b1)p)+τ(χ2)pp1a=1p1b=1χ(a¯b)p1d=1χ2(d(ba41))e(md(b1)p)=p1a=1p1b=1ba41modpχ(a¯b)p1d=0e(md(b1)p)p1a=1p1b=1ba41modpχ(a¯b)+1pp1a=1p1b=1χ(a¯b)p1d=1β(d(ba41))τ(¯β)e(md(b1)p)+1pp1a=1p1b=1χ(a¯b)p1d=1¯β(d(ba41))τ(β)e(md(b1)p)+τ(χ2)pp1a=1p1b=1χ(a¯b)p1d=1χ2(d(ba41))e(md(b1)p)=pp1a=1a41modpχ(a)p1a=1χ5(a)+p1a=1p1b=1χ(a¯b)χ2(ba41)χ2(m(b1))+τ(β)τ(¯β)pp1a=1p1b=1χ(a¯b)β(ba41)¯β(m(b1))+τ(β)τ(¯β)pp1a=1p1b=1χ(a¯b)¯β(ba41)β(m(b1)). (2.3)

    Since χ5χ0, then we have p1a=1χ5(a)=0, from (2.3) we obtain

    |p1a=1χ(a5+ma)|2=4p+χ2(m)p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1)+β(m)p1a=1χ(a)p1b=1¯β(b5a41)β(b1)+¯β(m)p1a=1χ(a)p1b=1β(b5a41)¯β(b1),

    where we have used the identity τ(β)τ(¯β)=β(1)p.

    If χ5=χ0, then

    p1a=1χ5(a)=p1a=11=p1,

    from (2.3) we also have the identity

    |p1a=1χ(a5+ma)|2=3p+1+χ2(m)p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1)+β(m)p1a=1χ(a)p1b=1¯β(b5a41)β(b1)+¯β(m)p1a=1χ(a)p1b=1β(b5a41)¯β(b1). (2.4)

    This completes the proof of Lemma 1.

    Lemma 2. Let p be an odd prime with p3(mod4), m be any integer with (m,p)=1. If χ is not an even character modp, then we have

    |p1a=1χ(a5+ma)|2=0;

    If χ is an even character modp and χ5χ0, then we have the identity

    |p1a=1χ(a5+ma)|2=2pχ2(m)p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1);

    If χ is an even character modp and χ5=χ0, then we have the identity

    |p1a=1χ(a5+ma)|2=p+1χ2(m)p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1).

    Proof. If p3(mod4), then χ2(1)=1, so for any odd character χmodp, we have

    p1a=1χ(a5+ma)=p1a=1χ((a)5ma)=χ(1)p1a=1χ(a5+ma)=p1a=1χ(a5+ma).

    That is,

    |p1a=1χ(a5+ma)|2=0. (2.5)

    If 4(p1) and χ is an even character modp with χ5χ0, then for any integer m with (m,p)=1, note that

    p1a=0e(ma4p)=1+p1a=1(1+χ2(a))e(ma2p)=1+p1a=1e(ma2p)+p1a=1χ2(a)e(ma2p).

    Since 4(p1), χ2(1)=1, then we have

    p1a=1χ2(a)e(ma2p)=p1a=1χ2(a)e(ma2p)=p1a=1χ2(a)e(ma2p)=0.

    Combine the above two formulas we get

    p1a=0e(ma4p)=p1a=0e(ma2p)=1+p1a=1(1+χ2(a))e(map)=χ2(m)τ(χ2), (2.6)

    from the method of proving Lemma 1 we obtain

    |p1a=1χ(a5+ma)|2=p1a=1p1b=1ba41(modp)χ(a¯b)p1d=0e(md(b1)p)p1a=1p1b=1ba41(modp)χ(a¯b)+1pp1a=1p1b=1p(ba41)χ(a¯b)p1c=0p1d=1e(dc4(ba41)+md(b1)p).

    In the above formula, use equation (2.6) for p1c=0e(d(ba41)c4p) we have

    |p1a=1χ(a5+ma)|2=2pp1a=1χ(a5)+τ(χ2)pp1a=1p1b=1χ(a¯b)χ2(ba41)p1d=1χ2(d)e(md(b1)p)=2pχ2(m)p1a=1p1b=1χ(a)χ2(b5a41)χ2(b1), (2.7)

    where we have used τ2(χ2)=p, if p3(mod4).

    Similarly, if χ is an even character modp with χ5=χ0, then from the method of proving (2.7) we have

    |p1a=1χ(a5+ma)|2=p+1χ2(m)p1a=1p1b=1χ(a)χ2(b5a41)χ2(b1). (2.8)

    According to (2.7) and (2.8) we deduce Lemma 2.

    Lemma 3. Let p be an odd prime, then we have the identity

    p1m=0|p1a=0e(ma4+ap)|2={p(p3),if4(p1),p(p1),if4(p1).

    Proof. In fact, for any positive integer q>1, from the trigonometric identity

    qm=1e(nmq)={q,ifqn,0,ifqn

    and the properties of the reduced residue system modp we have

    p1m=0|p1a=0e(ma4+ap)|2=p1m=0|1+p1a=1e(ma4+ap)|2=p+p1a=1p1m=0e(ma4+ap)+p1a=1p1m=0e(ma4ap)+p1a=1p1b=1p1m=0e(mb4(a41)+b(a1)p)=p+pp1a=1a41(modp)p1b=1e(b(a1)p)=p+p(p1)pp1a=2a41(modp)1={p(p3),if4(p1),p(p1),if4(p1).

    This proves Lemma 3.

    Lemma 4. Let p be an odd prime with p1(mod4). Then for any four-order character λmodp, we have the identity

    p1m=1λ(m)|p1a=0e(ma4+ap)|2={2τ(χ2)τ(¯λ),if8(p1),0,if8(p1).

    Proof. Note that λ4=χ0, the principal character modp. Then expand the square we have

    p1m=1λ(m)|p1a=0e(ma4+ap)|2=p1m=1λ(m)+p1a=1p1m=1λ(m)e(ma4+ap)+p1a=1p1m=1λ(m)e(ma4ap)+p1a=1p1b=1p1m=1λ(m)e(mb4(a41)+b(a1)p),

    From the separability of Gauss sums and the trigonometric identity, the above formula is

    τ(λ)p1a=1¯λ4(a)e(ap)+λ(1)τ(λ)p1a=1¯λ4(a)e(ap)+τ(λ)p1a=1¯λ(a41)p1b=1¯λ4(b)e(b(a1)p)=τ(λ)λ(1)τ(λ)τ(λ)p1a=1¯λ(a41),

    Decrease the power of a in the above formula we get

    p1m=1λ(m)|p1a=0e(ma4+ap)|2=τ(λ)λ(1)τ(λ)τ(λ)p1a=1(1+λ(a)+χ2(a)+¯λ(a))¯λ(a1)=τ(λ)p1a=0¯λ(a1)τ(λ)p1a=0¯λ(1a)τ(λ)p1a=1χ2(a)¯λ(a1)τ(λ)p1a=1¯λ(a)¯λ(a1)=p1b=1λ(b)p1a=1χ2(a)e(b(a1)p)p1b=1λ(b)p1a=1¯λ(a)e(b(a1)p)=λ(1)τ(χ2)τ(¯λ)τ(χ2)τ(¯λ). (2.9)

    Note that λ(1)=1, if 4(p1) and 8(p1); λ(1)=1, if 8(p1). From (2.9) we may immediately deduce Lemma 4.

    Lemma 5. Let p be an odd prime with p1(mod4), then we have

    p1m=1χ2(m)|p1a=0e(ma4+ap)|2=λ(1)(τ2(λ)+τ2(¯λ)),

    where λ is any four-order character modp.

    Proof. Note that χ2(1)=1, from the method of proving Lemma 4 we have

    p1m=1χ2(m)|p1a=0e(ma4+ap)|2=p1m=1χ2(m)+p1a=1p1m=1χ2(m)e(ma4ap)+p1a=1p1m=1χ2(m)e(ma4+ap)+p1a=1p1b=1p1m=1χ2(m)e(mb4(a41)+b(a1)p)=2τ(χ2)+τ(χ2)p1a=1χ2(a41)p1b=1e(b(a1)p)=2τ(χ2)τ(χ2)p1a=1χ2(a41)=2τ(χ2)τ(χ2)p1a=1(1+λ(a)+χ2(a)+¯λ(a))χ2(a1)=2τ(χ2)τ(χ2)(p1a=1χ2(a1)+p1a=1λ(a)χ2(a1)+p1a=1χ2(1a)+p1a=1¯λ(a)χ2(a1))=λ(1)(τ2(λ)+τ2(¯λ)),

    where we have used

    p1a=1χ2(a1)+p1a=1χ2(1a)=χ2(1)χ2(1)=2,

    and

    p1a=1λ(a)χ2(a1)=1τ(χ2)p1a=1λ(a)p1b=1χ2(b)e(b(a1)p)=1τ(χ2)p1b=1χ2(b)p1a=1λ(a)e(bap)e(bp)=τ(λ)τ(χ2)p1b=1χ2(b)¯λ(b)e(bp)=τ(λ)τ(χ2)λ(1)τ(χ2¯λ)=λ(1)τ2(λ)τ(χ2).

    This proves Lemma 5.

    Lemma 6. Let p be an odd prime with p3(mod4), then we have the identity

    p1m=1χ2(m)|p1a=0e(ma4+ap)|2=0.

    Proof. Note that χ2(1)=1, from the properties of the complete residue system modp we have

    p1m=1χ2(m)|p1a=0e(ma4+ap)|2=p1m=1χ2(m)|p1a=0e(m(a)4+(a)p)|2=p1m=1χ2(m)|p1a=0e(ma4ap)|2=p1m=1χ2(m)|p1a=0e(ma4+ap)|2.

    So that we have

    p1m=1χ2(m)|p1a=0e(ma4+ap)|2=0.

    The lemma 6 is proved.

    Lemma 7. Let p be an odd prime with p1(mod4). Then for any non-principal fourth character χmodp, we have the estimate

    |p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1)|2+|p1a=1χ(a)p1b=1¯λ(b5a41)λ(b1)|2p2,

    where λ is any four-order character modp.

    Proof. Since 4(p1), so it is clear that there exists an integer 1<r<p1 such that r41(modp) and 1+λ(r)+λ(r2)+λ(r3)=0. For any integer m with (m,p)=1, note that λ(m)+λ(mr)+λ(r2m)+λ(r3m)=λ(m)(1+λ(r)+λ(r2)+λ(r3))=0, from Lemma 1 we know that for any fourth character χmodp with χ5χ0, we have the identity

    |p1a=1χ(a5+ma)|2+|p1a=1χ(a5+mra)|2+|p1a=1χ(a5+mr2a)|2+|p1a=1χ(a5+mr3a)|2=16p, (2.10)

    where we have used the following identity

    1+χ2(r)+χ2(r2)+χ2(r3)=2+2χ2(r)=0,

    which is because that

    1+λ(r)+λ(r2)+λ(r3)=1+λ(r)+χ2(r)+χ2(r)λ(r)=(1+λ(r))(1+χ2(r))=0,

    where λ(r)=1, then χ2(r)=1.

    Therefore, for i=0, 1, 2, 3, applying (2.10) we have the estimate

    |p1a=1χ(a5+mria)|216p. (2.11)

    On the other hand, note that λ3(m)=¯λ(m) and λ2(m)=χ2(m), applying Lemma 1 and the identity 1+λ(r)+λ(r2)+λ(r3)=0 we also have

    |p1a=1χ(a5+ma)|4+|p1a=1χ(a5+mra)|4+|p1a=1χ(a5+mr2a)|4+|p1a=1χ(a5+mr3a)|4=64p2+4|p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1)|2+8|p1a=1χ(a)p1b=1¯λ(b5a41)λ(b1)|2. (2.12)

    Combining (2.11) and (2.12) we can get the estimate

    |p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1)|2+|p1a=1χ(a)p1b=1¯λ(b5a41)λ(b1)|2p2.

    This proves Lemma 7.

    Now we shall prove our main results. First we prove Theorem 1. If 4(p1), then for any even character χmodp with χ5χ0, from Lemma 2, Lemma 3 and Lemma 6 we have

    p1m=1|p1a=1χ(a5+ma)|2|p1a=0e(ma4+ap)|2=2pp1m=1|p1a=0e(ma4+ap)|2p1m=1χ2(m)|p1a=0e(ma4+ap)|2(p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1))=2p2(p1). (3.1)

    Similarly, if χ(1)=1 and χ5=χ0, then from Lemma 2, Lemma 3 and Lemma 6 we also have

    p1m=1|p1a=1χ(a5+ma)|2|p1a=0e(ma4+ap)|2=p(p21). (3.2)

    Combining (3.1) and (3.2) we proved Theorem 1.

    Proof of Theorem 2. If 4(p1), then for fourth character χmodp with χ5χ0, from Lemma 1 we have

    p1m=1|p1a=1χ(a5+ma)|2|p1a=0e(ma4+ap)|2=4pp1m=1|p1a=0e(ma4+ap)|2+p1m=1χ2(m)|p1a=0e(ma4+ap)|2(p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1))+p1m=1λ(m)|p1a=0e(ma4+ap)|2(p1a=1χ(a)p1b=1¯λ(b5a41)λ(b1))+p1m=1¯λ(m)|p1a=0e(ma4+ap)|2(p1a=1χ(a)p1b=1λ(b5a41)¯λ(b1)) (3.3)

    If 8|(p-1), put the results of the Lemma 3, Lemma 4, Lemma 5 and Lemma 7 into (3.3) we obtain

    p1m=1|p1a=1χ(a5+ma)|2|p1a=0e(ma4+ap)|2=4pp(p3)(τ2(λ)+τ2(¯λ))(p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1))2τ(χ2)τ(¯λ)(p1a=1χ(a)p1b=1¯λ(b5a41)λ(b1))2τ(χ2)τ(λ)(p1a=1χ(a)p1b=1λ(b5a41)¯λ(b1))=4p2(p3)+O(p2).

    If 8(p1), put the results of the Lemma 3, Lemma 4, Lemma 5 and Lemma 7 into (3.3) we obtain

    p1m=1|p1a=1χ(a5+ma)|2|p1a=0e(ma4+ap)|2=4pp(p3)+(τ2(λ)+τ2(¯λ))(p1a=1χ(a)p1b=1χ2(b5a41)χ2(b1)).

    Combining the above two formulas is easy to get

    p1m=1|p1a=1χ(a5+ma)|2|p1a=0e(ma4+ap)|2=4p2(p3)+O(p2)=4p3+O(p2). (3.4)

    If χ is a fourth character modp with χ5=χ0, then from Lemma 1 and the method of proving (3.4) we also have the asymptotic formula

    p1m=1|p1a=1χ(a5+ma)|2|p1a=0e(ma4+ap)|2=3p3+O(p2). (3.5)

    It is clear that Theorem 2 follows from (3.4) and (3.5).

    This completes the proofs of our all results.

    The main results of this paper are two theorems. Let p be an odd prime with 4(p1), for any non-principal even character χmodp, the Theorem 1 gives exact calculating formulas for (1.2) with h=5 and k=1. Let p be an odd prime with 4(p1), for any fourth character χmodp, the Theorem 2 gives asymptotic formulas for (1.2) with h=5 and k=1. As a supplement, the value of (1.2) with h=5 and k=1 in the trivial cases are given in the Some notes.

    The authors would like to thank the referees for their very helpful and detailed comments. This work is supported by the N. S. F. (11771351) of P. R. China.

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



    [1] T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, New York, 1976.
    [2] C. D. Pan, C. B. Pan, Goldbach Conjecture, Science Press, Beijing, 1992.
    [3] K. Ireland, M. Rosen, A classical introduction to modern number theory, Springer-Verlag, New York, 1982.
    [4] A. Weil, Sur les courbes algébriques et les variétés qui s'en déduisent, Actualités math. sci., No. 1041 (Paris, 1945), deuxième partie, § IV.
    [5] W. P. Zhang, Y. Yi, On Dirichlet characters of polynomials, Bull. London Math. Soc., 34 (2002), 469–473. doi: 10.1112/S0024609302001030
    [6] W. P. Zhang, W. L. Yao, A note on the Dirichlet characters of polynomials, Acta Arith., 115 (2004), 225–229. doi: 10.4064/aa115-3-3
    [7] D. A. Burgess, On character sums and primitive roots, Proc. London Math. Soc., 12 (1962), 179–192.
    [8] D. A. Burgess, On Dirichlet characters of polynomials, Proc. London Math. Soc., 13 (1963), 537–548.
    [9] A. Granville, K. Soundararajan, Large character sums: Pretentious characters and the Pˊolya-Vinogradov theorem, J. Amer. Math. Soc., 20 (2007), 357–384.
    [10] J. Bourgain, M. Z. Garaev, S. V. Konyagin, I. E. Shparlinski, On the hidden shifted power problem, SIAM J. Comput., 41 (2012), 1524–1557. doi: 10.1137/110850414
    [11] W. P. Zhang, D. Han, On the sixth power mean of the two-term exponential sums, J. Number Theory, 136 (2014), 403–413. doi: 10.1016/j.jnt.2013.10.022
    [12] D. Han, A Hybrid mean value involving two-term exponential sums and polynomial character sums, Czech. Math. J., 64 (2014), 53–62. doi: 10.1007/s10587-014-0082-0
    [13] H. Zhang, W. P. Zhang, The fourth power mean of two-term exponential sums and its application, Math. Rep., 19 (2017), 75–81.
    [14] X. Y. Du, The hybrid power mean of two-term exponential sums and character sums, Acta Math. Sinica (Chinese Series), 59 (2016), 309–316.
    [15] W. P. Zhang, J. Y. Hu, The number of solutions of the diagonal cubic congruence equation modp, Math. Rep., 20 (2018), 60–66.
  • This article has been cited by:

    1. Zhangrui Sun, Di Han, On the hybrid mean value of two-term exponential sums and character sums of polynomials, 2025, 0363-1672, 10.1007/s10986-025-09675-1
  • Reader Comments
  • © 2021 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(2831) PDF downloads(191) Cited by(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog