On the Waring-Goldbach problem for one cube and nine biquadrates

Jinjiang LI , Min ZHANG

Front. Math. China ›› 2024, Vol. 19 ›› Issue (4) : 229 -246.

PDF (493KB)
Front. Math. China ›› 2024, Vol. 19 ›› Issue (4) : 229 -246. DOI: 10.3868/s140-DDD-024-0014-x
RESEARCH ARTICLE

On the Waring-Goldbach problem for one cube and nine biquadrates

Author information +
History +
PDF (493KB)

Abstract

Let N be a sufficiently large integer. In this paper, it is proved that with at most O(N1718+ε)exceptions, all positive integers satisfying some necessary congruence conditions up to N can be represented in the form p13+p24+p34+p44+p54+p64+p74+p84+p94+p104, where p1,p2,,p10 are prime numbers.

Keywords

Waring-Goldbach problem / Hardy-Littlewood method / exceptional set

Cite this article

Download citation ▾
Jinjiang LI, Min ZHANG. On the Waring-Goldbach problem for one cube and nine biquadrates. Front. Math. China, 2024, 19(4): 229-246 DOI:10.3868/s140-DDD-024-0014-x

登录浏览全文

4963

注册一个新账户 忘记密码

1 Introduction and main results

In the study of number theory and everyday teaching practice, the problem of additive prime number theory involving the sum of low-order powers of natural numbers provides a convenient way to develop and explore new techniques in the Hardy-Littlewood method (see [15]). Specifically, based on the research progress in the Waring problem for cubes and biquadrates, many scholars have achieved fruitful results in the study of the Waring problem concerning the representation of sufficiently large integers as sums of mixed powers of cubes and biquadrates.

For each natural number r, let B(r) denote the smallest positive integer s such that all sufficiently large integers can be represented as the sum of r cubes and s biquadrates. In the study of this problem, when 1r3, the estimates of upper bounds for B(r) were first obtained by Kawada and Wooley [8], who provided

B(1)9,B(2)8,B(3)6.

For the cases r=5,6, the results were currently given by Brüdern [4, 5]:

B(5)3,B(6)2.

For r=7, according to Linnik’s classical result [10], which states that any sufficiently large integer can be expressed as the sum of cubes of seven positive integers, it follows that B(7)=0. The conclusion for r=4 cannot be directly obtained from the existing literature. However, according to Brüdern [4], almost all sufficiently large positive integers can be expressed as the sum of three cubes and one biquadrate; combined with the conclusion of Kawada and Wooley [8], which states that sufficiently large even integers can be represented as the sum of one cube and four biquadrates, it can be deduced that B(4)5. Later, Brüdern and Wooley [6] improved the result for r=2 and obtained B(2)7.

Based on the above results, it is natural to consider the Waring-Goldbach problem for corresponding powers, but current methods in number theory cannot solve these problems. This paper will consider the problem of representing sufficiently large positive integers, which satisfy certain congruence conditions, as the additive prime of one prime cube and nine prime biquadrates, and will provide an upper bound estimate for the exceptional set corresponding to this representation method.

Theorem 1.1  Let E(N) denote the number of positive integers n that satisfy the congruence conditions n0(mod2)), n±1(mod3), n4(mod5), do not exceed N and cannot be represented as

n=p13+p24+p34+p44+p54+p64+p74+p84+p94+p104.

Then, for any ε>0, we have

E(N)N1718+ε.

Note We will use the Hardy-Littlewood method to prove Theorem 1.1. For the estimation of the minor arc integrals, we will adopt the approach of Kawada and Wooley [9] and incorporate the exponent and estimates of Zhao [14]. For the integrals over the major arcs, we will perform a secondary subdivision and estimate each part separately. Detailed steps will be provided in the subsequent sections.

2 Outline of the proof of Theorem 1.1

Let N be a sufficiently large positive integer. According to the dichotomy method, we only need to consider positive integers n that satisfy the congruence conditions n0(mod2), n±1(mod3), n4(mod5) and n(N2,N]. To apply the Hardy-Littlewood method, we define an appropriate Farey subdivision of the unit interval.

