The major arcs approximation of an exponential sum over primes

Size: px
Start display at page:

Download "The major arcs approximation of an exponential sum over primes"

Transcription

1 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 defined by Λn = log p if n = p m, m, p a prime, and Λn = otherwise. Parseval s euation and the prime number theorem provide the L 2 estimate.2 α 2 dα = Λ 2 n N log N as N, and therefore by the Cauchy chwarz ineuality we have, for any ε > and N sufficiently large,.3 α dα + ε N log N. In this paper we obtain the following improvement on this L upper bound. Theorem. For any ε > and N sufficiently large we have 2 N.4 α dα 2 + ε log N..5 Vaughan [3] has shown that α dα N, 2 Mathematics ubject Classification: Primary L2. Research supported in part by NERC Grant A523 and NF grants. [69]

2 7 D. A. Goldston and has also made the conjecture that there exists a constant c such that, as N,.6 α dα c N log N. This conjecture may be very difficult to prove, but it might be possible to obtain the lower bound.7 α dα N log N. I have proved that.7 follows from a strong form of either the Goldbach or the twin prime conjectures. Further, certain approximations of α also satisfy.7. These results will be presented in a later paper. Notation. We use the following notation. We take n,, r, k, j to always be positive integers, and in general summation signs will start with if a lower limit is not specified. We will use the notation = and =. a a a,= Q Q a 2. The major arc approximation. Hardy and Littlewood [], [2] introduced the method used for the analysis of α. For α near a fraction a/, α = a/ + β is large and can be approximated well by the simple expression where 2. Iβ = µ Iβ, N enβ. n= Here α = a/ + β where β needs to be small so that there are no other fractions with denominators within a distance of β of a/. This reuirement leads to the Farey decomposition of the unit interval. The Farey fractions of order Q are given by F Q = {a/ : Q, a, a, = }. We define the Farey arcs around each of these fractions, except / which we exclude, as follows. Let a / < a/ < a / be consecutive fractions in

