An asymptotic formula for the number of prime solutions for multivariate linear equations

Yafang KONG

Front. Math. China ›› 2022, Vol. 17 ›› Issue (6) : 1001 -1013.

PDF (454KB)
Front. Math. China ›› 2022, Vol. 17 ›› Issue (6) : 1001 -1013. DOI: 10.1007/s11464-022-1029-7
RESEARCH ARTICLE
RESEARCH ARTICLE

An asymptotic formula for the number of prime solutions for multivariate linear equations

Author information +
History +
PDF (454KB)

Abstract

In this paper, we study the multivariate linear equations with arbitrary positive integral coefficients. Under the Generalized Riemann Hypothesis, we obtained the asymptotic formula for the linear equations with more than five prime variables. This asymptotic formula is composed of three parts, that is, the first main term, the explicit second main term and the error term. Among them, the first main term is similar with the former one, the explicit second main term is relative to the non-trivial zeros of Dirichlet L-functions, and our error term improves the former one.

Keywords

Prime variables / linear equations / circle methods / estimation of error terms

Cite this article

Download citation ▾
Yafang KONG. An asymptotic formula for the number of prime solutions for multivariate linear equations. Front. Math. China, 2022, 17(6): 1001-1013 DOI:10.1007/s11464-022-1029-7

登录浏览全文

4963

注册一个新账户 忘记密码

1 Introduction

In this paper we are concerned with the following linear equations

a 1p1 +a2 p2++akpk=b,(k3),

where p1, ,pk are prime varibales and the coefficients a1, ,ak are arbitrary positive integers for which

(a1, a2, ,ak)=1,

b is given sufficently large positive integer satisfying two conditions:

(a i1, ai2,,aik1,b)=1 (1i 1<i2<< ik 1k),

a 1+a2++a kbmod2.

It is known that when k=2 and a 1=a2=1, equation (1) is the famous even Goldbach problem which is an open problem; when k=3, a1=a2 =a3= 1 and sufficently large b, it is the odd Goldbach problem which is solved by Vinogradov in 1937 [8]. Moreover, he showed an asymptotic formula for the number of prime solutions:

r k(n )=nk 1( k1)!G k(n )+O(nk1(logn)A),(A >0),

where

r k(n )= p1+p2 ++pk=n(logp1)(logp2)(log pk),

and the singular series

G k(n )= n=1 μ(q )ϕ (q)k a=1(a,q )=1qe (anq),

where e(u)=e2πiu.

In 1973, Montgomery and Vaughan [5] showed that if we define

θ =sup{β: L(β+iγ,χ)=0},

where the supremum is over all zeros of all the L-functions for Dirichlet characters, then the error term of the asymptotic formula must be

O(nk2 +θ+ϵ)(ϵ>0 ).

Then in 1997, Friedlander and Goldston [1] using the upper bound estimate of zeros of L(s,χ ) in sσ, 0<sT, that is N(σ,T,χ ), found the estimate of error term similarly with (5) as following

O(nk2 +θ+ϵ)+O (nηk+ ϵ),

where η3=95, η 4=135, and ηk =0(k5).

In 2012, assuming the Generalized Riemann Hypothesis (GRH), Languasco and Zaccagnini [2] considered

R k(n )= n1+n2 ++nk=nΛ( n1)Λ(n2)Λ(n k), (k5),

and gave an explicit asymptotic formula

R k(n )= nk 1(k1 )!kq=1μ (q)k 1 ϕ(q )k χmod q Cχ( n)τ(χ¯ ) × ρ nρ+k2ρ(ρ+1 )(ρ+k 2)+O(nk 74(logn ) k1),

where in the error term, 74 can be insteaded by 2 when k 6, and (logn)k1 can be instead by (logn)2 when k 7.

Inspired by the above results, in this paper, we study the number of prime solutions for more general linear equations (1), that is

I k(b )= a1n1+ a2n 2++ akn k=b Λ( n1)Λ(n2)Λ(n k), (k5),

and show the asymptotic formula for Ik(b) assuming the GRH as the following theorem.

