PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS
|
|
- Philippa Knight
- 5 years ago
- Views:
Transcription
1 PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS JÁNOS PINTZ Rényi Institute of the Hungarian Academy of Sciences CIRM, Dec. 13, 2016
2 2 1. Patterns of primes Notation: p n the n th prime, P = {p i } i=1, d n = p n+1 p n. Abbreviation: i.o. = infinitely often, Z + = {1, 2,... } Twin Prime Conjecture {n, n + 2} P 2 i.o. d ν = 2 i.o. Polignac Conjecture (1849) Definition 2 h d n = h i.o. H = H k = {h i } k i=1, 0 h 1 < h 2 < h k is admissible if the number of residue classes covered by H mod p, ν p (H) < p for every prime p. Dickson Conjecture (1904). H k admissible = {n + h i } k i=1 Pk i.o. 2 / 35
3 3 Hardy Littlewood Conjecture (1923). H = H k admissible = x 1 n x log k x σ(h), {n+h i } P k σ(h) = p ( 1 ν ) ( p(h) 1 1 ) k p p 3 / 35
4 4 Remark 1. HL conjecture implies: Strong HL conjecture: H = H k admissible = x 1 (log x) σ(h) k n x {n+h i } P k n+h / P if h [0,h k ], h h i Proof. By Selberg s upper bound sieve 1 n x {n+h i } P k n+h P x (log x) k+1. Remark 2. Dickson Conjecture Strong Dickson Conjecture. 4 / 35
5 5 2. Primes in Arithmetic Progressions (AP) Conjecture (Lagrange, Waring, Erdős Turán (1936)). The primes contain k-term AP s for every k. Conjecture (Erdős Turán (1936)). If A Z + has positive upper density then A contains k-term AP s for every k. Roth (1953): This is true for k = 3. Szemerédi (1975) This is true for every k. 5 / 35
6 6 3. History before 2000 (2004) Erdős (1940) Bombieri Davenport (1966) d n < (1 c 0 ) log n i.o. c 0 > 0 fix. H. Maier (1988) d n < (log n)/4 i.o. Van der Corput (1939) AP s. d n < (log n)/2 i.o. P contains infinitely many 3-term Heath-Brown (1984) There are infinitely many pairs n, d such that n, n + d, n + 2d P, n + 3d P 2. Definition n = P k -number if it has at most k prime factors (ALMOST PRIMES). 6 / 35
7 7 4. Results after 2000 Green Tao Theorem ( ): P contains k-term AP s for every k. Goldston Pintz Yıldırım ( ): lim inf n d n/ log n = 0. GPY ( ): lim inf n d n/(log n) c = 0 if c > 1 2. Zhang ( ): H k admissible, k > = n + H k contains at least 2 primes i.o. 7 / 35
8 8 Maynard ( ): This is true for k 105. Polymath (2014): This is true for k 50. Maynard ( ), Tao unpublished: H k admissible = n + H k contains at least ( o(1)) log k primes i.o. 8 / 35
9 9 5. Patterns of primes in arithmetic progressions A common generalization of the Green Tao and Maynard Tao theorem is Theorem 1 (J. P. 2017) Let m > 0 and A = {a 1,..., a r } be a set of r distinct integers with r sufficiently large depending on m. Let N(A) denote the number of integer m-tuples {h 1,..., h m } A such that there exist for every l infinitely many l-term arithmetic progressions of integers {n i } l i=1 where n i + h j is the j th prime following n i prime for each pair i, j. Then (5.1) N(A) m # { (h 1,..., h m ) A } m A m = r m. 9 / 35
10 10 Theorem 1 will follow by the application of Maynard s method from the weaker Theorem 2 (J. P. 2017) Let m be a positive integer, H = {h 1,..., h k } be an admissible set of k distinct non-negative integers h i H, k = Cm 2 e 4m with a sufficiently large absolute constant C. Then there exists an m-element subset (5.2) {h 1, h 2,..., h m} H such that for every positive integer l we have infinitely many l-element non-trivial arithmetic progressions of integers n i such that n i + h j P for 1 i l, 1 j m, further n i + h j is always the j th prime following n i. 10 / 35
11 11 In fact we prove a stronger result, namely Theorem 3 (J. P. 2017) There is some C, such that for all k 0 and all k > Ck0 2 e 4k 0 there is some c > 0, such that for all admissible tuples {h 1,..., h k } the number N(x) of integers n x, such that n + h i is n c -pseudo prime, and among these k integers there are at least k 0 primes, satisfies N(x) x. These N(x) log k x integers n x contain an m-term AP if x > C 0 (m). 11 / 35
12 12 6. Structure of the proof of the Maynard Tao theorem (i) Key parameters: H = {h 1,..., h k } given (0 h 1 < h 2 <... < h k ) N large, we look for primes of the form n + h i with n [N, 2N) R = N θ/2 ε, where θ is a level of distribution of primes: (6.1) max a q x θ (a,q)=1 π(x) π(x, q, a) ϕ(q) A x (log x) A holds for any A > 0 where the symbol of Vinogradov means that f (x) = O(g(x)) is abbreviated by f (x) g(x). Remark. θ = 1/2 admissible: Bombieri Vinogradov theorem (1965). θ > 0 Rényi (1947) (6.2) W = D 0 = C (k) suitably large p D 0 p (6.3) n ν 0 (mod W ) (ν 0 + h i, W ) = 1 for i = 1,..., k. 12 / 35
13 13 (ii) We weight the numbers n ν 0 (mod W ), n [N, 2N) by w n, so that w n 0 and on average w n would be large if we have many primes among {n + h i } k i=1, ( ) 2 (6.4) w n = λ d1,...,d k. d i n+h i i ( k ) (6.5) λ d1,...,d k = µ(d i )d i ( k whenever i=1 i=1 r 1,...,r k d i r i i (r i,w )=1 ( k ) 2 µ r i i=1 k i=1 ϕ(r i ) ) d i, W = 1 and λ d1,...,d r = 0 otherwise. y r1,...,r k 13 / 35
14 14 (6.6) y r1,...,r k = F ( log r1 log R,..., log r ) k log R where F is piecewise differentiable, real, F and F bounded, supported on { } k (6.7) R k = (x 1,..., x k ) [0, 1] k : x i 1. (iii) Let χ P (n) denote the characteristic function of P, (6.8) ( k ) S 1 := w n, S 2 := w n χ P (n+h i ), n N n<2n n ν 0 (mod W ) n N n<2n n ν 0 (mod W ) i=1 i=1 14 / 35
15 15 If we succeed to choose F, thereby λ d and w n in such a way that ( r k Z +) (6.9) S 2 > S 1, or S 2 > (r k 1)S 1 resp. we obtain at lest two, or k 0 primes, resp. among n + h 1,..., n + h k = bounded gaps between primes or even k 0 primes in bounded intervals i.o. 15 / 35
16 16 (iv) First step towards this: evaluation of S 1 and S 2. Proposition 1. We have as N ( ( )) O D 0 ϕ(w ) k N(log R) k (6.10) S 1 = I W k+1 k (F ), ( ( )) O D 0 ϕ(w ) k N(log R) k+1 k (6.11) S 2 = J (j) k (F ), W k+1 j=1 (6.12) I k (F ) = (6.13) 1 J (j) k (F ) = ( F (t 1,..., t k ) 2 dt 1... dt k, F (t 1,..., t k )dt j ) 2 dt 1... dt j 1 dt j+1... dt k. 16 / 35
17 17 After this we immediately obtain Corollary. If the sup is taken with F k as before and (6.14) M k = sup k J (j) k (F ) θmk, r k = I k (F ) 2 j=1 and let H be a fixed admissible sequence H = {h 1,..., h k } of size k. Then there are infinitely many integers n such that at least r k of the n + h i (1 i k) are simultaneously primes. Proposition 2. M 105 > 4 and M k > log k 2 log log k 2 for k > k / 35
18 18 7. A stronger version of the Maynard Tao theorem Theorem 3 gives a stronger form in 3 aspects: (i) all numbers n + h i are almost primes, having all prime factors greater than n c(k) ; (ii) the number of such n s is at least c (k)n, the true order log k N of magnitude of n [N, 2N) with all n + h i being n c -almost primes; (iii) for every l we have (infinitely) many l-term AP s with the same prime pattern. Remark: properties (i) and (ii) are interesting in themselves, but crucial in many applications, in particular in showing (iii). 18 / 35
19 19 Let P (n) denote the smallest prime factor of n. The following Lemma shows that the contribution of n s to S 1 with at least one prime p (n + h i ), p < n c 1(k) is negligible if c 1 (k) is suitably small ( R = N θ/2 ε). Lemma 1. We have (7.1) S 1 = N n<2n ( n ν 0 (mod W ) k ) P (n+h i ) <n c 1 (k) i=1 c 1 (k) log N w n k,h S 1. log R 19 / 35
20 20 Corollary. We get immediately property (i). Further (7.2) w n λ 2 max y 2 max(log R) 2k (log R) 2k since (n + h i ) has in this case just a bounded number of prime factors, so the sum over the divisors can be substituted by the largest term (apart from a factor depending on k). So we get (7.3) S 1 := n N n<2n n ν 0 (mod W ) ( k ) P (n+h i ) i=1 #{i;n+h i P} r k >n c 1 (k) by which we obtained property (ii). 1 S 1(1 + O(c 1 (k)) (log R) 2k, 20 / 35
21 21 8. Green Tao theorem: structure of proof Original Szemerédi theorem. If A Z N has a positive density then A contains m-term AP for every m, if N > C(m). Relative Szemerédi theorem (Green Tao). If A Z N is a pseudorandom set, B A has a positive relative density within A, i.e. with a measure ν(n) obeying the linear forms condition ν(n) (8.1) lim N n N,n B n N,n A ν(n) = δ > 0 then B contains m-term AP for every m, if N > C(δ, m). 21 / 35
22 22 Definition. A set A Z N is a pseudorandom set if there is a measure ν : Z N R + which satisfies the linear forms condition if the following holds. Let (L ij ), 1 i l, 1 j t rational numbers with all numerators and denominators at most L 0, b i Z N, l l 0, m m 0. Let ψ i (x) = t L i,j x j + b i, where the t-tuples j=1 (L ij ) 1 j t Q t are non-zero and no t-tuple is a rational multiple of another. Then ( (8.2) E ν(ψ 1 (x) ) )... ν(ψ m (x)) x Z t N = 1 + o L0,l 0,m 0 (1). 22 / 35
23 23 Remark 1. The primes up to N form a set of density 1/ log N 0 as N. Therefore we cannot use the Szemerédi theorem. Step 1. To formulate and show a generalization of the Szemerédi theorem where the set Z N = [1, 2,..., N] can be substituted by some sparse set satisfying some regularity condition like (8.2). This result is called Relative Szemerédi Theorem. 23 / 35
24 24 Remark 2. Another condition, the correlation condition in the original work of Green and Tao could be avoided by a different proof of Conlon Fox Zhao (2015). Step 2. To find a suitable pseudo-random set A where the set P of the primes can be embedded as a subset of positive density. This was proved in an unpublished manuscript of Goldston and Yıldırım (2003). This set A is the set of almost primes; the measure (µ is the Möbius function, c > 0 small) ( (8.3) ν(n) = d n,d R ( µ(d) 1 log d )) 2 R = N c. log R 24 / 35
25 25 9. Combination of the methods of Green Tao and Maynard Tao Difficulty: the original Maynard Tao method produces directly (without using any further ideas) only at least c/ log log N (9.1) N integers n [N, 2N) with at least k 0 = 1 (1 + o(1)) log k 4 primes among {n + h i } k i=s. The expected number of n s with this property is N (9.2) c 2 (k 0 ) (log N), k 0 which is much more. 25 / 35
26 26 Hope: By Theorem 1 (cf. 7 (i) (ii)) we obtain (9.3) c 3 (k)n log k N such numbers, which is still less than (9.2). Further idea: if we require additionally that all n + h i s should be almost primes, i.e. P (n + h i ) > n c 1(k), then we obtain also c(k)n/ log k N numbers n [N, 2N) which is already the true order of magnitude of such n s. 26 / 35
27 27 Solution: instead of embedding primes into the set of almost primes we embed the set of n s, n [N, 2N) with at least k 0 primes among {n + h i } k i=1 and ( k ) (9.4) P + h i ) > n i=1(n c 1(k) into the set of n s, n [N, 2N) with (9.4). Remark: in some sense we embed the set of almost prime k-tuples with at least k 0 primes into the set of all almost prime k-tuples. 27 / 35
28 28 Lemma 2. Let k be an arbitrary positive integer and H = {h 1,..., h k } be an admissible k-tuple. If the set N (H) satisfies with constants c 1 (k), c 2 (k) { ( k ) } (9.5) N (H) n; P + h i ) n i=1(n c 1(k) and (9.6) # { n X, n N (H) } c 2(k)X log k X for X > X 0, then N(H) contains l-term arithmetic progressions for every l. 28 / 35
29 29 Main idea of the proof: We use the measure ( ) k ϕ(w ) k Λ 2 R (Wn+ν 0+h i ), n [N, 2N) W log R (9.7) ν(n) := i=1 0 otherwise with R = N c 1(k) and (9.8) Λ R (u) = Remark. If P ( k i=1 d R,d u ) (u + h i ) µ(d) log R d. > N c 1(k) = R, then Λ R (u + h i ) = log R (the single term in the sum is that with d = 1) and ν(u) = (ϕ(w )/W ) k log k R does not depend on u. 29 / 35
30 30 The pseudorandomness of the measure ν can be proved by a generalization of the original Goldston Yıldırım method. The original GY method is exactly the case k = 1. The possible methods are either (i) analytic number theoretical (using the zeta-function) or (ii) Fourier series or (iii) real elementary. 30 / 35
31 31 Remark. The proof that we obtain consecutive primes by this procedure follows from the fact that the number of n [N, 2N) obtained is at least c(k)n/ log k N. If any of the numbers n + h, 0 h h k, h h i (i = 1, 2,..., k) were additionally prime then by Selberg s upper bound sieve we would find at most c (k)n/ log k+1 N such numbers (cf. the estimate in 1.) since all n + h i (i = 1, 2,..., k) are almost primes (similarly to the case of the Strong HL conjecture). So here we also need both properties 7 (i) and 7 (ii). 31 / 35
32 Sketch of the proof of Lemma 2 The proof is essentially the same for an arbitrary k as for the simplest case k = 1. So let k = 1. We choose a prime p < N c1(k) and try to evaluate (10.1) Sp = λ d λ e N n<2n,p n+h,n ν 0 (W ) [d,e] n+h 32 / 35
33 33 Distinguishing the cases (10.2) (10.3) (10.4) p [d, e] = N pw d = d p, p e = N pw d = d p, e = e p = N pw λ d λ e [d, e] λ d λ e [d, e] λ d λ e [d, e ] (or reversed) 33 / 35
34 34 we obtain in all cases an asymptotic of type (10.5) S p = N pw λd λ e [d, e, p]/p + O(R 2+ε ). Lemma (Selberg, Coll. Works 1991, Greaves 2000) (10.6) T p := λ d λ e [d, e, p]/p = r p r µ 2 (r) ϕ(r) (y r y rp ) / 35
35 35 However, by the definition of y r and F we have (10.7) ( ( ) ( )) 2 log r log r + log p (y r y rp ) 2 log p = F F F log R log R log R, (10.8) T p log p ϕ(w ) log R log R W (10.9) S = = S p log p p N W ϕ(w ) W, p<n c 1 (k) S p N W c 1(k) log N ϕ(w ) W k,θ c 1 (k)s 1 which is negligible if c 1 (k) is sufficiently small. 35 / 35
Small gaps between primes
CRM, Université de Montréal Princeton/IAS Number Theory Seminar March 2014 Introduction Question What is lim inf n (p n+1 p n )? In particular, is it finite? Introduction Question What is lim inf n (p
More informationDistribution of Prime Numbers Prime Constellations Diophantine Approximation. Prime Numbers. How Far Apart Are They? Stijn S.C. Hanson.
Distribution of How Far Apart Are They? June 13, 2014 Distribution of 1 Distribution of Behaviour of π(x) Behaviour of π(x; a, q) 2 Distance Between Neighbouring Primes Beyond Bounded Gaps 3 Classical
More informationTowards the Twin Prime Conjecture
A talk given at the NCTS (Hsinchu, Taiwan, August 6, 2014) and Northwest Univ. (Xi an, October 26, 2014) and Center for Combinatorics, Nankai Univ. (Tianjin, Nov. 3, 2014) Towards the Twin Prime Conjecture
More informationSieve theory and small gaps between primes: Introduction
Sieve theory and small gaps between primes: Introduction Andrew V. Sutherland MASSACHUSETTS INSTITUTE OF TECHNOLOGY (on behalf of D.H.J. Polymath) Explicit Methods in Number Theory MATHEMATISCHES FORSCHUNGSINSTITUT
More informationSmall prime gaps. Kevin A. Broughan. December 7, University of Waikato, Hamilton, NZ
Small prime gaps Kevin A. Broughan University of Waikato, Hamilton, NZ kab@waikato.ac.nz December 7, 2017 Abstract One of the more spectacular recent advances in analytic number theory has been the proof
More informationNew bounds on gaps between primes
New bounds on gaps between primes Andrew V. Sutherland Massachusetts Institute of Technology Brandeis-Harvard-MIT-Northeastern Joint Colloquium October 17, 2013 joint work with Wouter Castryck, Etienne
More informationDept of Math., SCU+USTC
2015 s s Joint work with Xiaosheng Wu Dept of Math., SCU+USTC April, 2015 Outlineµ s 1 Background 2 A conjecture 3 Bohr 4 Main result 1. Background s Given a subset S = {s 1 < s 2 < } of natural numbers
More informationSmall gaps between prime numbers
Small gaps between prime numbers Yitang Zhang University of California @ Santa Barbara Mathematics Department University of California, Santa Barbara April 20, 2016 Yitang Zhang (UCSB) Small gaps between
More information1 i<j k (g ih j g j h i ) 0.
CONSECUTIVE PRIMES IN TUPLES WILLIAM D. BANKS, TRISTAN FREIBERG, AND CAROLINE L. TURNAGE-BUTTERBAUGH Abstract. In a stunning new advance towards the Prime k-tuple Conjecture, Maynard and Tao have shown
More informationGaps between primes: The story so far
Gaps between primes: The story so far Paul Pollack University of Georgia Number Theory Seminar September 24, 2014 1 of 57 PART I: (MOSTLY) PREHISTORY 2 of 57 PART I: (MOSTLY) PREHISTORY (> 2 years ago)
More informationarxiv: v1 [math.nt] 27 May 2013
arxiv:1305.6289v1 [math.t] 27 May 2013 Polignac umbers, Conjectures of Erdős on Gaps between Primes, Arithmetic Progressions in Primes, and the Bounded Gap Conjecture by János PITZ Rényi Mathematical Institute
More informationOn the difference of primes
arxiv:1206.0149v1 [math.nt] 1 Jun 2012 1 Introduction On the difference of primes by János Pintz In the present work we investigate some approximations to generalizations of the twin prime conjecture.
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 informationLecture 7. January 15, Since this is an Effective Number Theory school, we should list some effective results. x < π(x) holds for all x 67.
Lecture 7 January 5, 208 Facts about primes Since this is an Effective Number Theory school, we should list some effective results. Proposition. (i) The inequality < π() holds for all 67. log 0.5 (ii)
More informationArithmetic progressions in primes
Arithmetic progressions in primes Alex Gorodnik CalTech Lake Arrowhead, September 2006 Introduction Theorem (Green,Tao) Let A P := {primes} such that Then for any k N, for some a, d N. lim sup N A [1,
More informationThe Green-Tao Theorem on arithmetic progressions within the primes. Thomas Bloom
The Green-Tao Theorem on arithmetic progressions within the primes Thomas Bloom November 7, 2010 Contents 1 Introduction 6 1.1 Heuristics..................................... 7 1.2 Arithmetic Progressions.............................
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 informationThe path to recent progress on small gaps between primes
Clay Mathematics Proceedings Volume 7, 2007 The path to recent progress on small gaps between primes D. A. Goldston, J. Pintz, and C. Y. Yıldırım Abstract. We present the development of ideas which led
More informationTwin Prime Numbers. Bounded gaps between primes. Author: I.F.M.M. Nelen. Supervisor: Prof. Dr. F. Beukers
Twin Prime Numbers Bounded gaps between primes Author: I.F.M.M. Nelen Supervisor: Prof. Dr. F. Beuers 28 januari 215 Table of Contents Twin Prime Numbers 1 Abstract................................. 2 Introduction
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 informationBOUNDED GAPS BETWEEN PRIMES IN NUMBER FIELDS AND FUNCTION FIELDS
BOUNDED GAPS BETWEEN PRIMES IN NUMBER FIELDS AND FUNCTION FIELDS ABEL CASTILLO, CHRIS HALL, ROBERT J LEMKE OLIVER, PAUL POLLACK, AND LOLA THOMPSON Abstract The Hardy Littlewood prime -tuples conjecture
More informationPrimes in tuples II. Cem Yalçin Yıldırım. Bo gaziçi University Istanbul, Turkey. 1. Introduction. p n+1 p n log p n. = lim inf
Acta Math., 204 200, 47 DOI: 0.007/s5-00-0044-9 c 200 by Institut Mittag-Leffler. All rights reserved Primes in tuples II by Daniel A. Goldston San José State University San José, CA, U.S.A. János Pintz
More informationarxiv: v1 [math.nt] 15 Oct 2007
PRIMES IN TUPLES II D A GOLDSTON, J PINTZ AND C Y YILDIRIM arxiv:0702728v [mathnt] 5 Oct 2007 Abstract We prove that lim inf n p n+ p n log pnlog log p n 2
More informationarxiv: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 informationPRIMES IN TUPLES I arxiv:math/ v1 [math.nt] 10 Aug 2005
PRIMES IN TUPLES I arxiv:math/050885v [math.nt] 0 Aug 2005 D. A. GOLDSTON, J. PINTZ, AND C. Y. YILDIRIM Abstract. We introduce a method for showing that there exist prime numbers which are very close together.
More informationON 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 informationNew developments on the twin prime problem and generalizations
New developments on the twin prime problem and generalizations M. Ram Murty To cite this version: M. Ram Murty. New developments on the twin prime problem and generalizations. Hardy-Ramanujan Journal,
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 informationClusters of primes with square-free translates
Submitted to Rev. Mat. Iberoam., 1 22 c European Mathematical Society Clusters of primes with square-free translates Roger C. Baker and Paul Pollack Abstract. Let R be a finite set of integers satisfying
More informationPrime 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 informationRoth s Theorem on Arithmetic Progressions
September 25, 2014 The Theorema of Szemerédi and Roth For Λ N the (upper asymptotic) density of Λ is the number σ(λ) := lim sup N Λ [1, N] N [0, 1] The Theorema of Szemerédi and Roth For Λ N the (upper
More informationBEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO
BEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO ANDREW GRANVILLE, DANIEL M. KANE, DIMITRIS KOUKOULOPOULOS, AND ROBERT J. LEMKE OLIVER Abstract. We determine for what
More informationErdős and arithmetic progressions
Erdős and arithmetic progressions W. T. Gowers University of Cambridge July 2, 2013 W. T. Gowers (University of Cambridge) Erdős and arithmetic progressions July 2, 2013 1 / 22 Two famous Erdős conjectures
More informationBounded gaps between primes
Bounded gaps between primes The American Institute of Mathematics The following compilation of participant contributions is only intended as a lead-in to the AIM workshop Bounded gaps between primes. This
More informationBounded gaps between Gaussian primes
Journal of Number Theory 171 (2017) 449 473 Contents lists available at ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt Bounded gaps between Gaussian primes Akshaa Vatwani Department
More informationThe dichotomy between structure and randomness. International Congress of Mathematicians, Aug Terence Tao (UCLA)
The dichotomy between structure and randomness International Congress of Mathematicians, Aug 23 2006 Terence Tao (UCLA) 1 A basic problem that occurs in many areas of analysis, combinatorics, PDE, and
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 informationLarge gaps in sets of primes and other sequences II. New bounds for large gaps between primes Random methods and weighted sieves
Large gaps in sets of primes and other sequences II. New bounds for large gaps between primes Random methods and weighted sieves Kevin Ford University of Illinois at Urbana-Champaign May, 2018 Large gaps
More informationThe Green-Tao theorem and a relative Szemerédi theorem
The Green-Tao theorem and a relative Szemerédi theorem Yufei Zhao Massachusetts Institute of Technology Based on joint work with David Conlon (Oxford) and Jacob Fox (MIT) Green Tao Theorem (arxiv 2004;
More informationGeneralizing 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 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 informationarxiv: v6 [math.nt] 6 Nov 2015
arxiv:1406.0429v6 [math.nt] 6 Nov 2015 Periodicity related to a sieve method of producing primes Haifeng Xu, Zuyi Zhang, Jiuru Zhou November 9, 2015 Abstract In this paper we consider a slightly different
More informationB O U N D E D G A P S B E T W E E N P R I M E S. tony feng. may 2, 2014
B O U N D E D G A P S B E T W E E N P R I M E S tony feng may, 4 an essay written for part iii of the mathematical tripos 3-4 A C K N O W L E D G M E N T S I than Professor Timothy Gowers for setting this
More informationRoth s Theorem on Arithmetic Progressions
CHAPTER 4 Roth s Theorem on Arithmetic Progressions c W W L Chen, 1997, 213. This chapter is available free to all individuals, on the understanding that it is not to be used for financial gain, and may
More informationSéminaire BOURBAKI March ème année, , n o 1084
Séminaire BOURBAKI March 2014 66ème année, 2013 2014, n o 1084 GAPS BETWEEN PRIME NUMBERS AND PRIMES IN ARITHMETIC PROGRESSIONS [after Y. Zhang and J. Maynard] by Emmanuel KOWALSKI... utinam intelligere
More informationErgodic aspects of modern dynamics. Prime numbers in two bases
Ergodic aspects of modern dynamics in honour of Mariusz Lemańczyk on his 60th birthday Bedlewo, 13 June 2018 Prime numbers in two bases Christian MAUDUIT Institut de Mathématiques de Marseille UMR 7373
More informationarxiv: 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 informationarxiv: v1 [math.nt] 30 Oct 2014
PRIMES IN INTERVALS OF BOUNDED LENGTH ANDREW GRANVILLE arxiv:1410.8400v1 [math.nt] 30 Oct 2014 Abstract. The infamous Twin Prime conjecture states that there are infinitely many pairs of distinct primes
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 informationSmall Sets Which Meet All the k(n)-term Arithmetic Progressions in the Interval [1;n]
Small Sets Which Meet All the k(n)-term Arithmetic Progressions in the Interval [1;n] Tom C. Brown and Allen R. Freedman Citation data: T.C. Brown and A.R. Freedman, Small sets which meet every f (n)-term
More informationSéminaire BOURBAKI March ème année, , n o 1084
Séminaire BOURBAKI March 2014 66ème année, 2013 2014, n o 1084 GAPS BETWEEN PRIME NUMBERS AND PRIMES IN ARITHMETIC PROGRESSIONS [after Y. Zhang and J. Maynard] by Emmanuel KOWALSKI... utinam intelligere
More informationGoldbach 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 informationThe 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 informationFACTORS OF CARMICHAEL NUMBERS AND A WEAK k-tuples CONJECTURE. 1. Introduction Recall that a Carmichael number is a composite number n for which
FACTORS OF CARMICHAEL NUMBERS AND A WEAK k-tuples CONJECTURE THOMAS WRIGHT Abstract. In light of the recent work by Maynard and Tao on the Dickson k-tuples conjecture, we show that with a small improvement
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 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 informationOn prime factors of subset sums
On prime factors of subset sums by P. Erdös, A. Sárközy and C.L. Stewart * 1 Introduction For any set X let X denote its cardinality and for any integer n larger than one let ω(n) denote the number of
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 informationSQUARE PATTERNS AND INFINITUDE OF PRIMES
SQUARE PATTERNS AND INFINITUDE OF PRIMES KEITH CONRAD 1. Introduction Numerical data suggest the following patterns for prime numbers p: 1 mod p p = 2 or p 1 mod 4, 2 mod p p = 2 or p 1, 7 mod 8, 2 mod
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 informationAddendum to Conjecture 50, by Patrick Capelle. November, 17, 2006.
Addendum to Conjecture 50, by Patrick Capelle. November, 17, 2006. I would like to present here a little work which can be useful to highlight the importance of these new conjectures. The text below is
More informationOn some inequalities between prime numbers
On some inequalities between prime numbers Martin Maulhardt July 204 ABSTRACT. In 948 Erdős and Turán proved that in the set of prime numbers the inequality p n+2 p n+ < p n+ p n is satisfied infinitely
More informationPRIMES IN INTERVALS OF BOUNDED LENGTH
BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 52, Number 2, April 205, Pages 7 222 S 0273-0979(205)0480- Article electronically published on February, 205 PRIMES IN INTERVALS OF BOUNDED
More informationPrime 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 informationRoth s Theorem on 3-term Arithmetic Progressions
Roth s Theorem on 3-term Arithmetic Progressions Mustazee Rahman 1 Introduction This article is a discussion about the proof of a classical theorem of Roth s regarding the existence of three term arithmetic
More informationThe Riddle of Primes
A talk given at Dalian Univ. of Technology (Nov. 16, 2012) and Nankai University (Dec. 1, 2012) The Riddle of Primes Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/
More informationMath 259: Introduction to Analytic Number Theory The Selberg (quadratic) sieve and some applications
Math 259: Introduction to Analytic Number Theory The Selberg (quadratic) sieve and some applications An elementary and indeed naïve approach to the distribution of primes is the following argument: an
More informationChapter 25 Primes in Short Intervals
Chapter 25 Primes in Short Intervals October 10, 2018 25.1 Preliminaries to the modern theory A famous unsolved problem concerning prime numbers is the twin prime conjecture, that there are infinitely
More informationarxiv:math/ v1 [math.nt] 27 May 2006
arxiv:math/0605696v1 [math.nt] 27 May 2006 SMALL GAPS BETWEEN PRIME NUMBERS: THE WORK OF GOLDSTON-PINTZ-YILDIRIM K. Soundararajan Introduction. In early 2005, Dan Goldston, János Pintz, and Cem Yıldırım
More informationarxiv: v1 [math.nt] 31 Dec 2018
POSITIVE PROPORTION OF SORT INTERVALS CONTAINING A PRESCRIBED NUMBER OF PRIMES DANIELE MASTROSTEFANO arxiv:1812.11784v1 [math.nt] 31 Dec 2018 Abstract. We will prove that for every m 0 there exists an
More informationThe Green-Tao theorem and a relative Szemerédi theorem
The Green-Tao theorem and a relative Szemerédi theorem Yufei Zhao Massachusetts Institute of Technology Joint work with David Conlon (Oxford) and Jacob Fox (MIT) Simons Institute December 2013 Green Tao
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 some lower bounds of some symmetry integrals. Giovanni Coppola Università di Salerno
On some lower bounds of some symmetry integrals Giovanni Coppola Università di Salerno www.giovannicoppola.name 0 We give lower bounds of symmetry integrals I f (, h) def = sgn(n x)f(n) 2 dx n x h of arithmetic
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 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 informationVariants of the Selberg sieve, and bounded intervals containing many primes
Polymath Research in the Mathematical Sciences 4, : RESEARCH ARTICLE Variants of the Selberg sieve, and bounded intervals containing many primes DHJ Polymath Open Access Correspondence: tao@math.ucla.edu
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 informationLarge 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 informationA HIGHER RANK SELBERG SIEVE WITH AN ADDITIVE TWIST AND APPLICATIONS M. Ram Murty, Akshaa Vatwani. 1. Introduction
Functiones et Approximatio ** 201*, 1 34 doi: 10.7169/facm/1622 A HIGHER RANK SELBERG SIEVE WITH AN ADDITIVE TWIST AND APPLICATIONS M. Ram Murty, Akshaa Vatwani To the memory of Atle Selberg, with respect
More informationOn the Subsequence of Primes Having Prime Subscripts
3 47 6 3 Journal of Integer Sequences, Vol. (009, Article 09..3 On the Subsequence of Primes Having Prime Subscripts Kevin A. Broughan and A. Ross Barnett University of Waikato Hamilton, New Zealand kab@waikato.ac.nz
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 informationHIGHER CORRELATIONS OF DIVISOR SUMS RELATED TO PRIMES III: SMALL GAPS BETWEEN PRIMES
Proc London Math Soc 3 95 2007 653 686 C 2007 London Mathematical Society doi:02/plms/pdm02 HIGHER CORRELATIONS OF DIVISOR SUMS RELATED TO PRIMES III: SMALL GAPS BETWEEN PRIMES D A GOLDSTON and C Y YILDIRIM
More informationDistribution of Fourier coefficients of primitive forms
Distribution of Fourier coefficients of primitive forms Jie WU Institut Élie Cartan Nancy CNRS et Nancy-Université, France Clermont-Ferrand, le 25 Juin 2008 2 Presented work [1] E. Kowalski, O. Robert
More informationAn Overview of Sieve Methods
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 2, 67-80 An Overview of Sieve Methods R. A. Mollin Department of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada, T2N 1N4 URL:
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 informationDepartment of Mathematics University of California Riverside, CA
SOME PROBLEMS IN COMBINATORIAL NUMBER THEORY 1 Mei-Chu Chang Department of Mathematics University of California Riverside, CA 92521 mcc@math.ucr.edu dedicated to Mel Nathanson on his 60th birthday Abstract
More informationSome new representation problems involving primes
A talk given at Hong Kong Univ. (May 3, 2013) and 2013 ECNU q-series Workshop (Shanghai, July 30) Some new representation problems involving primes Zhi-Wei Sun Nanjing University Nanjing 210093, P. R.
More informationArithmetic progressions in multiplicative groups of finite fields
arxiv:1608.05449v2 [math.nt] 17 Nov 2016 Arithmetic progressions in multiplicative groups of finite fields Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract
More informationSieving 2m-prime pairs
Notes on Number Theory and Discrete Mathematics ISSN 1310 5132 Vol. 20, 2014, No. 3, 54 60 Sieving 2m-prime pairs Srečko Lampret Pohorska cesta 110, 2367 Vuzenica, Slovenia e-mail: lampretsrecko@gmail.com
More informationBOUNDED GAPS BETWEEN PRIMES IN MULTIDIMENSIONAL HECKE EQUIDISTRIBUTION PROBLEMS
BOUNDED GAPS BETWEEN PRIMES IN MULTIDIMENSIONAL HECKE EQUIDISTRIBUTION PROBLEMS JESSE THORNER Abstract. Using Duke s large sieve inequality for Hecke Grössencharaktere and the new sieve methods of Maynard
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 informationBig doings with small g a p s
Big doings with small g a p s Paul Pollack University of Georgia AAAS Annual Meeting February 16, 2015 1 of 26 SMALL GAPS: A SHORT SURVEY 2 of 26 300 BCE Let p n denote the nth prime number, so p 1 = 2,
More informationThe arithmetic of binary representations of even positive integer 2n and its application to the solution of the Goldbach s binary problem
The arithmetic of binary representations of even positive integer 2n and its application to the solution of the Goldbach s binary problem ALEXANDER FEDOROV Abstract One of causes why Goldbach s binary
More informationGoldbach'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 informationProducts of ratios of consecutive integers
Products of ratios of consecutive integers Régis de la Bretèche, Carl Pomerance & Gérald Tenenbaum 27/1/23, 9h26 For Jean-Louis Nicolas, on his sixtieth birthday 1. Introduction Let {ε n } 1 n
More informationOn the low-lying zeros of elliptic curve L-functions
On the low-lying zeros of elliptic curve L-functions Joint Work with Stephan Baier Liangyi Zhao Nanyang Technological University Singapore The zeros of the Riemann zeta function The number of zeros ρ of
More informationOn two-point configurations in subsets of pseudo-random sets
On two-point configurations in subsets of pseudo-random sets Elad Aigner-Horev 2 Department of Mathematics University of Hamburg Bundesstrasse 55 D-20146 Hamburg, Germany Hiệp Hàn 1,3 Instituto de Matemática
More informationCarmichael numbers and the sieve
June 9, 2015 Dedicated to Carl Pomerance in honor of his 70th birthday Carmichael numbers Fermat s little theorem asserts that for any prime n one has a n a (mod n) (a Z) Carmichael numbers Fermat s little
More informationCONSECUTIVE PRIMES AND BEATTY SEQUENCES
CONSECUTIVE PRIMES AND BEATTY SEQUENCES WILLIAM D. BANKS AND VICTOR Z. GUO Abstract. Fix irrational numbers α, ˆα > 1 of finite type and real numbers β, ˆβ 0, and let B and ˆB be the Beatty sequences B.=
More informationTHE CONVEX HULL OF THE PRIME NUMBER GRAPH
THE CONVEX HULL OF THE PRIME NUMBER GRAPH NATHAN MCNEW Abstract Let p n denote the n-th prime number, and consider the prime number graph, the collection of points n, p n in the plane Pomerance uses the
More information