3 Major arcs approximation 7 the Farey decomposition of order Q, and let a + a M Q, a = +, a + ] a + for a, a, 2.2 M Q, = ] ] Q +,,. Q + These intervals are disjoint and their union covers the interval [, ]. We will sometimes shift these intervals to the origin, which we denote by a + a 2.3 θ Q, a = + a, a + a + a ] ] = +, + when, and θ Q, = /Q +, /Q + ]. ince Q < + < 2Q and similarly for +, we see ] 2.4 θ Q, a = Q + µ,, Q + ν for integers < µ, ν < Q which depend on a,, and Q. In particular, 2.5 2Q, θ Q, a 2Q Q,. Q Finally we define the characteristic function of M Q, a by { 2.6 χ Q α;, a = if α MQ, a, otherwise. With this preparation, our approximation to α is given by 2.7 J Q α = µ I α a χ Q α;, a. Q a We will call J Q α the major arcs approximation for α. This approximation has the advantage that each term in the approximation is orthogonal to every other on the unit interval, which greatly simplifies the computation of various means. One expects that J Q α will become a better approximation of α as Q is increased as a function of N. For the L 2 norm this is the case when Q N, but for N < Q N the approximation degrades because the support χ Q α;, a becomes so small that the terms with N/Q no longer make any contribution. Because of this we define { Q if Q N, 2.8 Q = minq, N/Q = N/Q if N Q N, and we interpret J Q α as actually being an L 2 approximation to α of length Q rather than Q. This disadvantage of J Q α may be corrected by simply deleting the factor χ Q α;, a in the definition of J Q α, but the resulting approximation is much harder to analyze when Q > N.

4 72 D. A. Goldston We comment that the term major arcs has different meanings depending on the problem the circle method is being applied to as well as individual taste. Our function J Q α is not the only possible choice for an approximation. One complication in applying J Q α is that in some situations one needs to take account of the exact positions of the endpoints of the Farey arcs, which introduces Kloosterman sums. This can often be avoided by using arcs that do not depend on a, such as the intervals in 2.5 that envelope θ Q, a or sometimes even intervals that do not depend on. In this paper however there is no problem with using the Farey arcs in our approximation. The idea for the proof of the Theorem is uite simple. We write 2.9 α = J Q α + T Q α, and refer to T Q α defined by 2.9 as the minor arcs part of α. The major arcs approximation J Q α consists of spikes which are amplified when we take higher powers. As we will see in the next section, J Q α makes only a contribution of at most N in the L norm, but on suaring it contributes half of the amount on the right hand side of.2 when Q = N. Further, in ection 4 we show J Q α and T Q α are essentially orthogonal in L 2, so that T Q α contributes the other half of the amount in.2. Thus, in L the size of α is determined by T Q α, which satisfies an L 2 bound one half as large as the bound in Means of J Q α. We prove in this section some results on means of J Q α. Lemma. For Q N and Q = minq, N/Q, we have 3. J Q α dα Q log 2N Q 2. In particular, 3.2 J Q α dα N. Lemma 2. For Q N, Q = minq, N/Q, and k a positive integer, we have 3.3 J Q α 2k dα = µ2 φ 2k ν kn 2 + OQ 2k Q, n kn where 3.4 ν k n = ν k n, N = In particular, for k = we have n,...,n k N n +...+n k =n.

5 3.5 Major arcs approximation 73 J Q α 2 dα = N log Q + ON. P r o o f of Lemma. By 2.7, J Q α dα = µ Q ince we have, by 2.5, 3.7 Using 3.8 /Q θ Q,a = Q µ 2 M Q,a θ Q,a α I a dα Iβ dβ. N + β sinπnβ Iβ = e 2 sinπβ, Iβ dβ = sinπn β sinπβ = 2 θ Q,a /Q sinπn β sinπβ dβ sinπn β sinπβ N/Q dβ sinπu u du dβ + O. { N/Q if N/Q, log2n/q if N/Q, together with 3.6 and 3.7, for Q N /2 we have J Q α dα /Q µ 2 sinπn β sinπβ dβ + O Q Q µ 2 log 2N Q Q log 2N Q 2 = Q log 2N Q 2, since Q = Q in this case, while for Q > N /2, J Q α dα µ 2 log 2N Q + µ 2 N Q Q < Q Q log 2N Q Q + N Q log Q Q log 2Q = Q log 2N, Q Q which completes the proof of the lemma. Q 2

6 74 D. A. Goldston Now 3.9 P r o o f of Lemma 2. We have J Q α 2k dα = µ 2 φ 2k Q M Q,a = α I a 2k dα θ Q,a n kn M Q,a Iβ 2k dβ = Iβ 2k dβ = ν k nenβ 2 dβ + O = n kn ν 2 kn + OQ 2k. α I a 2k dα. /2 /2Q We also have the trivial bound 3. α I a 2k dα N 2k Q M Q,a [,]θ Q,a dβ β2k Iβ 2k dβ which becomes smaller than the error in 3.9 provided N/Q. We conclude J Q α 2k dα = µ2 φ 2k ν kn 2 + OQ 2k a n kn N 2k µ 2 + O Q φ 2k Q < Q = µ2 φ 2k ν 2 kn n kn + OQ 2k Q + O N 2k QQ 2k where the dash indicates this term only occurs if Q > N /2. We thus see that for Q N /2 the error term above is Q 2k Q as stated in Lemma 2, while for Q > N /2 the error is NQ 2k 2 = Q 2k Q and the lemma follows. In the case k = the result follows from the well known formula [4] 3. Q µ 2 = log Q + O.,

7 Major arcs approximation Inner product of J Q α and α. The pointwise behaviour of α is complicated and the known results are much weaker than what is expected to be true. However when one averages α over the reduced fractions with denominator one easily obtains an asymptotic formula. It is useful to obtain a result of this type due to Vaughan who used it in proving.5. Lemma 3. We have 4. a + β = µβ + O log2n log2. a P r o o f. We have a + β = Λnenβ an e = Λnc nenβ, a a where c n is Ramanujan s sum. ince c n = µ if n, =, and trivially c n, we have Λnc nenβ = µ Λnenβ + O Λn 4.2 n,= = µβ + O n,> n,> Λn = µβ + O log2n log2. We next evaluate the inner product of α and J Q α. Lemma 4. For Q N and Q = minq, N/Q, we have P r o o f. We have 4.3 αj Q α dα = N log Q + ON log2n. αj Q α dα = Q = µ + For the main term we have = µ 4.4 a θ Q,a θ Q,a Q < Q a + β Iβ dβ = + 2. a + β Iβ dβ

8 76 D. A. Goldston Now = µ a µ = 3 4. a a + β Iβ dβ [,]θ Q,a a + β Iβ dβ a + β Iβ dβ = na Λne enβiβ dβ = na a Λne =, and therefore by Lemma 3, 3 = µ a a = µ2 + O µ 2 log2n log2 = ψn µ2 + OQ log 2 2N, where ψx = n x Λn. By the prime number theorem ψx = x + Oxlog x A for any A >. Hence, by 3., = N + O N log A N = N log Q + ON. To estimate 4, we have 4.6 where 4 = µ /2Q N = = 5 6, a µ2 + OQ log 2 2N /2Q N a + β Iβ dβ [ ] [ 2Q, Q + ν Q + µ, ] θ Q, a 2Q where ν and µ are the numbers in 2.4 which depend on a,, and Q. By

9 Major arcs approximation 77 Cauchy chwarz we have 6 µ2 a β dβ a N N a 2 + β dβ a N a Q a µ 2 φ 2 M Q,a µ2 N Iβ 2 dβ α 2 dα /Q /2Q /2 α 2 dα β 2 dβ Q Q QN log2n N log2n. For 5 we have, by Lemma 3, = µ = µ2 /2Q /2Q /2Q /2Q a a + β Iβ dβ βiβ dβ + O log 2 2N /2Q µ 2 Iβ dβ µ2 /2Q /2Q + O log 2 2N µ 2 /2Q β 2 dβ /2 /2Q /2Q dβ β /2Q Iβ 2 dβ Iβ 2 dβ

10 78 D. A. Goldston µ2 /2 /2 α 2 dα /2Q dβ β 2 + OQ log 3 2N NQQ log2n + ON /2 log 3 2N N log2n. Finally we return to 2. For Q N /2 we have 2 =. Assuming Q > N /2 we have Q = N/Q and 2 = µ a β Iβ dβ Q < Q Q < Q θ Q,a Q a µ 2 a θ Q,a a Iβ 2 dβ M Q,a Q < Q a θ Q,a α 2 dα µ 2 φ 2 /2 α 2 dα Q < a 2 + β dβ /Q /Q µ 2 N 2 Q N 3 log2n = N log2n. QQ Lemma 4 now follows from 4.3 through 4.9. Iβ 2 dβ 5. Proof of the Theorem. As a simple conseuence of Lemma 4 we can determine how closely J Q α approximates α in L 2. Lemma 5. For Q N and Q = minq, N/Q, we have 5. α J Q α 2 dα = N logn/q + ON log2n. P r o o f. On multiplying out we find the left hand side of 5. is α 2 dα 2R αj Q α dα + J Q α 2 dα. By.2, Lemma 2, and Lemma 4 the result follows.

11 Major arcs approximation 79 Proof of the Theorem. By Cauchy chwarz we have 5.2 α J Q α dα α J Q α 2 dα = N logn/q + ON /2 log /4 2N. By the reverse triangle ineuality and Lemma the left hand side of 5.2 is 5.3 α dα J Q α dα α dα ON /2. The Theorem now follows on taking Q = Q = N /2 in 5.2. References [] G. H. Hardy and J. E. Littlewood, Note on Messrs. hah and Wilson s paper entitled: On an empirical formula connected with Goldbach s theorem, Proc. Cambridge Philos. oc. 9 99, [2],, ome problems of Partitio Numerorum : III. On the expression of a number as a sum of primes, Acta Math , 7. [3] R. C. Vaughan, The L mean of exponential sums over primes, Bull. London Math. oc , [4] D. R. Ward, ome series involving Euler s function, J. London Math. oc , Department of Mathematics and Computer cience an Jose tate University an Jose, CA 9592, U..A. goldston@mathcs.sjsu.edu Received on

Lecture 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 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 information

ON SUMS OF PRIMES FROM BEATTY SEQUENCES. Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD , U.S.A.

ON 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 information

GOLDBACH S PROBLEMS ALEX RICE

GOLDBACH 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 information

Contradictions in some primes conjectures

Contradictions in some primes conjectures Contradictions in some primes conjectures VICTOR VOLFSON ABSTRACT. This paper demonstrates that from the Cramer's, Hardy-Littlewood's and Bateman- Horn's conjectures (suggest that the probability of a

More information

MTH598A Report The Vinogradov Theorem

MTH598A 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 information

Twin primes (seem to be) more random than primes

Twin 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 information

THE NUMBER OF GOLDBACH REPRESENTATIONS OF AN INTEGER

THE 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 information

An Approach to Goldbach s Conjecture

An Approach to Goldbach s Conjecture An Approach to Goldbach s Conjecture T.O. William-west Abstract This paper attempts to prove Goldbach s conjecture. As its major contribution, an alternative perspective to the proof of Goldbach conjecture

More information

Large Sieves and Exponential Sums. Liangyi Zhao Thesis Director: Henryk Iwaniec

Large Sieves and Exponential Sums. Liangyi Zhao Thesis Director: Henryk Iwaniec Large Sieves and Exponential Sums Liangyi Zhao Thesis Director: Henryk Iwaniec The large sieve was first intruded by Yuri Vladimirovich Linnik in 1941 and have been later refined by many, including Rényi,

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.

ψ(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 information

The ternary Goldbach problem. Harald Andrés Helfgott. Introduction. The circle method. The major arcs. Minor arcs. Conclusion.

The 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 information

SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS

SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS DERRICK HART, ALEX IOSEVICH, AND JOZSEF SOLYMOSI Abstract. We establish improved sum-product bounds in finite fields using incidence theorems

More information

Exponential and character sums with Mersenne numbers

Exponential 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 information

On Roth's theorem concerning a cube and three cubes of primes. Citation Quarterly Journal Of Mathematics, 2004, v. 55 n. 3, p.

On Roth's theorem concerning a cube and three cubes of primes. Citation Quarterly Journal Of Mathematics, 2004, v. 55 n. 3, p. 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. 357-374 Issued Date 004 URL http://hdl.handle.net/107/75437

More information

Goldbach and twin prime conjectures implied by strong Goldbach number sequence

Goldbach and twin prime conjectures implied by strong Goldbach number sequence Goldbach and twin prime conjectures implied by strong Goldbach number sequence Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract In this note, we present a new and direct approach to prove the Goldbach

More information

arxiv: v2 [math.nt] 28 Jun 2012

arxiv: v2 [math.nt] 28 Jun 2012 ON THE DIFFERENCES BETWEEN CONSECUTIVE PRIME NUMBERS I D. A. GOLDSTON AND A. H. LEDOAN arxiv:.3380v [math.nt] 8 Jun 0 Abstract. We show by an inclusion-eclusion argument that the prime k-tuple conjecture

More information

Solving a linear equation in a set of integers II

Solving 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 information

The Circle Method. Basic ideas

The 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

NEIL LYALL A N. log log N

NEIL LYALL A N. log log N SÁRKÖZY S THEOREM NEIL LYALL. Introduction The purpose of this expository note is to give a self contained proof (modulo the Weyl ineuality) of the following result, due independently to Sárközy [5] and

More information

Math 259: Introduction to Analytic Number Theory Exponential sums II: the Kuzmin and Montgomery-Vaughan estimates

Math 259: Introduction to Analytic Number Theory Exponential sums II: the Kuzmin and Montgomery-Vaughan estimates Math 59: Introduction to Analytic Number Theory Exponential sums II: the Kuzmin and Montgomery-Vaughan estimates [Blurb on algebraic vs. analytical bounds on exponential sums goes here] While proving that

More information

A New Sieve for the Twin Primes

A New Sieve for the Twin Primes A ew Sieve for the Twin Primes and how the number of twin primes is related to the number of primes by H.L. Mitchell Department of mathematics CUY-The City College 160 Convent avenue ew York, Y 10031 USA

More information

arxiv: v1 [math.co] 22 May 2014

arxiv: v1 [math.co] 22 May 2014 Using recurrence relations to count certain elements in symmetric groups arxiv:1405.5620v1 [math.co] 22 May 2014 S.P. GLASBY Abstract. We use the fact that certain cosets of the stabilizer of points are

More information

PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS

PATTERNS 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 information

Subset sums modulo a prime

Subset sums modulo a prime ACTA ARITHMETICA 131.4 (2008) Subset sums modulo a prime by Hoi H. Nguyen, Endre Szemerédi and Van H. Vu (Piscataway, NJ) 1. Introduction. Let G be an additive group and A be a subset of G. We denote by

More information

Three additive cubic equations

Three additive cubic equations ACTA ARITHMETICA LX.1 (1991) Three additive cubic equations by O. D. Atkinson (Sheffield), J. Brüdern (Göttingen), and R. J. Cook (Sheffield) Introduction. The study of additive cubic diophantine equations

More information

The exceptional set in the polynomial Goldbach problem

The exceptional set in the polynomial Goldbach problem May 3, 200 2:55 WSPC/INSTRCTION FILE gcremarks-ijnt International Journal of Number Theory c World Scientific Publishing Company The exceptional set in the polynomial Goldbach problem Paul Pollack Mathematics

More information

PARABOLAS INFILTRATING THE FORD CIRCLES SUZANNE C. HUTCHINSON THESIS

PARABOLAS INFILTRATING THE FORD CIRCLES SUZANNE C. HUTCHINSON THESIS PARABOLAS INFILTRATING THE FORD CIRCLES BY SUZANNE C. HUTCHINSON THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Mathematics in the Graduate College of

More information

A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers

A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers TECHNICAL NOTES AND SHORT PAPERS A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers By Paul T. Bateman and Roger A. Horn Suppose fx, h,, fk are polynomials in one variable with

More information

Parabolas infiltrating the Ford circles

Parabolas infiltrating the Ford circles Bull. Math. Soc. Sci. Math. Roumanie Tome 59(07) No. 2, 206, 75 85 Parabolas infiltrating the Ford circles by S. Corinne Hutchinson and Alexandru Zaharescu Abstract We define and study a new family of

More information

ON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE

ON 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 information

Partitions into Values of a Polynomial

Partitions into Values of a Polynomial Partitions into Values of a Polynomial Ayla Gafni University of Rochester Connections for Women: Analytic Number Theory Mathematical Sciences Research Institute February 2, 2017 Partitions A partition

More information

The Evolution of the Circle Method in Additive Prime Number Theory

The Evolution of the Circle Method in Additive Prime Number Theory Lee University The Evolution of the Circle Method in Additive Prime Number Theory William Cole wcole00@leeu.edu 09 Aviara Dr. Advance, NC 27006 supervised by Dr. Laura Singletary April 4, 206 Introduction

More information

Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators

Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators ACTA ARITHMETICA XCIII.4 (2000 Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators by Harald Niederreiter and Arne Winterhof (Wien 1. Introduction.

More information

Flat primes and thin primes

Flat 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 information

UPPER BOUNDS FOR DOUBLE EXPONENTIAL SUMS ALONG A SUBSEQUENCE

UPPER BOUNDS FOR DOUBLE EXPONENTIAL SUMS ALONG A SUBSEQUENCE uniform distribution theory DOI: 055/udt-207 002 Unif Distrib Theory 2 207), no2, 24 UPPER BOUNDS FOR DOUBLE EXPONENTIAL SUMS ALONG A SUBSEQUENCE Christopher J White ABSTRACT We consider a class of double

More information

On the elliptic curve analogue of the sum-product problem

On 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 information

arxiv:math/ v2 [math.nt] 4 Feb 2006

arxiv:math/ v2 [math.nt] 4 Feb 2006 arxiv:math/0512436v2 [math.nt] 4 Feb 2006 THE PATH TO RECENT PROGRESS ON SMALL GAPS BETWEEN PRIMES D. A. GOLDSTON, J. PINTZ AND C. Y. YILDIRIM 1. Introduction In the articles Primes in Tuples I & II ([13],

More information

A proof of strong Goldbach conjecture and twin prime conjecture

A proof of strong Goldbach conjecture and twin prime conjecture A proof of strong Goldbach conjecture and twin prime conjecture Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract In this paper we give a proof of the strong Goldbach conjecture by studying limit

More information

Remarks on the Rademacher-Menshov Theorem

Remarks on the Rademacher-Menshov Theorem Remarks on the Rademacher-Menshov Theorem Christopher Meaney Abstract We describe Salem s proof of the Rademacher-Menshov Theorem, which shows that one constant works for all orthogonal expansions in all

More information

arxiv:math/ v3 [math.co] 15 Oct 2006

arxiv:math/ v3 [math.co] 15 Oct 2006 arxiv:math/060946v3 [math.co] 15 Oct 006 and SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS DERRICK HART, ALEX IOSEVICH, AND JOZSEF SOLYMOSI Abstract. We establish improved sum-product bounds

More information

ON A WEIGHTED INTERPOLATION OF FUNCTIONS WITH CIRCULAR MAJORANT

ON A WEIGHTED INTERPOLATION OF FUNCTIONS WITH CIRCULAR MAJORANT ON A WEIGHTED INTERPOLATION OF FUNCTIONS WITH CIRCULAR MAJORANT Received: 31 July, 2008 Accepted: 06 February, 2009 Communicated by: SIMON J SMITH Department of Mathematics and Statistics La Trobe University,

More information

A note on a construction of J. F. Feinstein

A note on a construction of J. F. Feinstein STUDIA MATHEMATICA 169 (1) (2005) A note on a construction of J. F. Feinstein by M. J. Heath (Nottingham) Abstract. In [6] J. F. Feinstein constructed a compact plane set X such that R(X), the uniform

More information

QUADRATIC FIELDS WITH CYCLIC 2-CLASS GROUPS

QUADRATIC 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 information

arxiv: v1 [math.nt] 5 Mar 2015

arxiv: 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 information

On 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 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 information

Introduction to the Hardy-Littlewood Circle method Rational Points seminar -Tomer Schlank

Introduction to the Hardy-Littlewood Circle method Rational Points seminar -Tomer Schlank Introduction to the Hardy-Littlewood Circle method Rational Points seminar -Tomer Schlank by Asaf Katz, Hebrew Uniersity January 5, 200 Some History and General Remarks The circle method was inented by

More information

The Proofs of Binary Goldbach s Theorem Using Only Partial Primes

The Proofs of Binary Goldbach s Theorem Using Only Partial Primes Chapter IV The Proofs of Binary Goldbach s Theorem Using Only Partial Primes Chun-xuan Jiang When the answers to a mathematical problem cannot be found, then the reason is frequently the fact that we have

More information

Lagrange s four squares theorem with one prime and three almost prime variables

Lagrange s four squares theorem with one prime and three almost prime variables Lagrange s four squares theorem with one prime and three almost prime variables D. R. Heath Brown D. I. Tolev 1 Introduction and statement of the results. In this paper we study the equation of Lagrange

More information

Finite Field Waring s Problem

Finite Field Waring s Problem Finite Field Waring s Problem 12/8/10 1 Introduction In 1770, Waring asked the following uestion: given d N, can every positive integer can be written as a sum of a bounded number of dth powers of positive

More information

arxiv:math/ v1 [math.nt] 19 Oct 2001

arxiv:math/ v1 [math.nt] 19 Oct 2001 arxiv:math/007v [math.nt] 9 Oct 00 THE STATISTICS OF THE TRAJECTORY IN A CERTAIN BILLIARD IN A FLAT TWO-TORUS FLORIN P. BOCA RADU N. GOLOGAN AND ALEXANDRU ZAHARESCU Abstract. We study a billiard in a modified

More information

Goldbach Conjecture: An invitation to Number Theory by R. Balasubramanian Institute of Mathematical Sciences, Chennai

Goldbach Conjecture: An invitation to Number Theory by R. Balasubramanian Institute of Mathematical Sciences, Chennai Goldbach Conjecture: An invitation to Number Theory by R. Balasubramanian Institute of Mathematical Sciences, Chennai balu@imsc.res.in R. Balasubramanian (IMSc.) Goldbach Conjecture 1 / 22 Goldbach Conjecture:

More information

8. Dirichlet s Theorem and Farey Fractions

8. Dirichlet s Theorem and Farey Fractions 8 Dirichlet s Theorem and Farey Fractions We are concerned here with the approximation of real numbers by rational numbers, generalizations of this concept and various applications to problems in number

More information

Sign elements in symmetric groups

Sign elements in symmetric groups Dept. of Mathematical Sciences University of Copenhagen, Denmark Nagoya, September 4, 2008 Introduction Work in progress Question by G. Navarro about characters in symmetric groups, related to a paper

More information

On Randomness of Goldbach Sequences

On Randomness of Goldbach Sequences On Randomness of Goldbach Sequences Krishnama Raju Kanchu and Subhash Kak Abstract- We consider the use of Goldbach numbers as random sequences. The randomness is analyzed in terms of the autocorrelation

More information

Random Bernstein-Markov factors

Random Bernstein-Markov factors Random Bernstein-Markov factors Igor Pritsker and Koushik Ramachandran October 20, 208 Abstract For a polynomial P n of degree n, Bernstein s inequality states that P n n P n for all L p norms on the unit

More information

Goldbach's problem with primes in arithmetic progressions and in short intervals

Goldbach's problem with primes in arithmetic progressions and in short intervals Goldbach's problem with primes in arithmetic progressions and in short intervals Karin Halupczok Journées Arithmétiques 2011 in Vilnius, June 30, 2011 Abstract: We study the number of solutions in Goldbach's

More information

A Search for Large Twin Prime Pairs. By R. E. Crandall and M. A. Penk. Abstract. Two methods are discussed for finding large integers m such that m I

A Search for Large Twin Prime Pairs. By R. E. Crandall and M. A. Penk. Abstract. Two methods are discussed for finding large integers m such that m I MATHEMATICS OF COMPUTATION, VOLUME 33, NUMBER 145 JANUARY 1979, PAGES 383-388 A Search for Large Twin Prime Pairs By R. E. Crandall and M. A. Penk Abstract. Two methods are discussed for finding large

More information

A combinatorial problem related to Mahler s measure

A 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 information

Bounds for the Eventual Positivity of Difference Functions of Partitions into Prime Powers

Bounds for the Eventual Positivity of Difference Functions of Partitions into Prime Powers 3 47 6 3 Journal of Integer Seuences, Vol. (7), rticle 7..3 ounds for the Eventual Positivity of Difference Functions of Partitions into Prime Powers Roger Woodford Department of Mathematics University

More information

Squares in products with terms in an arithmetic progression

Squares in products with terms in an arithmetic progression ACTA ARITHMETICA LXXXVI. (998) Squares in products with terms in an arithmetic progression by N. Saradha (Mumbai). Introduction. Let d, k 2, l 2, n, y be integers with gcd(n, d) =. Erdős [4] and Rigge

More information

arxiv:math/ v2 [math.gm] 4 Oct 2000

arxiv:math/ v2 [math.gm] 4 Oct 2000 On Partitions of Goldbach s Conjecture arxiv:math/000027v2 [math.gm] 4 Oct 2000 Max See Chin Woon DPMMS, Cambridge University, Cambridge CB2 2BZ, UK WatchMyPrice Technologies, 200 West Evelyn Ave, Suite

More information

Piatetski-Shapiro primes from almost primes

Piatetski-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 information

DETERMINATION OF GL(3) CUSP FORMS BY CENTRAL VALUES OF GL(3) GL(2) L-FUNCTIONS, LEVEL ASPECT

DETERMINATION OF GL(3) CUSP FORMS BY CENTRAL VALUES OF GL(3) GL(2) L-FUNCTIONS, LEVEL ASPECT DETERMIATIO OF GL(3 CUSP FORMS BY CETRAL ALUES OF GL(3 GL( L-FUCTIOS, LEEL ASPECT SHEG-CHI LIU Abstract. Let f be a self-dual Hecke-Maass cusp form for GL(3. We show that f is uniquely determined by central

More information

The Twin Prime Problem and Generalisations (aprés Yitang Zhang)

The Twin Prime Problem and Generalisations (aprés Yitang Zhang) The Twin Prime Problem and Generalisations aprés Yitang Zhang M Ram Murty Asia Pacific Mathematics Newsletter We give a short introduction to the recent breakthrough theorem of Yitang Zhang that there

More information

A Remark on Sieving in Biased Coin Convolutions

A 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 information

Notes on Continued Fractions for Math 4400

Notes on Continued Fractions for Math 4400 . Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural

More information

arxiv:math/ v1 [math.nt] 10 Jan 2006

arxiv:math/ v1 [math.nt] 10 Jan 2006 Generalising the Hardy-Littlewood method for primes arxiv:math/0601211v1 [math.nt] 10 Jan 2006 Ben Green Abstract. The Hardy-Littlewood method is a well-known technique in analytic number theory. Among

More information

ON THE RESIDUE CLASSES OF π(n) MODULO t

ON THE RESIDUE CLASSES OF π(n) MODULO t ON THE RESIDUE CLASSES OF πn MODULO t Ping Ngai Chung Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts briancpn@mit.edu Shiyu Li 1 Department of Mathematics, University

More information

On the number of elements with maximal order in the multiplicative group modulo n

On 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 information

Prime Numbers and Irrational Numbers

Prime Numbers and Irrational Numbers Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.

More information

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )

More information

Waring 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 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 information

arxiv: v1 [math.nt] 26 Apr 2016

arxiv: v1 [math.nt] 26 Apr 2016 Ramanuan-Fourier series of certain arithmetic functions of two variables Noboru Ushiroya arxiv:604.07542v [math.nt] 26 Apr 206 Abstract. We study Ramanuan-Fourier series of certain arithmetic functions

More information

On a diophantine inequality involving prime numbers

On a diophantine inequality involving prime numbers ACTA ARITHMETICA LXI.3 (992 On a diophantine inequality involving prime numbers by D. I. Tolev (Plovdiv In 952 Piatetski-Shapiro [4] considered the following analogue of the Goldbach Waring problem. Assume

More information

Gauss and Riemann versus elementary mathematics

Gauss and Riemann versus elementary mathematics 777-855 826-866 Gauss and Riemann versus elementary mathematics Problem at the 987 International Mathematical Olympiad: Given that the polynomial [ ] f (x) = x 2 + x + p yields primes for x =,, 2,...,

More information

Generalising the Hardy Littlewood method for primes

Generalising the Hardy Littlewood method for primes Generalising the Hardy Littlewood method for primes Ben Green Abstract. The Hardy Littlewood method is a well-known technique in analytic number theory. Among its spectacular applications are Vinogradov

More information

Before giving the detailed proof, we outline our strategy. Define the functions. for Re s > 1.

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. 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 information

On sums of squares of primes

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 information

MOCK THETA FUNCTIONS AND THETA FUNCTIONS. Bhaskar Srivastava

MOCK THETA FUNCTIONS AND THETA FUNCTIONS. Bhaskar Srivastava NEW ZEALAND JOURNAL OF MATHEMATICS Volume 36 (2007), 287 294 MOCK THETA FUNCTIONS AND THETA FUNCTIONS Bhaskar Srivastava (Received August 2004). Introduction In his last letter to Hardy, Ramanujan gave

More information

Some Elementary Problems (Solved and Unsolved) in Number Theory and Geometry

Some Elementary Problems (Solved and Unsolved) in Number Theory and Geometry Some Elementary Problems (Solved and Unsolved) in Number Theory and Geometry Paul Erdös The Hungarian Academy of Science and Technion, Haifa Dedicated to the memory of Prof. J. Gillis Mathematics is full

More information

Generalizing the Hardy-Littlewood Method for Primes

Generalizing the Hardy-Littlewood Method for Primes Generalizing the Hardy-Littlewood Method for Primes Ben Green (reporting on joint work with Terry Tao) Clay Institute/University of Cambridge August 20, 2006 Ben Green (Clay/Cambridge) Generalizing Hardy-Littlewood

More information

On the existence of primitive completely normal bases of finite fields

On the existence of primitive completely normal bases of finite fields On the existence of primitive completely normal bases of finite fields Theodoulos Garefalakis a, Giorgos Kapetanakis b, a Department of Mathematics and Applied Mathematics, University of Crete, Voutes

More information

Partition Congruences in the Spirit of Ramanujan

Partition Congruences in the Spirit of Ramanujan Partition Congruences in the Spirit of Ramanujan Yezhou Wang School of Mathematical Sciences University of Electronic Science and Technology of China yzwang@uestc.edu.cn Monash Discrete Mathematics Research

More information

Approximation exponents for algebraic functions in positive characteristic

Approximation exponents for algebraic functions in positive characteristic ACTA ARITHMETICA LX.4 (1992) Approximation exponents for algebraic functions in positive characteristic by Bernard de Mathan (Talence) In this paper, we study rational approximations for algebraic functions

More information

arxiv: v2 [math.nt] 15 Feb 2014

arxiv: v2 [math.nt] 15 Feb 2014 ON POLIGNAC S CONJECTURE FRED B. HOLT AND HELGI RUDD arxiv:1402.1970v2 [math.nt] 15 Feb 2014 Abstract. A few years ago we identified a recursion that works directly with the gaps among the generators in

More information

Plotkin s Bound in Codes Equipped with the Euclidean Weight Function

Plotkin s Bound in Codes Equipped with the Euclidean Weight Function Tamsui Oxford Journal of Mathematical Sciences 5() (009) 07-4 Aletheia University Plotkin s Bound in Codes Equipped with the Euclidean Weight Function Sapna Jain Department of Mathematics, University of

More information

Polygonal Numbers, Primes and Ternary Quadratic Forms

Polygonal Numbers, Primes and Ternary Quadratic Forms Polygonal Numbers, Primes and Ternary Quadratic Forms Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/ zwsun August 26, 2009 Modern number theory has

More information

Integers without large prime factors in short intervals and arithmetic progressions

Integers 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 information

Splitting Fields for Characteristic Polynomials of Matrices with Entries in a Finite Field.

Splitting Fields for Characteristic Polynomials of Matrices with Entries in a Finite Field. Splitting Fields for Characteristic Polynomials of Matrices with Entries in a Finite Field. Eric Schmutz Mathematics Department, Drexel University,Philadelphia, Pennsylvania, 19104. Abstract Let M n be

More information

RAMANUJAN SERIES FOR ARITHMETICAL FUNCTIONS

RAMANUJAN SERIES FOR ARITHMETICAL FUNCTIONS HARDY-RAMANUJAN JOURNAL 36 (203), 2-33 RAMANUJAN SERIES FOR ARITHMETICAL FUNCTIONS M. RAM MURTY Abstract. We give a short survey of old and new results in the theory of Ramanujan expansions for arithmetical

More information

ON THE DIVISOR FUNCTION IN SHORT INTERVALS

ON 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 information

NORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY

NORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion

More information

NOTES Edited by William Adkins. On Goldbach s Conjecture for Integer Polynomials

NOTES Edited by William Adkins. On Goldbach s Conjecture for Integer Polynomials NOTES Edited by William Adkins On Goldbach s Conjecture for Integer Polynomials Filip Saidak 1. INTRODUCTION. We give a short proof of the fact that every monic polynomial f (x) in Z[x] can be written

More information

Prime Number Theory and the Riemann Zeta-Function

Prime Number Theory and the Riemann Zeta-Function 5262589 - Recent Perspectives in Random Matrix Theory and Number Theory Prime Number Theory and the Riemann Zeta-Function D.R. Heath-Brown Primes An integer p N is said to be prime if p and there is no

More information

Remarks on the Thickness of K n,n,n

Remarks on the Thickness of K n,n,n Remarks on the Thickness of K n,n,n Yan Yang Department of Mathematics Tianjin University, Tianjin 30007, P.R.China yanyang@tju.edu.cn Abstract The thickness θ(g) of a graph G is the minimum number of

More information

A PROOF FOR GOLDBACH S CONJECTURE

A PROOF FOR GOLDBACH S CONJECTURE Journal of Mathematical Sciences: Advances and Applications Volume 22, 2013, Pages 45-52 A PROOF FOR GOLDBACH S CONJECTURE Department of Mathematics Azad Mashhad University Mashhad Iran e-mail: hsazegar@gmailcom

More information

as x. Before giving the detailed proof, we outline our strategy. Define the functions for Re s > 1.

as 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 information

On the Distribution of Multiplicative Translates of Sets of Residues (mod p)

On the Distribution of Multiplicative Translates of Sets of Residues (mod p) On the Distribution of Multiplicative Translates of Sets of Residues (mod p) J. Ha stad Royal Institute of Technology Stockholm, Sweden J. C. Lagarias A. M. Odlyzko AT&T Bell Laboratories Murray Hill,

More information

arxiv: v2 [math.nt] 22 Jan 2014

arxiv: v2 [math.nt] 22 Jan 2014 AN IMPROVEMENT ON ZAREMBA S CONJECTURE SHINNYIH HUANG Department of Mathematics, Yale University arxiv:30377v [mathnt] Jan 04 Abstract We prove there exists a density one subset D N such that each n D

More information

#A61 INTEGERS 14 (2014) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES

#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 information