On Roth's theorem concerning a cube and three cubes of primes. Citation Quarterly Journal Of Mathematics, 2004, v. 55 n. 3, p.
|
|
- Amberly Melton
- 6 years ago
- Views:
Transcription
1 Title On Roth's theorem concerning a cube and three cubes of primes Authors) Ren, X; Tsang, KM Citation Quarterly Journal Of Mathematics, 004, v. 55 n. 3, p Issued Date 004 URL Rights Quarterly Journal of Mathematics. Copyright Oxford University Press.; This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.; This is an electronic version of an article published in [Quarterly Journal Of Mathematics, 004, v. 55 n. 3, p ]
2 ON ROTH S THEOREM CONCERNING A CUBE AND THREE CUBES OF PRIMES by Xiumin Ren 1 and Kai-Man Tsang Department of Mathematics, The University of Hong Kong, Pokfulam, Hong Kong) Abstract In this paper, we prove that with at most ON 171/196+ε ) exceptions, all positive integers up to N are the sum of a cube and three cubes of primes. This improves an earlier result ON 169/170 ) of the first author and the classical result ONL A ) of Roth. 1. Introduction It is conjectured that all sufficiently large integers n satisfying some necessary congruence conditions are the sum of four cubes of primes, i.e. n = p p 3 + p p 3 4. Such a strong conjecture is out of reach at present; but it is reasonable, in view of the following results of Davenport and Hua respectively. Davenport s theorem in [1] asserts that almost all positive integers are the sum of four positive cubes, while a theorem of Hua [5, 6] states that almost all positive integers n with n 0, ± mod 9) are the sum of five cubes of primes. In 1949, Roth [1] proved that almost all positive integers n can be written as n = m 3 + p 3 + p p 3 4, 1.1) where m is a positive integer and p j are primes. To be more precise, we let EN) denote the number of all the integers n not exceeding N which cannot be written as 1.1). Then Roth s theorem actually states that EN) N log A N, where A > 0 is arbitrary. This result can be viewed as an approximation to the above conjecture, and the quality of this approximation is indicated in the upper bound of EN). Roth s theorem has been improved by the first author [11] to EN) N 169/170. The exponent 169/170 was obtained via an approach in which the possible existence of Siegel zero does not have special influence, and hence the Deuring-Heilbronn phenomenon can be avoided. In this paper we inject new ideas into the afore-mentioned approach, and make the following further improvement. Theorem 1.1. For EN) defined as above, we have EN) N 171/196+ε. The new ideas used in this paper include the iterative method and the hybrid mean-value estimate for Dirichlet polynomials of Liu [8], which will be displayed in full details at relevant places in the following sections. An outline of the proof of Theorem 1.1 will be given in. At 1 xmren@maths.hku.hk kmtsang@maths.hku.hk 1
3 this stage, we only point out that our Theorem 1.1 does not depend on the Deuring-Heilbronn phenomenon, and the method of this paper can be successfully applied to a number of additive problems. Notation. As usual, ϕn) and Λn) stand for the function of Euler and von Mangoldt respectively, and dn) is the divisor function. We use χ mod q and χ 0 mod q to denote a Dirichlet character and the principal character modulo q; and Ls, χ) is the Dirichlet L- function. In our statement, N is a large positive integer, and L = log N. The symbol r R means R < r R. The letters ε and A denote positive constants, which are arbitrarily small and arbitrarily large respectively. We use c j to represent absolute positive constants.. Outline of the method For large positive integer N and θ = 5/16 ε, we set P = N θ and Q = NP 1..1) For coprime integers a, q with 1 a q P, we denote by Mq, a) the interval [a/q 1/qQ, a/q + 1/qQ]. These major arcs all lie in [1/Q, 1 + 1/Q] and, since P Q, they are mutually disjoint. Write M for the union of all Mq, a) and define the minor arcs m as the complement of M in [1/Q, 1 + 1/Q]. Let U = N/9) 1/3 and V = U 5/6..) We define and, for W = U or V, T α) = m U em 3 α) Sα, W ) = m W Λm)em 3 α). Define rn) = Λm 1 )Λm )Λm 3 ). n=m m3 4 m 1,m 4 U,m,m 3 V Then rn) = 1+1/Q 1/Q Sα, U)S α, V )T α)e nα)dα = To handle the integral on the major arcs, we need the following. M +..3) m Lemma.1. For all integers n with N/ n N, we have Sα, U)S α, V )T α)e nα)dα = Sn)Jn) + OV U 1 L A )..4) M Here Sn) is the singular series which is defined by 4.1) and it satisfies log log n) c 1 Sn) log n;.5)
4 and Jn) is as defined in 4.3) and it satisfies V U 1 Jn) V U 1..6) In the Waring-Goldbach problem, the quality of arithmetical results obtained usually depends on the size of the major arcs. Our major arcs M in this paper are much larger than those in [11], and we need new ideas to control their contribution. The first new idea is a hybrid estimate for Dirichlet polynomials; see Lemma 5.1 below. The second is the iterative procedure in treating I 1,..., I 5 in 4, as illustrated in the proof of Lemma 4.. The minor arcs estimate is taken care of by Theorem 3 in [11]. That it is valid for minor arcs as defined above can be checked easily. Here we record it in the following lemma. Lemma.. Let m be as defined above. Then we have Sα, U) Sα, V ) 4 T α) dα UV 4 P 1/6+ε. m Equipped with Lemmas.1 and., we can now give the proof of Theorem 1.1 immediately. Proof of Theorem 1.1. We start from.3). The contribution of the major arcs is taken care of by Lemma.1. To treat the integral on the minor arcs we apply Bessel s inequality and Lemma. to get N/<n N m m Sα, U) Sα, V ) 4 T α) dα UV 4 P 1/6+ε..7) By a standard argument, we deduce from.7) that for all N/ < n N but at most OU 3 P 1/6+3ε ) exceptions, m V U 1 P ε. Therefore by Lemma.1, for these un-exceptional n, we have rn) = Sn)Jn) + OV U 1 L A ), and these n can be written as 1.1). Let F N) be the number of the exceptional n above. Then we have F N) U 3 P 1/6+3ε N 171/196+ε. The assertion of Theorem 1.1 now follows from EN) = j 0 F N/j ). Now it remains to prove Lemma.1, which will be carried out in the following sections. 3. An explicit expression The purpose of this section is to establish in Lemma 3.1 an explicit expression for the left-hand side of.4). For χ mod q, we define Cχ, a) = q ) am 3 χm)e, 3.1) q m=1 3
5 and write Cq, a) = Cχ 0, a). We also define q ) am S 3 q, a) = e. 3.) q For α = a/q + λ Mq, a), we have q ) ah 3 S α, W ) = e q h=1 h,q)=1 m=1 m W m h mod q) Λm)eλm 3 ) + OL ). By introducing Dirichlet characters to the above sum over m, we can rewrite S α, W ) as Cq, a) ϕq) m W eλm 3 ) + χ mod q Cχ, a) ϕq) Λm)χm) δ χ )eλm 3 ) + OL ). 3.3) m W Here and throughout, δ χ is 1 or 0 according as χ is principal or not. By Lemma 4.8 in [13] one finds that, for W = U or V, m W eλm 3 ) = W W eλu 3 )du + O1). Thus, if we denote by Φλ, W ) the above integral and by Ψχ, λ, W ) the last sum over m in 3.3), then we have S α, W ) = Cq, a) ϕq) Φλ, W ) + χ mod q Cχ, a) ϕq) Ψχ, λ, W ) + OL ) = S 1 λ, W ) + S λ, W ) + OL ), 3.4) say. For T α) we apply Theorem 4.1 in Vaughan [14], to get say. So if we write T α) = S q, a) Φλ, U) + Oq 1/+ε ) = T 1 λ) + Oq 1/+ε ), 3.5) q λ) = {S 1 λ, U) + S λ, U)} {S 1 λ, V ) + S λ, V )} T 1 λ), then 3.4) and 3.5) together with the trivial bounds Sα, W ) W and T α) U show that Sα, U)S α, V )T α) λ) UV q 1/+ε + U V L. Consequently Sα, U)S α, V )T α)e nα)dα M = q P q a=1 a,q)=1 e an q ) 1/qQ λ)e nλ)dλ + OUV P 3/+ε Q 1 + U V P Q 1 L ). 1/qQ The above O-term is OV U 1 L A ), on recalling.1) and.). Now we write 0 λ) = S1λ, V ), 1 λ) = S 1 λ, V )S λ, V ), λ) = Sλ, V ); 4
6 and for i = 0, 1,, define I i = q P I 3+i = q P Then we have proved q a=1 a,q)=1 q a=1 a,q)=1 e an q e an q Lemma 3.1. For I j defined as above, we have M Sα, U)S α, V )T α)e nα)dα = ) 1/qQ S 1 λ, U)T 1 λ) i λ)e nλ)dλ, 3.6) 1/qQ ) 1/qQ S λ, U)T 1 λ) i λ)e nλ)dλ. 3.7) 1/qQ 5 I j + OV U 1 L A ). j=0 In the following sections we prove that I 0 produces the main term, while the others contribute to the error term. We need some more notations. 4. Estimation of I j for j = 0, 1,..., 5. S q, a) be as defined in 3.1) and 3.). We define Bn, q, χ 1, χ, χ 3 ) = q a=1 a,q)=1 Let χ 1, χ and χ 3 be characters mod q, Cχ, a) and e an q ) Cχ 1, a)cχ, a)cχ 3, a)s q, a), and write Bn, q) = Bn, q, χ 0, χ 0, χ 0 ), An, q) = Bn, q) ϕ 3 q)q, Sn) = An, q). 4.1) q=1 This Sn) is the singular series appearing in Lemma.1. By Lemma 18 and in [1] and Lemma 4.4 in [11], we see that the singular series is absolutely convergent and satisfies the first inequality in.5). The second inequality in.5) can be established by making use of Lemmas 15 and 16 in [1] as follows: An, q) 1 + c p 1 ) + c p q p n p n1 3 ) ) n c + c p p n1 1 ) log n. 4.) ϕn) Lemma 4.1. Let I 0 be as defined in 3.6). Then for all N/ < n N, we have I 0 = Sn)Jn) + OV U 1 L A ), where Sn) and Jn) are defined in 4.1) and 4.3). 5
7 Proof. By definition we have Define I 0 = q P Bn, q) ϕ 3 q)q Jn) = 1/qQ 1/qQ Φ λ, U)Φ λ, V )e nλ)dλ. Φ λ, U)Φ λ, V )e nλ)dλ. 4.3) Then by Lemma 5. in [11], Jn) is well defined and satisfies.6). Using the elementary estimate we get and therefore, λ 1/qQ ) 1 Φλ, W ) min W, W, 4.4) λ Φ λ, U)Φ λ, V ) dλ V U 4 1/qQ dλ λ V UP ) 1 q, I 0 = Jn) { An, q) + O V UP ) } 1 q An, q). 4.5) q P q P By Lemma 18 in [1], An, q) = Sn) + OP 1/4+ε ), q P so the main term on the right hand-side of 4.5) becomes Jn)Sn) + OV U 1 P 1/4+ε ). To estimate the O-term in 4.5), we use the bound see [1, pp. 77]) An, q) q 3/+ε n, q) 1/, to get q An, q) q 1/+ε n, q) 1/ q P q P d n d ε q 1/+ε P 1/+ε, q P/d and consequently the O-term in 4.5) is OV U 1 P 1/+ε ). This proves Lemma 4.1. Lemma 4.. Let I j, j = 1,,..., 5 be as defined in 3.6) and 3.7). Then we have I j V U 1 L A. To prove Lemma 4., we need the following Lemmas Lemma 4.3. If χ j, j = 1,, 3, are primitive characters mod r j, and r 0 = [r 1, r, r 3 ] is the least common multiple of r 1, r, r 3, then for χ 0 mod q we have Bn, q, χ1 χ 0, χ χ 0, χ 3 χ 0 ) r 0 L. q P r 0 q ϕ 3 q)q 6
8 The saving of r 0 on the right-hand side will play a key role in our argument, and the quality of the exceptional set will depend on the magnitude of the exponent 5/6. In the next section, we will apply the iterative method of [8] to make use of the full strength of this 5/6, and the reader is referred to the proof of Lemma 4.. Proof of Lemma 4.3. This is a slight modification of Lemma 4.5 in [11]. In fact, by 4.7)-4.10) in [11], we see that q P r 0 q Bn, q, χ1 χ 0, χ χ 0, χ 3 χ 0 ) ϕ 3 q)q r 0 i=0 q P/3 i r 0 q,r 0 )=1 An, q). From this the desired assertion follows by applying 4.) to the last sum. Lemma 4.4. Let g be a positive integer. Then we have r P 1/ 1/rQ [r, g] Ψχ, λ, U) dλ) g U 1/ L c 3. 1/rQ In particular, for g = 1, the above bound can be improved to U 1/ L A. Here indicates that the summation is over all primitive characters mod r. Lemma ) For integer g 1, we have r P [r, g] max Ψχ, λ, V ) λ 1/rQ g V L 17. ) In particular, for g = 1 the above bound can be improved to V L A. The proofs of Lemmas 4.4 and 4.5 will be postponed to the next section. lemmas ready, we can now give the proof of Lemma 4.. Proof of Lemma 4.. We first consider I 5. By definition, With these I 5 = Bn, q, χ 1, χ, χ 3 ) ϕ 3 q)q q P χ 1 mod q χ mod q χ 3 mod q 1/qQ Ψχ 1, λ, V )Ψχ, λ, V )Ψχ 3, λ, U)Φλ, U)e nλ)dλ. 1/qQ Reducing the characters into primitive characters and observing that, for primitive character with r q, Ψχχ 0, λ, W ) Ψχ, λ, W ) = Λm)χχ 0 m) χm))eλm 3 ) δ χχ 0 δ χ ) eλm 3 ) m W m W log p L, p q, p r p j W 7
9 we have I 5 = r 1 P r 3 P χ 1 mod r 1 χ 3 mod r 3 q P [r 1,r,r 3 ] q Bn, q, χ 1 χ 0, χ χ 0, χ 3 χ 0 ) qϕ 3 q) 1/qQ Ψχ 1 χ 0, λ, V )Ψχ χ 0, λ, V )Ψχ 3 χ 0, λ, U)Φλ, U)e nλ)dλ 1/qQ L [r1, r, r 3 ] I5, 4.6) r 1 P r 3 P χ 1 mod r 1 χ 3 mod r 3 by Lemma 4.3. Here with I 5 = 1/[r1,r,r 3 ]Q 1/[r 1,r,r 3 ]Q Ψ χ 1, λ, V )Ψ χ, λ, V )Ψ χ 3, λ, U) Φλ, U) dλ, Ψ χ, λ, W ) = Ψχ, λ, W ) + L. 4.7) By Cauchy s inequality, I5 max λ 1/r 1 Q Ψ χ 1, λ, V ) max λ 1/r Q Ψ χ, λ, V ) ) 1/ 1/r3 Q 1/ 1/Q Ψ χ 3, λ, U)) dλ Φλ, U) dλ). 1/r 3 Q 1/Q Here an application of 4.4) easily gives 1/Q 1/Q On the other hand, by Lemma 4.4 and 4.7), r 3 P χ 3 mod r 3 Φλ, U) dλ U ) 1/r3 [r1, r, r 3 ] Q Ψ χ 3, λ, U)) dλ [r 1, r ] U 1/ L c 3 + L [r 1, r ] U 1/ L c 3. 1/r 3 Q r 3 P χ 3 mod r 3 ) 1/ [r1, r, r 3 ] r 3 Q) 1/ Collecting these estimates, we get from 4.6) that I 5 U 1 L c 3+1 max λ 1/r 1 Q Ψ χ 1, λ, V ) r 1 P χ 1 mod r 1 r P χ mod r [r1, r ] max λ 1/r Q Ψ χ, λ, V ). 4.9) By Lemma 4.5 and 4.7), the last double sum is r 1 V L 17 + L [r1, r ] r 1 V L 17. r P χ mod r 8
10 Therefore, I 5 U 1 V L c 3+18 r 1 P χ 1 mod r 1 r 1 max λ 1/r 1 Q Ψ χ 1, λ, V ) V U 1 L A, by applying 4.7) and ) in Lemma 4.5. This proves the lemma for j = 5. We remark that, in the iterative argument above, we have used the saving r 0 to its full strength, as pointed out right after Lemma 4.3. One sees that the iterative argument is crucial for our improvement, since previously in [11] we used the inequality r 0 r 5/18+ε 1 r 5/18+ε r 5/18+ε 3, which is responsible for the weaker bound EN) N 169/170 there. We would also like to add that the key ingredient to fulfil the iterative argument is the hybrid estimate in Lemmas 5.1 and 5. below. To finish the proof of Lemma 4., we need to sketch how to estimate I j for j = 1,..., 4. As an example, we consider I 3. By definition and by reducing the characters into primitive ones, we get by Lemma 4.3 and 4.7) that I 3 L r P 1/rQ r Ψ χ, λ, U) Φλ, U) Φ λ, V ) dλ 1/rQ V L r P ) 1/ 1/rQ 1/Q r Ψ χ, λ, U)) dλ Φλ, U) dλ 1/rQ 1/Q ) 1/ V U 1 L A, by 4.8) and Lemma 4.4 for g = 1. This finishes the proof of Lemma Proof of Lemmas 4.4 and 4.5. We need to do some preparations to establish Lemmas 4.4 and 4.5. positive integer and let M j, j = 1,..., 10, be positive integers satisfying Let M be a large 9 M M 1 M 10 M) and M 6,..., M 10 M) 1/5. 5.1) For any positive integer m, let log m, if j = 1, a j m) = 1, if j =,..., 5, µm), if j = 6,..., ) We define the following functions of a complex variable s: f j s, χ) = m M j a j m)χm) m s, F s, χ) = f 1 s, χ) f 10 s, χ). 5.3) Then we have the following hybrid type estimate for F 1/ + it, χ), which is Lemma.1 in Liu [8]. 9
11 Lemma 5.1. For any T > 0, d 1 and 1 R M, we have r R d r T T ) { 1 R F + it, χ dt d T + R } d 1/ T 1/ M 3/10 + M 1/ L c 4. We also need zero-density estimates in forms stated in the following lemma. Lemma 5.. Let T 1, Q 1 and 1 d Q. Then q Q d q χ mod q Q ) Aσ)1 σ) T Nσ, T, χ) L 14, d where for 1/ σ < 3/4, Aσ) = 3/ σ); and for 3/4 σ 1, Aσ) = 1/5 + ε. Proof. We observe that under the restriction d q, Theorem 1. in Montgomery [9] can be restated as follows: For 1/ σ 4/5 q Q d q χ mod q Q ) 31 σ)/ σ) T Nσ, T, χ) L 9, d and for 4/5 σ 1 q Q d q χ mod q Q ) 1 σ)/σ T Nσ, T, χ) L 14. d This proves the lemma for 1/ σ < 3/4 and 5/6 σ 1. For 3/4 σ 5/6, the desired assertion is included in 1.1) of Huxley [7]. Proof of Lemma 4.4. Note that for primitive character, δ χ = 1 if r = 1, and δ χ = 0 otherwise. Hence 1/rQ [r, g] Ψχ, λ, U) dλ 1 r P = g 1/Q + 1<r P = J 1 + J, 1/Q m U 1/rQ Λm) 1)eλm 3 ) dλ [r, g] 1/rQ 1/rQ m U 10 ) 1/ 1/ Λm)χm)eλm 3 ) dλ 1/ 5.4)
12 say. By Gallagher s lemma see [3, Lemma 1]), 1/Q ) Λm) 1)eλm 3 1 ) dλ Q where 1/Q m U By the trivial bound one derives Let Y 0 = maxv 1/3, U), = ) 1 8U 3 Q U 3 Q v<m 3 v+q m U X 0 = minv + Q) 1/3, U). Y 0 <m X 0 Λm) 1) X 0 Y 0 )L U QL, J 1 g U 1/ L. Λm) 1) dv Λm) 1) dv, Y 0 <m X 0 We now turn to J. Applying Gallagher s lemma as before, the integral in J is ) 1 8U 3 Λm)χm) dv. 5.5) rq U 3 rq v<m 3 v+rq m U Y = Y v) = maxv 1/3, U), X = Xv) = minv + rq) 1/3, U). 5.6) Then the sum in 5.5) can be rewritten as Λm)χm). 5.7) Y <m X Now we recall Heath-Brown s identity see [4, Lemma 1]) for k = 5, which states that for m M, Λm) = 5 j=1 ) 5 1) j 1 log m 1 )µm j+1) µm j). j m 1 m j =m m j+1,...,m j M) 1/5 Putting this in 5.7), the sum is written into a linear combination of OL 10 ) terms, each of which is of the form ΣX; M) = m 1 M 1 m 10 M 10 Y <m 1 m 10 X a 1 m 1 )χm 1 ) a 10 m 10 )χm 10 ), where a i m) are given by 5.), and M j are positive integers satisfying 5.1) with M = U. Here M denotes the vector M 1, M,..., M 10 ). Therefore we get from 5.4) and 5.5) that J [r, g] 1 { 8U 3 1/ ΣX; M) ) dv}. 5.8) rq 1<r P U 3 rq 11 M
13 Applying Perron s summation formula see for example [13, Lemma 3.1]) and then shifting the contour to the left, we have ΣX; M) = 1 1+1/L+iT πi 1+1/L it { = 1 1/ it πi 1+1/L it F s, χ) Xs Y s ds + O s 1/+iT + + 1/ it 1+1/L+iT 1/+iT ) XL T } F s, χ) Xs Y s ds + O s XL where F s, χ) is as defined in 5.3), and T is a parameter satisfying T X. The integral on the two horizontal segments above is bounded by in view of the trivial estimate Thus, max F σ ± it, χ) Xσ 1/ σ 1+1/L T 10 F σ ± it, χ) = f j σ ± it, χ) L j=1 UL T, 10 j=1 M 1 σ j U 1 σ L. ΣX; M) = 1 T ) 1 X 1/+it F π T + it, χ Y 1/+it dt + O 1/ + it Moreover, one sees from the estimate UL T ). T ), X 1/+it Y 1/+it 1/ + it = X Y u 1/+it du X 1/ Y 1/ U 5/ rq); and the trivial bound X 1/+it Y 1/+it 1/ + it U 1/ t that X 1/+it Y 1/+it 1/ + it ) rq U 1/ min, U 5/ t r U 1/ min P, 1 ). t Thus, by taking T = U, we obtain ΣX; M) ru 1/ P +U 1/ t P/r P/r< t U 1 ) 1 F + it, χ dt ) 1 F + it, χ dt t + OL ).
14 Note that the right hand side is independent of v. Thus by inserting this in 5.8), we obtain say. Clearly J U QP ) 1 +U Q 1 1<r P 1<r P [r, g] M r 1 [r, g] M +U 3/ Q 1 L 1 r 1 [r, g] = J 1 + J + J 3, J 3 U 3/ Q 1 L 1 g 1<r P 1<r P To estimate J 1, one notes that [r, g] = rgr, g) 1. Thus J 1 U 1 g M g U 1 L M r R d r d g t P/R d 5/6 ε By Lemma 5.1, the last double sum is t P/r P/r< t U ) 1 F + it, χ dt ) 1 F + it, χ dt t r 1 g U 3/ P L 1 g U 1/. 1<r P d r d 5/6 ε max d R P R d g ) 1 F + it, χ dt. r t P/r T ) L max 1 1 T P/R F r R T + it, χ dt d r } L c 4+1 {P R/d + P R/d) 1/ U 3/10 + U 1/, ) 1 F + it, χ dt and hence J 1 g U 1 L c 4+1 P 7/6+ε + P 1/ U 3/10 + U 1/ ) g U 1/ L c 4+1, on noting that P U /5. Now it remains to estimate J. We have J g U 1 P L M r R d r P/R t U 13 d 5/6 ε max d R P R 11/6+ε d g ) 1 F + it, χ dt t. 5.9)
15 The last double sum can be estimated via Lemma 5.1 again, which gives 1 T ) L max 1 P/R<T U T F + it, χ dt L c 4+1) Inserting this in 5.9), we get r R d r T {R d 1 + R 3/ dp ) 1/ U 3/10 + RP 1 U 1/ }. J g U 1 P L c 4+1) P 1/6+ε + P 1/ U 3/10 + P 1 U 1/ ) g U 1/ L c 4+1. The first assertion of Lemma 4.4 now follows by letting c 3 = c Now we consider the special case of g = 1. We write 1 r P 1/ 1/rQ r Ψχ, λ, U) dλ) = H 1 + H, 1/rQ where H 1, H denote contributions from those with r L B and L B < r P, respectively with B = 10A. To estimate H, we follow the argument in estimating J but let g = 1 and add the restriction r > L B. We will get H U 1/ L A. To estimate H 1, we apply Gallager s lemma as before to get H 1 r L B r 1 rq where X, Y are as defined by 5.6). m x 8U 3 U 3 rq Y <m X γ T Λm)χm) δ χ ) dv Now we apply the explicit formula see [, 17, 9)-10); 19, 4)-9)]) Λm)χm) = δ χ x x ρ ) xlog qxt ) ρ + O, 5.10) T where < T x is a parameter and ρ = σ + iγ is a typical nontrivial zero of the Dirichlet L-function Ls, χ). Let T = P L B. Then Y <m X Λm)χm) δ χ ) Xρ Y ρ + OUP 1 L B+ ) ρ γ P L B U rq) U σ 1 + OUP 1 L B+ ). γ P L B 1/, Hence H 1 U 1/ r L B γ P L B U σ 1 + U 1/ L A. 14
16 By Satz VIII.6. of Prachar [10] and Siegel s theorem see [, 1]), there exists a positive constant c 5 such that for r L B, Ls, χ) is zero-free in the region σ 1 c 5 / max{log r, log 4/5 x}, t x. Let ηn) = c 5 log 4/5 N. Then by integrating by parts and Lemma 5. with d = 1, we have H 1 U 1/ L 15 max 1/ σ 1 ηn) L4B P ) 1/5+ε)1 σ) U σ 1 + U 1/ L A U 1/ L A, since P U 5/1 ε. Proof of Lemma ) By integrating by parts and noticing λ V 3 < 1, we have Ψχ, λ, V ) = V V max V u V eλu 3 )d V <m u V <m u Λm)χm) δ χ ) Λm)χm) δ χ ). 5.11) By applying 5.10) with T = x/ = V to 5.11), we get r P r P [r, g] g V L d P d g max λ 1/rQ Ψχ, λ, V ) [r, g] 1 + γ ) 1 V β + g P L max 0<T <V 1 + T ) 1 r R d r := K + g V L A, say. By making use of Lemma 5., we have r R d r γ T V β 1 γ V d 5/6 ε max d R P R L 14 R T/d ) A1/)/ V 1/ + L 15 1 γ T 1/ V β 1 + g V L A R T/d ) Aσ)1 σ) V σ 1 dσ, where for 1/ σ < 3/4, Aσ) = 3/ σ); while for 3/4 σ 1, Aσ) = 1/5 + ε. Since Aσ)1 σ) 1 for 1/ σ 1, we see that the total power of T in K is negative. Thus K g V L 17 max 1/ σ 1 d P d g d 5/6 ε 15 max d R P R R /d ) Aσ)1 σ) V σ )
17 Let σ 0 = 8 + 1ε)/13 + 6ε), which is the solution of Aσ)1 σ) = 5/6 ε. Then K g V L 17 max 1/ σ σ 0 P Aσ)1 σ) V σ 1 +g V L 17 max σ 0 <σ 1 P Aσ)1 σ) V σ 1. The first maximum is OL A ) if P V 1/h ε where h = max 1/ σ σ0 {Aα) 5/61 σ)} = 7/3. Similarly the second maximum is O1) if P V 1/h where h = max σ0 σ 1 Aα) = 1/5 + ε. This proves 1). ) We write r P r max Ψχ, λ, V ) = Z 1 + Z, λ 1/rQ where Z 1 and Z denote contributions from those with r L B and L B < r P, respectively. By similar arguments as those leading to 5.1) but with g = 1, d = 1 and the restriction that R L B, we get Z V L 17 max max 1/ σ 1 L B R P R Aσ)1 σ) V σ 1 V L 17 max 1/ σ σ 0 P Aσ)1 σ) V σ 1 V L A, +V L 17 max σ 0 <σ 17/18 P Aσ)1 σ) V σ 1 + V L B/+17 since P V 5/1 ε. This finishes the estimate for Z. Now we turn to Z 1. By 5.11), we have Z 1 r L B max V u V V <m u Λm)χm) δ χ ). Now the desired estimate follows by applying Siegel-Walfisz theorem in the form of the bound: For a primitive character, r log B X Λm)χm) δ χ ) X exp cb) ) log X. m X This proves the lemma. Acknowledgement. The authors are indebted to the referee for valuable suggestions that simplify parts of the argument and bring improvements to the paper. The original version of the paper has the result that EN) N 53/54+ɛ. The improvement obtained in the present Theorem 1.1 is due to an idea of the referee. The first author is supported by a Post-Doctoral Fellowship of The University of Hong Kong. 16
18 References [1] H. Davenport, On Waring s problem for cubes, Acta Math ), [] H. Davenport, Multiplicative Number Theory, nd edition, Springer Verlag, Berlin [3] P.X. Gallagher, A large sieve density estimate near σ = 1, Invent. Math ), [4] D.R. Heath-Brown, Prime numbers in short intervals and a generalized Vaughan s identity, Can. J. Math ), [5] L.K. Hua, Some results in additive prime number theory, Quart. J. Math ), [6] L.K. Hua, Additive theory of prime numbers, Science press, Beijing 1957; English version, American Mathematical Society, Providence [7] M.N. Huxley, Large values of Dirichlet polynomials, III, Acta Arith ), [8] J.Y. Liu, On Lagrange s theorem with prime variables, to appear in Quart. J. Math. [9] H.L. Montgomery, Topics in Multiplicative number theory, LNM 7, Springer-Verlag, Berlin. Heidelberg. New York [10] K. Prachar, Primzahlverteilung, Springer Verlag, Berlin [11] X. Ren, The exceptional set in Roth s theorem concerning a cube and three cubes of primes, Quart. J. Math ), [1] K.F. Roth, On Waring s problem for cubes, Proc. London Math. Soc. ) ), [13] E.C. Titchmarsh Revised by D.R. Heath-Brown), The theory of the Riemann zeta-function, nd edition, Oxford University Press, Oxford [14] R.C. Vaughan, The Hardy-Littlewood method, nd edition, Cambridge University Press, Cambridge
On sums of squares of primes
Under consideration for publication in ath. Proc. Camb. Phil. Soc. 1 On sums of squares of primes By GLYN HARAN Department of athematics, Royal Holloway University of London, Egham, Surrey TW 2 EX, U.K.
More informationBefore giving the detailed proof, we outline our strategy. Define the functions. for Re s > 1.
Chapter 7 The Prime number theorem for arithmetic progressions 7. The Prime number theorem We denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.. We have π( as. log Before
More informationSOME MEAN VALUE THEOREMS FOR THE RIEMANN ZETA-FUNCTION AND DIRICHLET L-FUNCTIONS D.A. KAPTAN, Y. KARABULUT, C.Y. YILDIRIM 1.
SOME MEAN VAUE HEOREMS FOR HE RIEMANN ZEA-FUNCION AND DIRICHE -FUNCIONS D.A. KAPAN Y. KARABUU C.Y. YIDIRIM Dedicated to Professor Akio Fujii on the occasion of his retirement 1. INRODUCION he theory of
More informationarxiv: v1 [math.nt] 5 Mar 2015
ON SUMS OF FOUR SQUARES OF PRIMES ANGEL KUMCHEV AND LILU ZHAO arxiv:1503.01799v1 [math.nt] 5 Mar 2015 Let Abstract. Let E(N) denote the number of positive integers n N, with n 4 (mod 24), which cannot
More informationON SUMS OF PRIMES FROM BEATTY SEQUENCES. Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD , U.S.A.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A08 ON SUMS OF PRIMES FROM BEATTY SEQUENCES Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD 21252-0001,
More informationLecture 1: Small Prime Gaps: From the Riemann Zeta-Function and Pair Correlation to the Circle Method. Daniel Goldston
Lecture 1: Small Prime Gaps: From the Riemann Zeta-Function and Pair Correlation to the Circle Method Daniel Goldston π(x): The number of primes x. The prime number theorem: π(x) x log x, as x. The average
More informationCharacter sums with Beatty sequences on Burgess-type intervals
Character sums with Beatty sequences on Burgess-type intervals William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationas x. Before giving the detailed proof, we outline our strategy. Define the functions for Re s > 1.
Chapter 7 The Prime number theorem for arithmetic progressions 7.1 The Prime number theorem Denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.1. We have π( log as. Before
More informationA NOTE ON CHARACTER SUMS IN FINITE FIELDS. 1. Introduction
A NOTE ON CHARACTER SUMS IN FINITE FIELDS ABHISHEK BHOWMICK, THÁI HOÀNG LÊ, AND YU-RU LIU Abstract. We prove a character sum estimate in F q[t] and answer a question of Shparlinski. Shparlinski [5] asks
More informationGOLDBACH S PROBLEMS ALEX RICE
GOLDBACH S PROBLEMS ALEX RICE Abstract. These are notes from the UGA Analysis and Arithmetic Combinatorics Learning Seminar from Fall 9, organized by John Doyle, eil Lyall, and Alex Rice. In these notes,
More informationSome Arithmetic Functions Involving Exponential Divisors
2 3 47 6 23 Journal of Integer Sequences, Vol. 3 200, Article 0.3.7 Some Arithmetic Functions Involving Exponential Divisors Xiaodong Cao Department of Mathematics and Physics Beijing Institute of Petro-Chemical
More informationE-SYMMETRIC NUMBERS (PUBLISHED: COLLOQ. MATH., 103(2005), NO. 1, )
E-SYMMETRIC UMBERS PUBLISHED: COLLOQ. MATH., 032005), O., 7 25.) GAG YU Abstract A positive integer n is called E-symmetric if there exists a positive integer m such that m n = φm), φn)). n is called E-asymmetric
More informationThe Circle Method. Basic ideas
The Circle Method Basic ideas 1 The method Some of the most famous problems in Number Theory are additive problems (Fermat s last theorem, Goldbach conjecture...). It is just asking whether a number can
More information#A61 INTEGERS 14 (2014) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES
#A6 INTEGERS 4 (24) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES Habiba Kadiri Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Canada habiba.kadiri@uleth.ca Allysa
More informationExponential and character sums with Mersenne numbers
Exponential and character sums with Mersenne numbers William D. Banks Dept. of Mathematics, University of Missouri Columbia, MO 652, USA bankswd@missouri.edu John B. Friedlander Dept. of Mathematics, University
More informationLINNIK S THEOREM MATH 613E UBC
LINNIK S THEOREM MATH 63E UBC FINAL REPORT BY COLIN WEIR AND TOPIC PRESENTED BY NICK HARLAND Abstract This report will describe in detail the proof of Linnik s theorem regarding the least prime in an arithmetic
More informationOn the Fractional Parts of a n /n
On the Fractional Parts of a n /n Javier Cilleruelo Instituto de Ciencias Matemáticas CSIC-UAM-UC3M-UCM and Universidad Autónoma de Madrid 28049-Madrid, Spain franciscojavier.cilleruelo@uam.es Angel Kumchev
More informationON THE CONSTANT IN BURGESS BOUND FOR THE NUMBER OF CONSECUTIVE RESIDUES OR NON-RESIDUES Kevin J. McGown
Functiones et Approximatio 462 (2012), 273 284 doi: 107169/facm/201246210 ON THE CONSTANT IN BURGESS BOUND FOR THE NUMBER OF CONSECUTIVE RESIDUES OR NON-RESIDUES Kevin J McGown Abstract: We give an explicit
More informationPrime Divisors of Palindromes
Prime Divisors of Palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 6511 USA bbanks@math.missouri.edu Igor E. Shparlinski Department of Computing, Macquarie University
More informationPrimes in arithmetic progressions to large moduli
CHAPTER 3 Primes in arithmetic progressions to large moduli In this section we prove the celebrated theorem of Bombieri and Vinogradov Theorem 3. (Bombieri-Vinogradov). For any A, thereeistsb = B(A) such
More informationThe major arcs approximation of an exponential sum over primes
ACTA ARITHMETICA XCII.2 2 The major arcs approximation of an exponential sum over primes by D. A. Goldston an Jose, CA. Introduction. Let. α = Λnenα, eu = e 2πiu, where Λn is the von Mangoldt function
More informationThe ternary Goldbach problem. Harald Andrés Helfgott. Introduction. The circle method. The major arcs. Minor arcs. Conclusion.
The ternary May 2013 The ternary : what is it? What was known? Ternary Golbach conjecture (1742), or three-prime problem: Every odd number n 7 is the sum of three primes. (Binary Goldbach conjecture: every
More informationAverage Orders of Certain Arithmetical Functions
Average Orders of Certain Arithmetical Functions Kaneenika Sinha July 26, 2006 Department of Mathematics and Statistics, Queen s University, Kingston, Ontario, Canada K7L 3N6, email: skaneen@mast.queensu.ca
More informationLARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS
LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS HELMUT MAIER AND MICHAEL TH. RASSIAS Abstract. We rove a modification as well as an imrovement
More informationWaring s problem, the declining exchange rate between small powers, and the story of 13,792
Waring s problem, the declining exchange rate between small powers, and the story of 13,792 Trevor D. Wooley University of Bristol Bristol 19/11/2007 Supported in part by a Royal Society Wolfson Research
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationON THE DIVISOR FUNCTION IN SHORT INTERVALS
ON THE DIVISOR FUNCTION IN SHORT INTERVALS Danilo Bazzanella Dipartimento di Matematica, Politecnico di Torino, Italy danilo.bazzanella@polito.it Autor s version Published in Arch. Math. (Basel) 97 (2011),
More informationPATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS
PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS JÁNOS PINTZ Rényi Institute of the Hungarian Academy of Sciences CIRM, Dec. 13, 2016 2 1. Patterns of primes Notation: p n the n th prime, P = {p i } i=1,
More informationstrengthened. In 1971, M. M. Dodson [5] showed that fl(k; p) <c 1 if p>k 2 (here and below c 1 ;c 2 ;::: are some positive constants). Various improve
Nonlinear Analysis: Modelling and Control, Vilnius, IMI, 1999, No 4, pp. 23-30 ON WARING'S PROBLEM FOR A PRIME MODULUS A. Dubickas Department of Mathematics and Informatics, Vilnius University, Naugarduko
More informationAverage value of the Euler function on binary palindromes
Average value of the Euler function on binary palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 652 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationMath 229: Introduction to Analytic Number Theory The product formula for ξ(s) and ζ(s); vertical distribution of zeros
Math 9: Introduction to Analytic Number Theory The product formula for ξs) and ζs); vertical distribution of zeros Behavior on vertical lines. We next show that s s)ξs) is an entire function of order ;
More informationGAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT
Journal of Prime Research in Mathematics Vol. 8 202, 28-35 GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL
More informationTOPICS IN NUMBER THEORY - EXERCISE SHEET I. École Polytechnique Fédérale de Lausanne
TOPICS IN NUMBER THEORY - EXERCISE SHEET I École Polytechnique Fédérale de Lausanne Exercise Non-vanishing of Dirichlet L-functions on the line Rs) = ) Let q and let χ be a Dirichlet character modulo q.
More informationOn Some Mean Value Results for the Zeta-Function and a Divisor Problem
Filomat 3:8 (26), 235 2327 DOI.2298/FIL6835I Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On Some Mean Value Results for the
More informationEstimates for sums over primes
8 Estimates for sums over primes Let 8 Principles of the method S = n N fnλn If f is monotonic, then we can estimate S by using the Prime Number Theorem and integration by parts If f is multiplicative,
More informationDiophantine Approximation by Cubes of Primes and an Almost Prime
Diophantine Approximation by Cubes of Primes and an Almost Prime A. Kumchev Abstract Let λ 1,..., λ s be non-zero with λ 1/λ 2 irrational and let S be the set of values attained by the form λ 1x 3 1 +
More informationOn Gauss sums and the evaluation of Stechkin s constant
On Gauss sums and the evaluation of Stechkin s constant William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bankswd@missouri.edu Igor E. Shparlinski Department of Pure
More informationOn the representation of primes by polynomials (a survey of some recent results)
On the representation of primes by polynomials (a survey of some recent results) B.Z. Moroz 0. This survey article has appeared in: Proceedings of the Mathematical Institute of the Belarussian Academy
More informationarxiv:math/ v1 [math.nt] 24 Oct 2006
Small Prime Solutions to Cubic Diophantine Equations arxiv:math/0610739v1 [math.nt] 24 Oct 2006 by Desmond Leung B.A., Wilfrid Laurier University, 2004 a thesis submitted in partial fulfillment of the
More informationSUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM MOD P
SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM MOD P TODD COCHRANE AND CHRISTOPHER PINNER Abstract. Let γ(k, p) denote Waring s number (mod p) and δ(k, p) denote the ± Waring s number (mod p). We use
More informationShort character sums for composite moduli
Short character sums for composite moduli Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract We establish new estimates on short character sums for arbitrary
More informationFlat primes and thin primes
Flat primes and thin primes Kevin A. Broughan and Zhou Qizhi University of Waikato, Hamilton, New Zealand Version: 0th October 2008 E-mail: kab@waikato.ac.nz, qz49@waikato.ac.nz Flat primes and thin primes
More informationA Remark on Sieving in Biased Coin Convolutions
A Remark on Sieving in Biased Coin Convolutions Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract In this work, we establish a nontrivial level of distribution
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if
More informationOmega result for the mean square of the Riemann zeta function. Yuk-Kam Lau and Kai-Man Tsang
Omega result for the mean square of the Riemann zeta function Yuk-Kam Lau and Kai-Man Tsang Abstract A recent method of Soundararajan enables one to obtain improved Ω-result for finite series of the form
More informationIntegers without large prime factors in short intervals and arithmetic progressions
ACTA ARITHMETICA XCI.3 (1999 Integers without large prime factors in short intervals and arithmetic progressions by Glyn Harman (Cardiff 1. Introduction. Let Ψ(x, u denote the number of integers up to
More informationTheorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x.
Chapter 1 Introduction 1.1 The Prime Number Theorem In this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if lim f(/g( = 1, and denote by log the natural
More informationA family of quartic Thue inequalities
A family of quartic Thue inequalities Andrej Dujella and Borka Jadrijević Abstract In this paper we prove that the only primitive solutions of the Thue inequality x 4 4cx 3 y + (6c + 2)x 2 y 2 + 4cxy 3
More informationψ(y + h; q, a) ψ(y; q, a) Λ(n), (1.2) denotes a sum over a set of reduced residues modulo q. We shall assume throughout x 2, 1 q x, 1 h x, (1.
PRIMES IN SHORT SEGMENTS OF ARITHMETIC PROGRESSIONS D. A. Goldston and C. Y. Yıldırım. Introduction In this paper we study the mean suare distribution of primes in short segments of arithmetic progressions.
More informationOn the Representations of xy + yz + zx
On the Representations of xy + yz + zx Jonathan Borwein and Kwok-Kwong Stephen Choi March 13, 2012 1 Introduction Recently, Crandall in [3] used Andrews identity for the cube of the Jacobian theta function
More informationarxiv: v1 [math.nt] 9 Jan 2019
NON NEAR-PRIMITIVE ROOTS PIETER MOREE AND MIN SHA Dedicated to the memory of Prof. Christopher Hooley (928 208) arxiv:90.02650v [math.nt] 9 Jan 209 Abstract. Let p be a prime. If an integer g generates
More informationRiemann Zeta Function and Prime Number Distribution
Riemann Zeta Function and Prime Number Distribution Mingrui Xu June 2, 24 Contents Introduction 2 2 Definition of zeta function and Functional Equation 2 2. Definition and Euler Product....................
More informationA combinatorial problem related to Mahler s measure
A combinatorial problem related to Mahler s measure W. Duke ABSTRACT. We give a generalization of a result of Myerson on the asymptotic behavior of norms of certain Gaussian periods. The proof exploits
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f g as if lim
More informationPiatetski-Shapiro primes from almost primes
Piatetski-Shapiro primes from almost primes Roger C. Baker Department of Mathematics, Brigham Young University Provo, UT 84602 USA baker@math.byu.edu William D. Banks Department of Mathematics, University
More informationMTH598A Report The Vinogradov Theorem
MTH598A Report The Vinogradov Theorem Anurag Sahay 11141/11917141 under the supervision of Dr. Somnath Jha Dept. of Mathematics and Statistics 4th November, 2015 Abstract The Goldbach conjecture is one
More informationMEAN VALUE THEOREMS AND THE ZEROS OF THE ZETA FUNCTION. S.M. Gonek University of Rochester
MEAN VALUE THEOREMS AND THE ZEROS OF THE ZETA FUNCTION S.M. Gonek University of Rochester June 1, 29/Graduate Workshop on Zeta functions, L-functions and their Applications 1 2 OUTLINE I. What is a mean
More informationQUADRATIC FIELDS WITH CYCLIC 2-CLASS GROUPS
QUADRATIC FIELDS WITH CYCLIC -CLASS GROUPS CARLOS DOMINGUEZ, STEVEN J. MILLER, AND SIMAN WONG Abstract. For any integer k 1, we show that there are infinitely many complex quadratic fields whose -class
More informationTwin primes (seem to be) more random than primes
Twin primes (seem to be) more random than primes Richard P. Brent Australian National University and University of Newcastle 25 October 2014 Primes and twin primes Abstract Cramér s probabilistic model
More informationCONDITIONAL BOUNDS FOR THE LEAST QUADRATIC NON-RESIDUE AND RELATED PROBLEMS
CONDITIONAL BOUNDS FOR THE LEAST QUADRATIC NON-RESIDUE AND RELATED PROBLEMS YOUNESS LAMZOURI, IANNAN LI, AND KANNAN SOUNDARARAJAN Abstract This paper studies explicit and theoretical bounds for several
More informationOn Gelfond s conjecture on the sum-of-digits function
On Gelfond s conjecture on the sum-of-digits function Joël RIVAT work in collaboration with Christian MAUDUIT Institut de Mathématiques de Luminy CNRS-UMR 6206, Aix-Marseille Université, France. rivat@iml.univ-mrs.fr
More informationZeros of the Riemann Zeta-Function on the Critical Line
Zeros of the Riemann Zeta-Function on the Critical Line D.R. Heath-Brown Magdalen College, Oxford It was shown by Selberg [3] that the Riemann Zeta-function has at least c log zeros on the critical line
More informationOn a question of A. Schinzel: Omega estimates for a special type of arithmetic functions
Cent. Eur. J. Math. 11(3) 13 477-486 DOI: 1.478/s11533-1-143- Central European Journal of Mathematics On a question of A. Schinzel: Omega estimates for a special type of arithmetic functions Research Article
More informationOn the elliptic curve analogue of the sum-product problem
Finite Fields and Their Applications 14 (2008) 721 726 http://www.elsevier.com/locate/ffa On the elliptic curve analogue of the sum-product problem Igor Shparlinski Department of Computing, Macuarie University,
More informationFirst, let me recall the formula I want to prove. Again, ψ is the function. ψ(x) = n<x
8.785: Analytic Number heory, MI, spring 007 (K.S. Kedlaya) von Mangoldt s formula In this unit, we derive von Mangoldt s formula estimating ψ(x) x in terms of the critical zeroes of the Riemann zeta function.
More informationON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE
ON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE LIANGYI ZHAO INSTITUTIONEN FÖR MATEMATIK KUNGLIGA TEKNISKA HÖGSKOLAN (DEPT. OF MATH., ROYAL INST. OF OF TECH.) STOCKHOLM SWEDEN Dirichlet
More informationOn pseudosquares and pseudopowers
On pseudosquares and pseudopowers Carl Pomerance Department of Mathematics Dartmouth College Hanover, NH 03755-3551, USA carl.pomerance@dartmouth.edu Igor E. Shparlinski Department of Computing Macquarie
More informationFermat numbers and integers of the form a k + a l + p α
ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac
More informationTHE LAPLACE TRANSFORM OF THE FOURTH MOMENT OF THE ZETA-FUNCTION. Aleksandar Ivić
THE LAPLACE TRANSFORM OF THE FOURTH MOMENT OF THE ZETA-FUNCTION Aleksandar Ivić Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. (2), 4 48. Abstract. The Laplace transform of ζ( 2 +ix) 4 is investigated,
More informationOn pseudosquares and pseudopowers
On pseudosquares and pseudopowers Carl Pomerance Department of Mathematics Dartmouth College Hanover, NH 03755-3551, USA carl.pomerance@dartmouth.edu Igor E. Shparlinski Department of Computing Macquarie
More informationThe universality of quadratic L-series for prime discriminants
ACTA ARITHMETICA 3. 006) The universality of quadratic L-series for prime discriminants by Hidehiko Mishou Nagoya) and Hirofumi Nagoshi Niigata). Introduction and statement of results. For an odd prime
More informationTHE NUMBER OF GOLDBACH REPRESENTATIONS OF AN INTEGER
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 140, Number 3, March 01, Pages 795 804 S 000-9939011)10957- Article electronicall published on Jul 0, 011 THE NUMBER OF GOLDBACH REPRESENTATIONS
More informationSOME RESULTS AND PROBLEMS IN PROBABILISTIC NUMBER THEORY
Annales Univ. Sci. Budapest., Sect. Comp. 43 204 253 265 SOME RESULTS AND PROBLEMS IN PROBABILISTIC NUMBER THEORY Imre Kátai and Bui Minh Phong Budapest, Hungary Le Manh Thanh Hue, Vietnam Communicated
More informationCongruences involving product of intervals and sets with small multiplicative doubling modulo a prime
Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime J. Cilleruelo and M. Z. Garaev Abstract We obtain a sharp upper bound estimate of the form Hp o(1)
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More informationPredictive criteria for the representation of primes by binary quadratic forms
ACTA ARITHMETICA LXX3 (1995) Predictive criteria for the representation of primes by binary quadratic forms by Joseph B Muskat (Ramat-Gan), Blair K Spearman (Kelowna, BC) and Kenneth S Williams (Ottawa,
More informationA Remark on Sieving in Biased Coin Convolutions
A Remark on Sieving in Biased Coin Convolutions Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract In this work, we establish a nontrivial level of distribution
More informationNOTES ON ZHANG S PRIME GAPS PAPER
NOTES ON ZHANG S PRIME GAPS PAPER TERENCE TAO. Zhang s results For any natural number H, let P (H) denote the assertion that there are infinitely many pairs of distinct primes p, q with p q H; thus for
More informationEXPLICIT CONSTANTS IN AVERAGES INVOLVING THE MULTIPLICATIVE ORDER
EXPLICIT CONSTANTS IN AVERAGES INVOLVING THE MULTIPLICATIVE ORDER KIM, SUNGJIN DEPARTMENT OF MATHEMATICS UNIVERSITY OF CALIFORNIA, LOS ANGELES MATH SCIENCE BUILDING 667A E-MAIL: 70707@GMAILCOM Abstract
More informationOn primitive elements in finite fields of low characteristic
On primitive elements in finite fields of low characteristic Abhishek Bhowmick Thái Hoàng Lê September 16, 2014 Abstract We discuss the problem of constructing a small subset of a finite field containing
More informationHarmonic sets and the harmonic prime number theorem
Harmonic sets and the harmonic prime number theorem Version: 9th September 2004 Kevin A. Broughan and Rory J. Casey University of Waikato, Hamilton, New Zealand E-mail: kab@waikato.ac.nz We restrict primes
More informationMaximal Class Numbers of CM Number Fields
Maximal Class Numbers of CM Number Fields R. C. Daileda R. Krishnamoorthy A. Malyshev Abstract Fix a totally real number field F of degree at least 2. Under the assumptions of the generalized Riemann hypothesis
More informationThe zeros of the derivative of the Riemann zeta function near the critical line
arxiv:math/07076v [mathnt] 5 Jan 007 The zeros of the derivative of the Riemann zeta function near the critical line Haseo Ki Department of Mathematics, Yonsei University, Seoul 0 749, Korea haseoyonseiackr
More information1 Sieving an interval
Math 05 notes, wee 9 C. Pomerance Sieving an interval It is interesting that our sieving apparatus that we have developed is robust enough to handle some problems on the distribution of prime numbers that
More informationarxiv: v1 [math.nt] 24 Mar 2009
A NOTE ON THE FOURTH MOMENT OF DIRICHLET L-FUNCTIONS H. M. BUI AND D. R. HEATH-BROWN arxiv:93.48v [math.nt] 4 Mar 9 Abstract. We prove an asymptotic formula for the fourth power mean of Dirichlet L-functions
More informationLes chiffres des nombres premiers. (Digits of prime numbers)
Les chiffres des nombres premiers (Digits of prime numbers) Joël RIVAT Institut de Mathématiques de Marseille, UMR 7373, Université d Aix-Marseille, France. joel.rivat@univ-amu.fr soutenu par le projet
More information198 VOLUME 46/47, NUMBER 3
LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationAN EXTENSION TO THE BRUN-TITCHMARSH THEOREM
AN EXTENSION TO THE BRUN-TITCHMARSH THEOREM TSZ HO CHAN, STEPHEN KWOK-KWONG CHOI, AND KAI MAN TSANG Abstract The Siegel-Walfisz Theorem states that for any B > 0, we have p p a mod ϕ log for log B and,
More informationOn the number of elements with maximal order in the multiplicative group modulo n
ACTA ARITHMETICA LXXXVI.2 998 On the number of elements with maximal order in the multiplicative group modulo n by Shuguang Li Athens, Ga.. Introduction. A primitive root modulo the prime p is any integer
More informationof Classical Constants Philippe Flajolet and Ilan Vardi February 24, 1996 Many mathematical constants are expressed as slowly convergent sums
Zeta Function Expansions of Classical Constants Philippe Flajolet and Ilan Vardi February 24, 996 Many mathematical constants are expressed as slowly convergent sums of the form C = f( ) () n n2a for some
More informationOn the second smallest prime non-residue
On the second smallest prime non-residue Kevin J. McGown 1 Department of Mathematics, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92093 Abstract Let χ be a non-principal Dirichlet
More informationDIRICHLET S THEOREM ABOUT PRIMES IN ARITHMETIC PROGRESSIONS. Contents. 1. Dirichlet s theorem on arithmetic progressions
DIRICHLET S THEOREM ABOUT PRIMES IN ARITHMETIC PROGRESSIONS ANG LI Abstract. Dirichlet s theorem states that if q and l are two relatively rime ositive integers, there are infinitely many rimes of the
More informationDIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS. 1. Introduction
DIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS INNA ZAKHAREVICH. Introduction It is a well-known fact that there are infinitely many rimes. However, it is less clear how the rimes are distributed
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationCarmichael numbers with a totient of the form a 2 + nb 2
Carmichael numbers with a totient of the form a 2 + nb 2 William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bankswd@missouri.edu Abstract Let ϕ be the Euler function.
More information64 Garunk»stis and Laurin»cikas can not be satised for any polynomial P. S. M. Voronin [10], [12] obtained the functional independence of the Riemann
PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE Nouvelle série, tome 65 (79), 1999, 63 68 ON ONE HILBERT'S PROBLEM FOR THE LERCH ZETA-FUNCTION R. Garunk»stis and A. Laurin»cikas Communicated by Aleksandar Ivić
More informationOn the Density of Sequences of Integers the Sum of No Two of Which is a Square II. General Sequences
On the Density of Sequences of Integers the Sum of No Two of Which is a Square II. General Sequences J. C. Lagarias A.. Odlyzko J. B. Shearer* AT&T Labs - Research urray Hill, NJ 07974 1. Introduction
More informationON THE AVERAGE RESULTS BY P. J. STEPHENS, S. LI, AND C. POMERANCE
ON THE AVERAGE RESULTS BY P J STEPHENS, S LI, AND C POMERANCE IM, SUNGJIN Abstract Let a > Denote by l ap the multiplicative order of a modulo p We look for an estimate of sum of lap over primes p on average
More informationResearch Statement. Enrique Treviño. M<n N+M
Research Statement Enrique Treviño My research interests lie in elementary analytic number theory. Most of my work concerns finding explicit estimates for character sums. While these estimates are interesting
More information