Theorem 1  Assuming the GRH, for any sufficently large positive integer b which satisfies condition (2)−(4), we have

I k(b )= nk 1(k1 )!A kGk(b)+ j=1kT j(b )ρ bρ+k2aj 1ρρ (ρ+1)(ρ+k 2) Ak+O(B2b k74(log b) k1),

where k5, Ak=a1 a2 ak, B=max1 i k{ai},

G k(b )= q=1 1ϕ( q)kCq(b)j=1kCq(a j),

and

T j(b )= q=1 1ϕ( q)ki =1i j kCq(a i)χ modqC χ( aj)Cχ(b).

We note that in 2004, Li Weiping and Zhou Haigang [3] also studied the asymptotic formula for the number of solutions to the linear equation with integral coefficients of prime variables, and the error term of their asymptotic formula is O( Nk32) (k 5) provided that the generalized Riemann hypothesis holds. In contrast, the advantage of the asymptotic formula in Theorem 1 is that adding a second principal term not only makes the remainder smaller, but also makes the asymptotic formula more precise. It should also be noted that Vaughan and Wooley [7] gave a higher-order asymptotic formula for the number of solutions to Waring's problem in 2016, so does the Waring-Goldbach problem also have a corresponding higher-order asymptotic formula for the number of prime solutions? The results of this article can also be seen as a partial answer to this question.

2 Preparation and outline of the method

As usual, we denote the Euler function, the von-Mangoldt function, the Ramanujan function and the Gauss function by ϕ(n), Λ(n), Cq(n), and C χ( n), respectively. Let ϵ be sufficiently small positive numbers which may not be equal everywhere in the paper.

According to the Dirichlet approximation theorem, we define the Farey fractions of level Q with 1 Q b,

{a q:1 a q ,(a,q) =1}.

The Farey arcs centered at a/q is

M q,a=(a +aq+q ,a+a q+q],(aq11 ),

and M1, 1=(11 Q+1 ,1+1 Q+1 ]. Here aq<aq< a q are three consecutive Farey fractions. Let

ξq,a=(1q(q+q),1q(q+ q )], (aq1 1),

and ξ1,1=(1 Q+1 ,1Q+ 1]. Then any α(1Q +1,1+1Q +1] can be represented by

α =aq+η,where1aqQ,(a,q )=1andηξ q,a.

Moreover, we have ( 12qQ,12qQ)ξ q,a(1qQ,1qQ).

Set the weighted exponential sum as

S j(α )= n=1Λ( n)e ajnbe(ajn α).

In the following, applying the orthogonality of the Dirichlet character, we divide Sj( α) into three parts.

Firstly, according to the definition of von-Mangoldt function, we know that for any 1qQ,

S j(α )= n=1(n,q )=1Λ( n)e ajnbe(ajn α)+ n=1qnΛ( n)e ajnbe(ajn α).

Here

n=1 qnΛ(n) e ajnbe(ajn α)= pq t=1Λ(pt ) e aj ptbe( ajptα) pqlogp t=1 e ajptb.

Since

t= 1 e ajptb= t logb1+t>log bb ajpt logb+ tlogbb ajelogb(p e)tlog b,

we have

S j(α )= n=1(n,q )=1Λ( n)e ajnbe(ajn α)+O(log blogq).

Secondly,

n=1 (n,q )=1Λ( n)e ajnbe(ajn α)= t=1(t ,q)= 1q e(a jtq )n =1n a 1t modq Λ(n) e ajnbe(ajn η),

where aa1 1modq. Applying the orthogonality of the Dirichlet character, the above equation is

n=1 (n,q )=1Λ( n)e ajnbe(ajn α)= 1ϕ(q) χmodqχ( a)C χ (aj)W~j(χ,η),

where

W~j(χ,η)=n=1 χ¯(n)Λ (n)e ajnbe(aj nη).

Thirdly, let

V j(η )= n=1 e ajnbe(ajn η),