Let A>0 be a sufficiently large constant, whose value will be determined at the end of the proof. Define

Q0=logAN,Q1=N16,Q2=N56,I0=[1Q2,11Q2].

According to Dirichlet’s rational approximation theorem (see Vaughan [12, Lemma 2.1]), each α[1Q2,11Q2] can be represented as

α=aq+λ,|λ|1qQ2,

where a and q are integers satisfying 1aqQ2 and (a,q)=1. Define

M(q,a)=[aqQ1qN,aq+Q1qN],M=1qQ11aq(a,q)=1M(q,a),

M0(q,a)=[aqQ0200qN,aq+Q0200qN],M0=1qQ01001aq(a,q)=1M0(q,a),

m1=I0M,m2=MM0.

With the above subdivisions, we obtain a Farey subdivision of the unit interval:

I0=M0m1m2.

For k{3,4}, let

fk(α)=Xk<p2Xke(pkα),

where Xk=(N32)1k. Define

R(n)=n=p13+p24+p34++p104X4<p2,p3,,p102X4X3<p12X31.

According to (2.2), we have

R(n)=01f3(α)f49(α)e(nα)dα=1Q211Q2f3(α)f49(α)e(nα)dα={M0+m1+m2}f3(α)f49(α)e(nα)dα.

To prove Theorem 1.1, we need the following two propositions.

Proposition 2.1  For n[N2,N], we have

M0f3(α)f49(α)e(nα)dα=G(n)J(n)+O(n1912log11n),

where G(n) is the singular series defined by (4.1). For positive integers n satisfying the conditions n0(mod2), n±1(mod3), and n4(mod5), there exists a constant c>0 such that

0<cS(n)1.

In addition, J(n) is defined by Eq. (4.5) and satisfies

J(n)n1912log10n.

The proof of Eq. (2.3) in Proposition 2.1 will be given in Section 4. The properties of the singular series described in (2.4) will be proven in Section 5 (Lemma 5.6(ii)).

Proposition 2.2  Let Z(N) represent the number of positive integers n[N2,N] that satisfy the congruence conditions n0(mod2), n±1(mod3), and n4(mod5), for which the following estimate holds

j=12|mjf3(α)f49(α)e(nα)dα|n1912log11n.

Then, we have

Z(N)N1718+ε.

The proof of Proposition 2.2 will be given in Section 6. In the remaining part of this section, we will focus on using Proposition 2.1 and Proposition 2.2 to prove Theorem 1.1.

Proof of Theorem 1.1 According to Proposition 2.2, with at most O(N1718+ε) exceptions, all positive integers n[N2,N] that satisfy the congruence conditions n0(mod2), n±1(mod3), and n4(mod5) also satisfy

j=12|mjf3(α)f49(α)e(nα)dα|n1912log11n.

Combining this with Proposition 2.1, we know that with at most O(N1718+ε) exceptions, all positive integers n[N2,N] that satisfy the congruence conditions n0(mod2), n±1(mod3), and n4(mod5) can be expressed as p13+p24+p34+p44+p54+p64+p74+p84+p94+p104, where P1,P2,,P10 are primes. Using the dichotomy method, we obtain

E(N)0logNZ(N2)0logN(N2)1718+εN1718+ε.

This completes the proof of Theorem 1.1. □

3 Some preliminary lemmas

Lemma 3.1 Let α be a real number such that satisfies |αaq|q2 with (a,q)=1. Define β=αaq. Then we have

fk(α)dδk(q)(logx)c(Xk12q(1+N|β|)+Xk45+Xkq(1+N|β|)),

where δk=12+logklog2, and c is a constant.

Proof Refer to Ren [11, Theorem 1.1]. □

Lemma 3.2  Let α be a real number, and there exist aZ and qN satisfying

(a,q)=1,1qQ,|qαa|Q1.

If P12QP52, then the following holds

P<p2Pe(p3α)P1112+ε+q16P1+ε(1+P3|αaq|)12.

Proof Refer to Zhao [14, Lemma 8.5]. □

Lemma 3.3 For αm1, we have

f3(α)N1136+ε.

Proof According to Dirichlet’s rational approximation (2.1), for αm1, there must exist Q1qQ2. Using Lemma 3.2, we get