W j(χ ,η)={W~j(χ,η)Vj(η),χ =χ0,W~j(χ,η),χ χ0,

where χ0 is the principal character. Then

S j(α )= Cq(aj )ϕ (q)Vj(η)+1 ϕ(q) χmod q χ(a)Cχ(aj )Wj(χ, η)+O(log blogq) =:Sj,1+Sj,2+Sj,3.

In this way, we have

j=1k Sj( α)=i=1kSj,1+j=1k i=1i jkS i,1(Sj,2+Sj,3)+O( m=0k2 i=1m Si,1 j=m+1k(S j,2+Sj,3)) =:S1+S2+ S3,

and

I k(b )= 11+Q1+1Q +1 j=1kSj(α)e( bα) dα= q=1Qa =1(a,q)=1qe( baq) ξq,a( S1+ S2+S 3)e (bη)dη=: Mk,1( b)+ Mk,2( b)+ Mk,3( b),

where

M k,i(b )= q=1Q a=1 (a,q )=1qe (baq) ξq, aS ie( bη)dη,(i=1 ,2,3).

The latter sections of this article are arranged as follows. In Section 2, we estimate M k,1(b), and give the first main term of the asymptotic formula for Ik( b). In Section 3, we estimate M k,2(b), and give the explicit second main term of the asymptotic formula. In Section 4, we estimate M k,3(b), and give the error term of the asymptotic formula and the proof of Theorem 1.

3 Estimate Mk, 1(b)

Let

z j=a jb 2πiajη =aj (1b 2πiη).

Then

V j(η )= n=1 e ajnbe(ajnη)=zj1+O( 1).

Therefore

ξq,a j=1kV j(η )e(bη)dη= ξq,ae (bη) z1z2zkdη+O(1 qQ1q Q dη|z1 z2z k1|),

where

q,ae(bη )z 1z2 zk dη = ξq,ae(bη)a1a2ak ( 1b 2πiη)k dη=bk1Ak (k1)!+O( (qQ )k1).

Here Ak=a 1a2 ak, which can be deduced by Lemma 8 of [2]. In the same way, we know the error term of equation (7) is O( bk2). Hence, we have

ξq,a j=1kv j(η )e(bη)dη=b k1Ak(k 1)!+O( (qQ )k1+bk2).

If we put equation (8) into M k,1(b), and let

G k(b )= q=1 1ϕ( q)kCq(b) j=1kC q(aj),

then we have

M k,1(b )= bk 1 Ak( k1)!Gk(b)+O(b k1 q>Q 1ϕ( q)kCq(b) j=1kC q(aj) ) +O( Qk 1q= 1Q qk1ϕ (q)k Cq(b) j=1kCq(aj ))+O(bk2q=1Q1 ϕ(q )kCq(b)j=1kCq(a j)).

Here Gk( b) is the singular series. Under conditons (2)−(4), we can show that Gk(b) is convergent and positive [4]. In fact, since [6]

C q(n )=μ (q(n,q))ϕ (q)ϕ 1(q( n,q)),

under conditons (2)−(4), we have

G k(b )= n=1μ(q(b,q))ϕ(q) j=1kμ(q(aj, q))ϕ(q)ϕ(q)kϕ(q (b,q )) j=1kϕ(q (aj,q))q=1μ (q)2ϕ(q) j=1k1ϕ(q( aj,q )) qa 1a2 a k1μ(q)2ϕ (q)+ q> a1a2ak1μ (q)2a 1a2 a k1ϕ( q)kq a1 a2 ak1 μ(q)2ϕ( q)+ q>a1a2 ak 1 μ(q)2ϕ( q)k1=O B,k(1 ),

where k3, and

B=max 1ik{ai}.

Therefore Gk(b) is convergent. Moreover,

Gk(b) =1+ q2μ( q (b, q))ϕ(q) j=1kμ(q(aj, q))ϕ(q)ϕ(q)kϕ(q (b,q )) j=1kϕ(q (aj,q))=:1+ ,

under equations (2)−(4),

| | q2μ(q)2(b,q) j=1k(aj ,q)ϕ( q)k< q=p1p2 pss11 ϕ(p1)ϕ(p 2) ϕ(p k)1.

Therefore, we have Gk(b) >0.

In the following we process three parts of error terms. The first error term of equation (10) is

bk 1q> Qμ (q)2(b,q) j=1k(aj ,q)ϕ( q)kb k1q>Qd |qdk ϕ(q )kbk1q>Q1ϕ (q)k ϵ .

Here we make use of d |qdk1qϵ, when k3, this error term is

bk 1Q1 k.

Further, when Q=b 1/2/2, this error term is

bk 1b12k2bk 2.

In the same way, we have the second error term of equation (10) is

Qk 1q= 1Q qk1ϕ (q)k d|qd k1Q k1q=1Q1 ϕ(q )1ϵQk.

Further, when k4 and Q=b1/2/2, this second error term is

bk2 bk 2.

In addtion, we have the third error term of equation (10) is

bk 2q= 1Q d|qd k1ϕ(q)k bk 2.

Putting inequations (11)−(13) into the formula (10), we have the following lemma.

Lemma 1  If k4 and Q=b1/2/2, and define Gk(b) by (9), then we have

M k,1(b )=bk 1Ak(k1)!Gk(b)+O(bk2),

where Ak=a1 a2 ak.

4 Estimate Mk, 2(b)

We divide M k,2(b) into two parts as

M k,2(b )= q=1Qa =1(a,q)=1qe( baq) ξq,a j=1k i=1 ijkSi,1S j,2e(bη)dη+ q=1Qa =1(a,q)=1qe( baa) ξq,a j=1k i=1 ijkSi,1S j,3e(bη)dη.

Notice Sj,3=O (logblogq). Then we estimate the first part of Mk,2( b), and divide it into three parts again as

M 2,1= q=1 a=1(a ,q)= 1q e(baq)1 2 12 j=1ki =1i jk Si ,1S j,2e( bη)dη,

M 2,2=O(q>Qa =1(a,q)=1qe( baq) 12 12 j=1ki =1i jk Si ,1S j,2e( bη)dη),

M 2.3=O( q=1Q a=1(a ,q)= 1q e(baq)1q Q 12 j=1ki =1i jk Si ,1S j,2e( bη)dη).

In the following, we shall estimate M 2,1, M2,2 and M 2,3 one by one. According to Lemma 2 of [2], let x>2 be a real number, j 1, q1 be integers, χ is the character modulo q, and define

ψ j(x ,χ)=1j!n<x(xn) jΛ(n) χ¯(n).

Then we have:

Lemma 2  Assume that the GRH holds for every L(s,χ). Then

ψ j(x ,χ)=δ(χ)xj+ 1( j+1) !ρx ρ+j ρ(ρ +1) (ρ+j)+ O(x jlogb logq),

where ρ is over all the non-trivial zeros of L(s,χ ), and if χ=χ 0, then δ( χ)=1, and δ (χ)=0, otherwise.

Applying Lemma 2, we have

1212 i=1i jkVi(η)Wj(χ,η )dη=mj baj(Λ( mj)χ ¯(mj )δ (χ))( aj(b ajmj)k2(k2)!Ak+O((b ajm j)k3))= ajk1Akψ k2 (baj,χ) bk1(k1 )!A kδ(χ)+O( bk 2)=ρ bk2+ρaj1ρρ(ρ+1 )(ρ+k 2)A k+O (bk2logblogq) .

Set

T j(b )= q=11ϕ (q)k i=1ijkCq( ai) a=1(a .q)= 1q e(baq)χ modqχ (a)Cχ( aj)= q=11ϕ (q)k i=1ijkCq( ai) χmodqC χ( aj)Cχ(b).

Then Tj( b) is convergent. It is because that

T j(b )q =1q |qμ (q)2ϕ(q )ki =1i jk (aj,q) ϕ(q)q q=1d |qd kϕ(q)k 1 q=11ϕ (q)k 1ϵ.

Now M2,1 can be rewritten as

M 2,1= j=1kT j(b )ρ bk2+ρaj1ρρ(ρ+1 )(ρ+k 2)A k+O (bk2logb).

When estimate M 2,2, we apply (14) and

q> Q1ϕ(q )ki =1i jk Cq(ai)χ modqCχ(aj)C χ (b)q>Q1ϕ (q)k 1ϵQ1+ϵk

to deduce that when k3 and Q=b1/2/2,

M 2,2b k1Q1+ϵk bk2.

At the same time, applying Vj(η)qQ and W j(χ ,η)b with η (12qQ, 12), we know that when k5 and Q=b1 /2/2,

M 2,3bQk 1+ϵbk2+ϵ.

Then we estimtate the second part of Mk,2(b). Note that

ξq,a i=1i jkVi(η) dη 1 qQ1q Q1η k1 dη (qQ)k2.

Therefore, when k5 and Q=b1/2/2, this part is

q=1Qqk2ϕ(q)k i=1i jkCq(ai )χ modqCχ(aj)C χ (b)logq Qk 2blogbbk 2logb.

Hence we finish the estimate of M k,2(b) and obtain the following lemma.

Lemma 3  Assume the GRH, and when k5 and Q=b 1/2/2, define Tj( b) as (15). Then we have

M k,2(b )= j=1kT j(b )ρ bk2+ρaj1ρρ(ρ+1 )(ρ+k 2)A k+O (bk2logb),

where ρ is over all the non-trivial zeros of L(s,χ ).

5 Estimate M k, 3(b)

First of all, when χχ0,

W j(χ ,η)= n=1χ¯ (n)Λ(n)ezjn,

where zj= ajb2πia jη. Set σ >1, and let (σ) denote the line with real part equal to σ in the complex plane. According to (1.2.5) and (6.3.25) in [6], we have

ezjn= 12πi (σ)(zjn) sΓ (s) ds ,

and

LL(s,χ)= n=1Λ(n) χ(n)ns,(s>1).

Therefore, when χχ0,

W j(χ ,η)=12πi(σ )zj sLL(s,χ)Γ(s) ds.

According to the Remainder Theorem in complex analysis and Lemma 2 in [2], assuming GRH, we have

W j(χ ,η)=ρ zj ρΓ(ρ)+O (logblogq),

where ρ is over all the non-trivial zeros of L(s,χ ). According to Lemma 6 of [2],

ρzjρΓ(ρ)b12log(q+1)+b |η | 12log(qb).

Hence we obtain the following lemma.

Lemma 4  Assume the GRH, and set 1qQ<b, χmod q and ηξ q,a. Then we have

S j,2((bq ) 12+b(q | η|)12)log(qb ).

In particular, when Q=b 1/2/2, by Lemma 4, we obtain

S (Q):= max 1qQmax 1 a q(a,q) =1 maxηξq, a| Sj,2+Sj, 3|(bQ+b Q)log( Qb) b3 /4logb.

In the following, we make mean estimation to Sj,1 and S j,2+Sj,3. We know that

S j,1=Cq( aj)ϕ( q) Vj( η),

where Cq( aj)(q ,aj), Vj(η)zj1. Therefore

q= 1Q a=1 (a,q )=1q ξq,a |Sj,1|2dηq=1Q(q,aj) 2ϕ(q)1 qQ1q Q1|zj | 2 dηB2blogQ,

where B=max1ik{ai}. Further, by the Cauchy-Schwarz inequality, we have

q= 1Q a=1 (a,q )=1q ξq,a |Sj,2+Sj,3|2dη= q=1Q a=1 (a,q )=1q ξq,a |Sj(α )S j,1 |2dη 1Q+11+1Q +1 | Sj(α) | 2dη+ q=1Q a=1 (a,q )=1q ξq,a |Sj,1|2dη.

Putting inequality (18) and

1 Q+11+ 1Q+1 |Sj(α ) |2dηbajlogb

into the right-hand side of (19), we have

q= 1Q a=1 (a,q )=1q ξq,a |Sj,2+Sj,3|2dηB2b logb.

In addition, when r3, we also have

q= 1Q a=1 (a,q )=1q ξq,a |Sj,1|rdηq=1Q(q,aj) rϕ(q)r 1 1qQ1qQ1|min{b1,η}|r dη Br br1.

Now, we divide S3 into k1 parts according to m(0 m k2 ), which are

S 3,0= j=1k(Sj,2+ Sj ,3),S 3,m= i=1mS i,1j=m+1k(Sj,2+Sj,3), (1mk2).

And correspondingly, M k,3(b) is divided into k1 parts, which are

M 3,m= q=1Q a=1 (a,q )=1qe (baq) ξq, aS 3,me( bη)dη, (0mk2).

We further apply inequalities (18), (20) and (21) to estimate M3, m(0 m k2 ) as follows:

M 3,0 (S(Q))k2q=1Q a=1(a,q )=1q ξq,a |Sj,2+Sj,3|2dη b34(k2)(log b) k2B2 blogb B2b k 74(logb ) k1;

M 3,1 (S(Q))k2q=1Q a=1(a,q )=1q ξq,a |Si,1||S j,2+Sj,3|dη B2b k 74(logb ) k1;

M 3,2(S(Q )) k2q=1Q a=1(a,q )=1q ξq,a |Si,1|2dηB2bk 74(logb ) k1.

To estimate M 3,r(3 r k 2), we need the following lemma.

Lemma 5  Assume the GRH, and let c>1. Then

q= 1Q a=1 (a,q )=1 1ϕ( q)c1 qQ1q Q| Si,1|2|S j,2+Sj,3|2dη B2b 2(log b) 2,

where B= max1 i k{ |ai|}.

In fact, by Lemma 4, S j,3log( qb) and Vi( η) 1min{1b,η}, we can obtain the summation in Lemma 5 is

q=1Q a=1(a,q )=1qB2ϕ(q)c+ 2 1qQ1qQ((bq)12+b(q|η|)12)2dη|min{ 1b, η} | 2B 2q=1Q1 ϕ(q )c+1( 01 bbq b2dη+ 1b1q Qb2qη1η2dη) B2b 2q=1Q1 ϕ(q )c 1b1q Q1η dηB 2b2 (logb)2 .

In this way, by Lemma 5, for 3rk2, we have

M 3,r (S8(Q))kr 2q= 1Q a=1 (a,q )=1q1ϕ( q)r21 qQ1q Q| Si,1|2|S j,2+Sj,3|2dη b34 (kr2)(log b) kr2B2b2(logb)2 B2bk74(log b) kr.

Hence, we obtain that when k5, assuming the GRH,

M k,3(b )B 2bk 74(logb ) k1.

In the end, putting inequality (22), Lemma 1 and Lemma 3 into equation (6), we finish the proof of Theorem 1.

References

[1]

Friedlander J B, Goldston D A. Sums of three or more primes. Trans Amer Math Soc 1997; 349: 287–319

[2]

Languasco A, Zaccagnini A. Sums of many primes. J Number Theory 2012; 132: 1265–1283

[3]

Li W P, Zhou H G. Linear equations with three or more primes. Pure and Appl Math 2004; 20(4): 350–359

[4]

LiuM CTsang K M. Small prime solutions of linear equations. In: Théorie des Nombres (Quebec, PQ, 1987), Berlin, New York: de Gruyter, 1989

[5]

Montgomery H L, Vaughan R C. Error terms in additive prime number theory. Quart J Math 1973; 24(2): 207–216

[6]

PanC DPan C B. Basic Analytic Number Theory. Beijing: Science Press, 2016 (in Chinese)

[7]

Vaughan R C, Wooley T D. The asymptotic formula in Waring’s problem: Higher order expansions. J Reine Angrew Math 2018; 742: 17–46

[8]

Vinogradov I M. Representation of an odd number as a sum of three primes. Dokl Akad Nauk SSSR 1937; 15: 291–294

RIGHTS & PERMISSIONS

Higher Education Press 2022

AI Summary AI Mindmap
PDF (454KB)

1551

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/