f3(α)X31112+ε+X31+εQ116N1136+ε.

This completes the proof of Lemma 3.3. □

When 1aq and (a,q)=1, define

J(q,a)=[aq1qQ0,aq1+1qQ0],J=1qQ0a=q(a,q)=12qJ(q,a).

For αm2, using Lemma 3.1, we have

f3(α)N13logcNq12ε(1+N|λ|)12+N415+ε=:V3(α)+N415+ε.

Thus, we can derive the following lemma.

Lemma 3.4  Let V3(α) be defined by (3.2), then

J|V3(α)|2dα=1qQ0(a,q)=12qJ(q,a)|V3(α)|2dαN13log2AN.

Proof We have

1qQ0(a,q)=12qJ(q,a)V3(α)2dα1qQ0q1+εa=q(a,q)=12qλ∣≤1Q0N23logcN1+Nλdλ1qQ0q1+εa=q(a,q)=12q(|λ|1NN23logcNdλ+1N|λ|1Q0N23logcNN|λ|dλ)N13logcN1qQ0q1+εφ(q)N13Q01+εlogcNN13log2AN.

This completes the proof of Lemma 3.4. □

4 Proof of Proposition 2.1

In this section, we will focus on proving Proposition 2.1. First, we introduce some notations. For a Dirichlet character χ mod q and k{3,4}, define

Ck(χ,a)=h=1qχ(h)¯e(ahkq),Ck(q,a)=Ck(χ0,a),

where χ0 is the principal character modulo q. Let χ3,χ4(1),χ4(2),,χ4(9) be Dirichlet characters modulo q. Define

B(n,q,χ3,χ4(1),χ4(2),,χ4(9))=a=1(a,q)=1q(C3(χ3,a)i=19C4(χ4(i),a))e(anq),

B(n,q)=B(n,q,χ0,χ0,χ0,χ0,χ0,χ0,χ0,χ0,χ0,χ0,χ0,χ0),

and

A(n,q)=B(n,q)φ10(q),S(n)=q=1A(n,q).

Lemma 4.1  For (a,q)=1 and any Dirichlet character χ mod q, we have

|Ck(χ,a)|2q12dβk(q),

where βk=logklog2.

Proof Refer to Vinogradov [13, Chapter VI, Problem 14]. □

Lemma 4.2  Let Ck(q,a) be defined as above. Then we have

qx|B(n,q)|φ10(q)logx.

Proof According to Lemma 4.1, we have

B(n,q)a=1(a,q)=1q|C3(q,a)C49(q,a)|q5φ(q)d20(q).

Therefore, the left side of (4.2) is

qxq5φ(q)d20(q)φ10(q)qx(loglogq)9d20(q)q4(loglogx)9qxd20(q)q4logx.

This completes the proof of Lemma 4.2. □

To handle the integrals over the major arcs, we express fk(α) in the following form:

fk(α)=Xk<p2Xk(p,q)=1e(pk(aq+λ))+O(logq)==1(,q)=1qe(akq)Xk<p2Xkp(modq)e(pkλ)+O(logN).

For the inner sum on the right-hand side of the above equation, applying the Siegel-Walfisz theorem, we obtain

Xk<p2Xkpl(modq)e(pkλ)=Xk2Xke(ukλ)dπ(u,q,l)=Xk2Xke(ukλ)d(1φ(q)2udtlogt+O(ueclogu))=1φ(q)Xk2Xke(ukλ)logudu+O(XkeclogN)=:vk(λ)φ(q)+O(XkeclogN).

Thus, we have

fk(α)=Ck(q,a)φ(q)vk(λ)+O(XkeclogN),

and further obtain

f3(α)f49(α)=C3(q,a)C49(q,a)φ10(q)v3(λ)v49(λ)+O(N3112eclogN).

Thus, the integral over the major arcs can be expressed as

M0f3(α)f49(α)e(nα)dα=1qQ0100a=1(a,q)=1qe(anq)Q0200qNQ0200qN(C3(q,a)C49(q,a)φ10(q)v3(λ)v49(λ))+O(N3112eclogN))e(nλ)dλ=1qQ0100B(n,q)φ10(q)Q0200qNQ0200qNv3(λ)v49(λ)e(nλ)dλ+O(N1912eclogN).

It’s noted that

vk(λ)=Xkk(2Xk)kx1k1e(λx)logxdx.

Thus, the innermost integral in (4.3) can be expressed as

Q0200qNQ0200qN(X33(2X3)3x23e(λx)logxdx)(X44(2X4)4x34e(λx)logxdx)9e(nλ)dλ.

Using the basic estimate

vk(λ)=Xkk(2Xk)kx1k1e(λx)logxdxN1k1logNmin(N,1|λ|),

we know that if we extend the integration range in (4.4) to [12,12], the resulting error is

Q0200qN12N8912log10Ndλλ10N8912log10Nq9N9Q01800N1912(logN)500An1912(logn)500A.

Thus, we obtain

Q0200qNQ0200qNv3(λ)v49(λ)e(nλ)dλ=J(n)+O(n1912(logn)500A),

where

J(n)=1212(X33(2X3)3x23e(λx)logxdx)(X44(2X4)4x34e(λx)logxdx)9e(nλ)dλ=X33(2X3)3X44(2X4)4X44(2X4)41212x123(x2x3x4x5x6x7x8x9x10)34(logx1)(logx2)(logx10)×e((x1+x2+x3++x10n)λ)dλdx1dx2dx10X32X427(logN)10X33(2X3)3X44(2X4)4X44(2X4)4X44(2X4)41212×e((x1+x2++x10n)λ)dλdx1dx2dx10X32X427(logN)10N9N1912(logN)10n1912(logn)10.

In summary, according to (4.5) and Lemma 4.2, Eq. (4.3) can be simplified to

M0f3(α)f49(α)e(nα)dα=G(n)J(n)+O(n1912log11n),

which is Eq. (2.3). This completes the proof of Proposition 2.1.

5 Properties of the singular series

In this section, we will focus on presenting several properties of the singular series, which play a crucial role in Proposition 2.1.

Lemma 5.1  Let p be a prime that satisfies pαk. For (a,p)=1, if γ(p), then Ck(p,a)=0, where

γ(p)={α+2,ifp2orp=2,α=0;α+3,ifp=2,α>0.

Proof See Hua [7, Lemma 8.3]. □

For k1, define

Sk(q,a)=m=1qe(amkq).

Lemma 5.2  Let (p,a)=1. Then we have

Sk(p,a)=χAkχ(a)¯τ(χ),

where Ak denotes the set of non-principal characters χ modulo p such that χk is the principal character. Furthermore, τ(χ) denotes the Gauss sum

m=1pχ(m)e(mp).

Additionally, we have |τ(χ)|=p12 and |Ak|=(k,p1)1.

Proof See Vaughan [12, Lemma 4.3]. □

Lemma 5.3  For (p,n)=1, we have

|a=1p1S3(p,a)S49(p,a)p6e(anp)|39366p92.

Proof Let’s denote the left-hand side of Eq. (5.1) by S. According to Lemma 5.2, we have

S=1p10a=1p1(χ3A3χ3(a)¯τ(χ3))(χ4A4χ4(a)¯τ(χ4))9e(anp).

If |Ak|=0 for some k{3,4}, then S=0. If this is not the case, then

S=1p10χ3A3χ4(1)A4χ4(2)A4χ4(9)A4τ(χ3)τ(χ4(1))τ(χ4(2))τ(χ4(9))×a=1p1χ3(a)χ4(1)(a)χ4(2)(a)χ4(9)(a)e(anp).

From Lemma 5.2, we know that the number of terms in the outer sums does not exceed ((3,p1)1)×((4,p1)1)92×39=39366. For each of these terms, we have

|τ(χ3)τ(χ4(1))τ(χ4(2))τ(χ4(9))|=p5.

Since each of these terms

χ3(a)χ4(1)(a)χ4(2)(a)χ4(9)(a)¯

is a Dirichlet character χ (mod p), the inner sum is

a=1p1χ(a)e(anp)=χ(n)¯a=1p1χ(an)e(anp)=χ(n)¯τ(χ).

Noting that for the principal character χ0 mod p, we always have τ(χ0)=1, so

|χ(n)¯τ(χ)|p12.

Combining all these discussions, we obtain:

|S|1p1039366p5p12=39366p92.

This completes the proof of Lemma 5.3. □

Lemma 5.4  Let L(p,n) denote the number of solutions to the following congruence equation

x13+x24+x34++x104n(modp),1x1,x2,,x10p1.

Then, for n0(mod2), n±1(mod3), and n4(mod5), we have L(p,n)>0.

Proof Using the orthogonality of exponential functions, we know that

pL(p,n)=a=1pC3(p,a)C49(p,a)e(anp)=(p1)10+Ep,

where

Ep=a=1p1C3(p,a)C49(p,a)e(anp).

According to Lemma 5.2, we have

|Ep|(p1)(2p+1)(3p+1)9.

It is easy to verify that |Ep|<(p1)10 holds forp23. Hence, we know that L(p,n)>0 when p23. Forp=2,3,5,7,11,13,17,19, under the congruence conditions n0(mod2), n±1(mod3), and n4(mod5), we can directly verify one by one that L(p,n)>0. □

Lemma 5.5  Multiplicativity of A(n,q) with respect to q.

Proof According to the definition of A(n,q) in Eq. (4.1), we only need to prove that B(n,q) is multiplicative with respect to q. Let q=q1q2 that satisfies (q1,q2)=1. Then we have

B(n,q1q2)=(a,q1q2)=1q1q2C3(q1q2,a)C49(q1q2,a)e(anq1q2)=a1=1(a1,q1)=1q1a2=1(a2,q2)=1q2C3(q1q2,a1q2+a2q1)C4(q1q2,a1q2+a2q1)e(a1nq1)e(a2nq2).

When (q1,q2)=1, for k{3,4}, we have

Ck(q1q2,a1q2+a2q1)=m=1(m,q1q2)=1q1q2e((a1q2+a2q1)mkq1q2)=(m1,q1)=1m1=1q1(m2,q2)=1m2=1q2e((a1q2+a2q1)(m1q2+m2q1)kq1q2)=m1=1(m1,q1)=1q1e(a1(m1q2)kq1)m2=1(m2,q2)=1q2e(a2(m2q1)kq2)=Ck(q1,a1)Ck(q2,a2).

Substituting (5.3) into (5.2) gives

B(n,q1q2)=a1=1(a1,q1)=1q1C3(q1,a1)C49(q1,a1)e(a1nq1)a2=1(a2,q2)=1q2C3(q2,a2)C49(q2,a2)e(a2nq2)=B(n,q1)B(n,q2).

This completes the proof of Lemma 5.5. □

Lemma 5.6  Let A(n,q) be defined by Eq. (4.1). Then

(i) we have

q>ZA(n,q)Z72+εd(n).

(ii) there exists an absolute constant c>0, such that for n0(mod2), n±1(mod3), and n4(mod5),

0<cS(n)1.

Proof According to Lemma 5.5, we know that B(n,q) is multiplicative with respect to q. Hence, we have

B(n,q)=ptqB(n,pt)=ptqa=1(a,p)=1ptC3(pt,a)C49(pt,a)e(anpt).

From Eq. (5.5) and Lemma 5.1, we see that B(n,q)=pqB(n,p) or 0, depending on whether q is square-free. Thus, we obtain

q=1A(n,q)=q=1qsquare-freeA(n,q).

Let

R(p,a):=C3(p,a)C49(p,a)S3(p,a)S49(p,a).

Then,

A(n,p)=1(p1)10a=1p1S3(p,a)S49(p,a)e(anp)+1(p1)10a=1p1R(p,a)e(anp).

By applying Lemma 4.1 and noting that Sk(p,a)=Ck(p,a)+1, we have Sk(p,a)p12 and thus R(p,a)p92. Therefore, the second term on the right side of Eq. (5.7) is c1p92. On the other hand, according to Lemma 5.3, the first term on the right side of Eq. (5.7) is 21039366p92=40310784p92. Let c2=c1+40310784. Then we obtain that when pn,

|A(n,p)|c2p92.

In addition, if we directly apply Lemma 4.1, we get

|B(n,p)|=|a=1p1C3(p,a)C49(p,a)e(anp)|a=1p1|C3(p,a)C49(p,a)||(p1)210p5786432=805306368p5(p1),

from which we get

|A(n,p)|=|B(n,p)|φ10(p)805306368p5(p1)929805306368p5p9=412316860416p4.

Let c3=max(c2,412316860416). Then for square-free q, we have

|A(n,q)|=(p|qpn|A(n,p)|)(p|qp|n|A(n,p)|)(p|qpn(c3p92))(p|qp|n(c3p4))=c3ω(q)(p|qp92)(p|(n,q)p12)q92+ε(n,q)12.

Therefore, from Eq. (5.6), we obtain

q>Z|A(n,q)|q>Zq92+ε(n,q)12=d|nq>Zd(dq)92+εd12=d|nd4+εq>Zdq92+εd|nd4+ε(Zd)72+ε=Z72+εd|nd12Z72+εd(n),

which proves Eq. (5.4) and demonstrates the absolute convergence of S(n).

To prove Lemma 5.6(ii), according to Lemma 5.5, we have

S(n)=p(1+t=1A(n,pt))=p(1+A(n,p))=(pc3(1+A(n,p)))(p>c3pn(1+A(n,p)))(p>c3pn(1+A(n,p))).

According to (5.8), we have

p>c3pn(1+A(n,p))p>c3(1c3p92)c4>0.

From (5.9), we have

p>c3p|n(1+A(n,p))p>c3(1c3p4)c5>0.

On the other hand, it is easy to see that

1+A(n,p)=pL(p,n)φ10(p).

According to Lemma 5.4, when n0(mod2), n±1(mod3), and n4(mod5), L(p,n)>0 holds for all prime numbers p. Therefore, 1+A(n,p)>0, and thus

pc3(1+A(n,p))c6>0.

Combining equations (5.10) to (5.13) and setting c=c4c5c6>0, we conclude that S(n)c>0.

Furthermore, from (5.8) and (5.9), we have

S(n)pn(1+c3p92)pn(1+c3p4)1.

This completes the proof of Lemma 5.6. □

6 Proof of Proposition 2.2

In this section, we will present the proof of Proposition 2.2. We denote by Zj(N) the set of positive integers n satisfying n[N2,N], n0(mod2), n±1(mod3), n4(mod5) and such that

|mjf3(α)f49(α)e(nα)dα|n1912log11n.

For convenience, we denote the cardinality of Zj(N) by zj. Furthermore, for nZj(N), we define the complex number ξj(n) via the equation

|mjf3(α)f49(α)e(nα)dα|=ξj(n)mjf3(α)f49(α)e(nα)dα.

And if nZj(N), then ξj(n)=0. Clearly, |ξj(n)|=1 whenever ξj(n) is not equal to 0. Therefore, we have

nZj(N)ξj(n)mjf3(α)f49(α)e(nα)dα=mjf3(α)f49(α)Kj(α)dα,

where the exponential sum κj(α) is defined as

Kj(α)=nZj(N)ξj(n)e(nα).

For j=1,2, let

Ij=mjf3(α)f49(α)Kj(α)dα.

According to Eqs. (6.1)‒(6.3), we have

IjnZj(N)n1912log11nZjN1912log11N,j=1,2.

According to Kawada and Wooley [9, Lemma 2.1] (where k=4 and j=2), we have

01|f44(α)Kj2(α)|dαZjN34+Zj32N12+ε

for j=1,2. Using the Cauchy inequality, VauGhan [12, Lemma 2.5], Lemma 3.3, and Eq. (6.5), we obtain

I1(supαm1|f3(α)|12)(01|f3(α)|8dα)116(01|f4(α)|16dα)γ16(01|f44(α)K12(α)|dα)12(N1136+ε)12(N53+ε)116(N3+ε)716(Z1N34+Z132N12+ε)12N11372+ε(Z112N38+Z134N14)Z112N3518+ε+Z134N13172+ε.

From Eqs. (6.4) and (6.6), we get

Z1N1912log11NI1Z112N3518+ε+Z134N13172+ε,

from which we deduce

Z1N1718+ε.

Next, we estimate an upper bound for z2. According to Eq. (3.2), we have

I2m2|V3(α)f49(α)K2(α)|dα+N415+εm2|f49(α)K2(α)|dα=:I21+I22.

For αm2, either Q0100<qQ1 or Q0100<N|qαa|NQ21=Q1 holds. Thus, according to Lemma 3.1, we have

supαm2|f4(α)|X412+εq(1+N|αaq|)+X445+ε+X4(logN)c(q(1+N|αaq|))12εX412+εQ112+X445+ε+X4(logN)c(Q0100)12εN14log40AN.

Noting that m2I, where I is defined in Eq. (3.1), and using the Cauchy inequality, it is evident that K2(α)Z2. From Hua [7, Theorem 4, p.19], Lemma 3.4 and (6.9), we obtain

I21Z2supαm2|f4(α)|(01|f4(α)|16dα)12(J|V3(α)|2dα)12Z2(N14log40AN)(N3logcN)12(N13log2AN)12Z2N1912log20AN,

where the parameter A is chosen to be sufficiently large for the above upper bound to hold. Furthermore, using the Cauchy inequality, Eq. (6.5), and Hua [7, Theorem 4, p.19], we obtain

I22N415+ε(01|f4(α)|16dα)38(01|f4(α)|8dα)18(01|f44(α)K22(α)|dα)12N415+ε(N3+ε)38(N54+ε)18(Z2N34+Z232N12+ε)12N743480+ε(Z212N38+Z234N14)Z212N923480+ε+Z234N863480+ε.

Combining Eqs. (6.4), (6.8), (6.10), and (6.11), we obtain

Z2N1912log11NI2=I21+I22Z2N1912log20AN+Z212N923480+ε+Z234N863480+ε,

which implies

Z2N103120+ε.

From Eqs. (6.7) and (6.12), we have

Z(N)Z1+Z2N1718+ε.

This completes the proof of Proposition 2.2. □

References

[1]

Brüdern J. Sums of squares and higher powers, I, II. J London Math Soc (2) 1987; 35(2): 233–250

[2]

Brüdern J. Additive Diophantine inequalities with mixed powers, I, II. Mathematika 1987; 34(2): 124–140

[3]

Brüdern J. A problem in additive number theory. Math Proc Cambridge Philos Soc 1988; 103(1): 27–33

[4]

Brüdern J. On Waring’s problem for cubes and biquadrates. J London Math Soc (2) 1988; 37(1): 25–42

[5]

Brüdern J. On Waring’s problem for cubes and biquadrates, II. Math Proc Cambridge Philos Soc 1988; 104(2): 199–206

[6]

Brüdern J, Wooley T D. On Waring’s problem: two cubes and seven biquadrates. Tsukuba J Math 2000; 24(2): 387–417

[7]

HuaL K. Additive Theory of Prime Numbers. Translations of Mathematical Monographs, Vol 13. Providence, RI: AMS, 1965

[8]

Kawada K, Wooley T D. Sums of fourth powers and related topics. J Reine Angew Math 1999; 512: 173–223

[9]

Kawada K, Wooley T D. Davenport’s method and slim exceptional sets: the asymptotic formulae in Waring’s problem. Mathematika 2010; 56(2): 305–321

[10]

Linnik J V. On the representation of large numbers as sums of seven cubes. Mat Sbornik 1943; 12(54): 218–224

[11]

Ren X M. On exponential sums over primes and application in Waring-Goldbach problem. Sci China Ser. A 2005; 48(6): 785–797

[12]

VaughanR C. The Hardy-Littlewood Method, 2nd ed. Cambridge Tracts in Mathematics, Vol 125. Cambridge: Cambridge University Press, 1997

[13]

VinogradovI M. Elements of Number Theory. New York: Dover Publications, 1954

[14]

Zhao L L. On the Waring-Goldbach problem for fourth and sixth powers. Proc Lond Math Soc (3) 2014; 108(6): 1593–1622

RIGHTS & PERMISSIONS

Higher Education Press 2024

AI Summary AI Mindmap
PDF (493KB)

602

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/