Bounded gaps between primes
|
|
- Chad Waters
- 5 years ago
- Views:
Transcription
1 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 material is not for public distribution. Corrections and new material are welcomed and can be sent to workshops@aimath.org Version: Fri Nov 14 15:44:
2 2 Table of Contents A. Participant Contributions Castillo, Abel 2. Fiorilli, Daniel 3. Franze, Craig 4. Freiberg, Tristan 5. Friedlander, John 6. Graham, Sidney 7. Harper, Adam 8. Kaptan, Deniz 9. Maynard, James 10. Milinovich, Micah 11. Pollack, Paul 12. Tao, Terence 13. Thorner, Jesse 14. Turnage-Butterbaugh, Caroline 15. Yildirim, Cem
3 3 A.1 Castillo, Abel Chapter A: Participant Contributions I would like to have a better understanding of the limitations of the Maynard-Tao method, as a means of exploring ways in which the method can be improved or generalized. For example, consider the following weakening of the prime k-tuples conjecture: Fix and admissible linear system L 1,L 2,...,L k. There are infinitely many positive integers n for which all of L 1 (n),l 2 (n),...,l k (n) each have o(loglogn) distinct prime divisors. How close can the Maynard-Tao method to proving this conjecture? More vaguely, if we weaken the request for primality in different ways, how much closer can we come to using the Maynard- Tao method to make a statement about simultaneous conditions on all of (or a positive proportion of) the linear functions? A.2 Fiorilli, Daniel In this workshop I would like to learn about the recent groundbreaking work on bounded gaps between primes. The GPY sieve has recently been shown to be very flexible, and thus it is apparent that many new important problems can be solved. For example, Erdos s $10000 problem on large gaps between primes has just been resolved. I hope to discuss such problems in the workshop, and to possibly start a research project involving the Maynard- Tao sieve. More precisely, it is now apparent that one can better understand primes in arithmetic progressions of very large moduli, which has been a central object of study in my research. I hope to go in this direction and apply the new techniques on this problem. A.3 Franze, Craig I am interested in applications of the recent variants of the Selberg sieve to sifting limits and almost-prime k-tuples. It is possible that improvements in these problems could be made, at least when the sieve dimension is small. I would also like to better understand the recent progress on small gaps between primes, and to explore other applications suggested by the participants. A.4 Freiberg, Tristan I am interested not just in small gaps between primes, but in medium and large gaps betweenprimes. Letp n denotethenthprimeinthesequenceofallprimes, andd n = p n+1 p n the nth prime gap. Thus, d n /logp n 1 on average by the prime number theorem, and Crámer s model leads us to believe that 1 x #{n x : d n/logp n (a,b]} b a e t dt. Gallagher showed that this would follow from a certain uniform version of the Hardy Littlewood prime k-tuple conjecture. This is obviously quite out of reach, but W. Banks, J. Maynard and I showed that at least 12.5% of positive real numbers are limit points of the sequence {d n /logp n } n 1. The basic philosophy was to combine the Erdős Rankin construction for producing large gaps between primes with the GPY Zhang Maynard Tao Polymath machinery to get gaps between consecutive primes of the desired size.
4 4 One does not have to normalize by logp n the method allows one to consider limit points of {d n /f(p n )} n 1 where f(x) is a sufficiently slowly growing nice function. (In our work we can take f(x) to grow ever so slightly faster than logx.) Maynard has recently answered a well-known question of Erdős by showing that d n /F(p n ) can be infinitely often arbitrarily large, where F(x) = (logx)(log 2 x)(log 4 x)(log 3 x) 1. (This has also been shown using different methods independently by Ford, Green, Konyagin and Tao.) Can one show that a certain percentage of positive reals are limit points of {d n /f(p n )} n 1, for functions f growing as fast as F? Secondly, Crámer s model also leads us to expect that 1 x #{n x : π(n+λlogn) π(n) = k} e λ λ k. k! Again, quite out of reach, but I believe the technology now exists that will allow us to say something interesting here. Finally, one can show that p n p n+1 a mod q for infinitely many n, for any given arithmetic progression a mod q ((q,a) = 1). Can one show that for infinitely many n, p n a mod q and p n+1 b mod q, given (q,ab) = 1? And can one show that there are infinitely many pairs of consecutive primes p n and p n+1 that both split completely in a given non-abelian extension of the rationals? A.5 Friedlander, John Am interested in prime numbers. Am one of the organizers. A.6 Graham, Sidney A. The simplicity and efficacy of the Maynard weights is amazing. It would be nice to have a good heuristic explanation why they work so well. This could lead to further applications or suggest similar ideas that would be effective in sieve applications. B. There has been little progress on general weighted sieves since the work of Greaves in the 1980s. Could Maynard s construction or similar ideas be used to develop weighted either simpler or more powerful than the currently known weighted sieves? A.7 Harper, Adam I am interested in the various results that have been proved giving ( restricted ) levels of distribution beyond 1/2 for the primes and other sequences. I would like to understand more systematically what the trade offs are in the results, between assuming well factorability of the sequence under study (or its combinatorial decompositions), assuming well factorability of the moduli q that we sum over, or both, and in inserting absolute values or allowing the residue class a to vary. I am also interested in the structure and further applications of the Maynard Tao multi-dimensional sieve weights. For example, the classical Selberg sieve weights are essentially the same weights that arise when mollifying the Riemann zeta function or when proving log-free zero-density estimates. I would be interested to understand whether the new sieve weights might have any uses in these contexts.
5 A.8 Kaptan, Deniz I am a Ph.D. student under the supervision of János Pintz, working on applications of the GPY and Maynard-Tao methods. My main goal in attending the workshop is to learn from the experts of the field. The following are some questions that I was led to while following the recent breakthroughs. (i) Would it be possible to select a suitable family of tuples H i and employ counting arguments or results of additive combinatorics so that the primes detected by their translates ( N/(logN) k for each tuple) in [N,2N] would have to intersect in a way that would yield additional information about the distribution of primes? (ii)sincewefindlessthank primesinak-tuple,whatcouldwesalvagefromthemethod if we relaxed admissibility (by requiring, say, that the k-tuple fail to cover all residue classes only for primes l for a parameter l)? We would lose at least by leaving out the bad primes from the sifting procedure but on the other hand gain in tuple length if the method does go through. (iii) How small can N be relative to k or the diameter of H in the Maynard-Tao method to guarantee the existence of primes in tuples in [N,2N]? A.9 Maynard, James I have been involved in some of the sieve-theoretic side of recent work on bounded gaps between primes. Natural questions which I am interested in in this topic include: 1. There are many arithmetic conjectures which follow trivially from the prime k-tuples conjecture (Carmichael numbers with 3 prime factors, Artin s primitive root conjecture, etc.) Are there interesting arithmetic applications of the weak forms of the prime k-tuples conjecture which are now provable? 2. There are parity-related barriers to obtaining several natural strengthenings of the bounded gap results. Are there situations where one can incorporate extra arithmetic information into the method to break the parity barrier? A toy problem might be to attempt to show a positive proportion of primes lie in a different residue class (modulo 4) to the preceeding prime. 3. What is the weakest set of conditions one can put on the moduli for Zhang s equidistribution result to hold with an exponent larger than 1/2? Can one say more if one weakens the statement (e.g. correct order of magnitude for most moduli rather than asymptotic)? Is there any chance to use Kloostermania -type bounds at some part of the argument? A.10 Milinovich, Micah I am analytic number theorist whose research thus far has been focused on the distribution of zeros of zeta and L-functions using explicit formulae, mean-value estimates for L-functions, and other Dirichlet polynomial techniques. I would like to pursue a wider variety of research problems in number theory, including those in sieve theory. Thus, my primary interest in this workshop is to be introduced to open problems that might be accessible to either to me or to a graduate student under my supervision. 5
6 6 A.11 Pollack, Paul I am interested in extensions of the Maynard Tao method that allow one to treat problems in elementary number theory previously only attackable under the prime k-tuples conjecture. An example of work already done in this direction is the resolution of some conjectures of Erdos and Turán by Banks, Freiberg, and Turnage Butterbaugh, as well as their very simple re-proof of Shiu s theorem. Another example is the recent work by Banks, Freiberg, and Maynard on the limit points of the sequence of normalized prime gaps. I am also interested in exploring which sets of primes can be shown to have this bounded gaps property, and whether this can be shown in the strong sense that the primes in the bounded length interval are actually consecutive. Some questions that may be open: Consider the set of primes p 1 (mod 3) for which 2 is a cube mod p. Are there infinitely many pairs of consecutive primes like this lying in an interval of bounded length? Arethereinfinitelymanypairsofprimesp < q withq p 2 (mod 4)andq p = O(1)? Are there infinitely many pairs of consecutive primes p < q where each integer in (p,q) has at least prime factors? How about at most prime factors? Prove that there are infinitely many triples of consecutive prime gaps in the order low high low ; in other words, writing d n := p n+1 p n, we want d n < d n+1 and d n+1 > d n to hold for infinitely many n. (Claudia Spiro has some partial progress on this.) A.12 Tao, Terence I was involved in the recent Polymath8 efforts to improve Zhang s (and later, Maynard s) results on bounded gaps between primes, and can give talks on the methods used in these efforts. A.13 Thorner, Jesse I am interested in applications of the Maynard-Tao construction. I have two applications in mind. 1. Let f(z) = n=1 a(n)e2πinz be a newform of even weight k 2 and level N 1. Suppose further that f has trivial nebentypus and does not have complex multiplication. Then a(n) is real for all n, and when p is prime, we have the Deligne bound a(p) 2p (k 1)/2. Defining cos(θ p ) = a(p) 2p (k 1)/2, Sato and Tate conjectured that the sequence {cos(θ p )} as p runs through the primes is equidistributed in the interval [ 1, 1] with respect to the measure dµ ST = 2 π 1 t2 dt. Barnet-Lamb, Gehrarty, Harris, and Taylor proved that this conjecture is true. It follows from Weyl s criterion that if I [ 1,1] is a subinterval, then #{p x : cos(θ p ) I} µ ST (I)#{p x}. For a given newform f and a given subinterval I [ 1,1], it is not known whether the primes in {p x : cos(θ p ) I} have a positive level of distribution (possibly omitting arithmetic progressions whose moduli are not coprime to N). If a positive level of distribution can be established, I think it would be interesting to see if bounded gaps between these primes can be established. Establishing a positive level of distribution would require some assumptions on the symmetric power L-functions of f, including the Generalized Riemann Hypothesis. 2. In my prior work, I showed that for any Galois extension of number fields L/Q, there exist bounded gaps between primes in Q with a given splitting condition in L, i.e.
7 bounded gaps between primes in Chebotarev sets. By the work of Abel Castillo, Chris Hall, Robert Lemke Oliver, Paul Pollack, and Lola Thompson, we know that there are bounded gaps between primes in number fields. I think it would be interesting to combine the two to obtain bounded gaps between primes in Chebotarev sets where the splitting condition is in a Galois extension L/K where K Q. A.14 Turnage-Butterbaugh, Caroline My main goal of the AIM workshop on bounded gaps between primes is to deepen my understanding of the techniques and arguments used by Goldston-Pintz-Yildirim, Zhang, and Maynard. As a relative newcomer to sieve theory, I plan to use the workshop as a venue to develop and add skills to my repertoire. I also plan to take advantage of the opportunity to brainstorm ideas for new projects and form new collaborative relationships. A.15 Yildirim, Cem There has been spectacular recent developments in the subject of gaps between primes. In the AIM Workshop on Bounded Gaps Between Primes, I hope to benefit from the insights of the mathematicians who will be there, in particular those who have realized the developments on bounded gaps and on large gaps between primes. We naturally wonder how these methods and results can be taken further. The questions include: (i) How can the bound 246 obtianed in the Maynard-Tao method be improved? (ii) How can Zhang s method be improved and/or simplified? (iii) How can the conditional (upon Generalized Elliott-Halberstam conjecture) bound 6 of the Maynard-Tao method be reduced to 2? What hypothesis (presumably on the behaviour of some arithmetic functions) would that require? (iv) Can the recent results on large gaps between primes be taken further in the sense that a function growing faster than that in Rankin s classical result be explicitly given? (v) Are there any implications on the distribution of zeros of the Riemann-ζ and Dirichlet L-functions? The above are questions about pushing the theory ahead of its current limits. There are a few other research possibilities which are I think more practicable: (vi) Applying the weights in the Maynard-Tao method to the problem of positive proportion of small gaps between primes with the aim of getting closer to the prediction from Hardy-Littlewood prime tuples conjecture, i.e. improving the results of the article GPY-4 ( Primes in tuples IV: Density of small gaps between primes, by Goldston, Pintz and Yıldırım). In GPY-4, for any η > 0, arbitrarily small but fixed, the lower bound for the proportion of gaps of size < ηlogn between consecutive primes located in [N,2N] was found as involving η exponentially. Now we have hope of improving this to a polynomial function of η. (vii) The approach of the article GGPY-1 ( Small gaps between primes or almost primes, by Goldston, Graham, Pintz and Yıldırım) proved to be very fruitful for the development of Maynard s breakthrough work. Can we improve upon the bound 6 given in GGPY-2 (Small gaps between products of two primes, by Goldston, Graham, Pintz and Yıldırım) on the gaps between consecutive E 2 -numbers by using the weights in Maynard s work? Same question for blocks of E 2 -numbers. 7
8 8 (viii) A set of problems continuing and generalizing the results of the paper GGPY-3 ( Small gaps between almost primes, the parity problem, and some conjectures of Erdös on consecutive integers, by Goldston, Graham, Pintz and Yıldırım).
Big 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 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 informationSmall 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 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 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 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 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 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 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 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 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 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 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 informationAnalytic. Number Theory. Exploring the Anatomy of Integers. Jean-Marie. De Koninck. Florian Luca. ffk li? Graduate Studies.
Analytic Number Theory Exploring the Anatomy of Integers Jean-Marie Florian Luca De Koninck Graduate Studies in Mathematics Volume 134 ffk li? American Mathematical Society Providence, Rhode Island Preface
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 informationAnalytic Number Theory
American Mathematical Society Colloquium Publications Volume 53 Analytic Number Theory Henryk Iwaniec Emmanuel Kowalski American Mathematical Society Providence, Rhode Island Contents Preface xi Introduction
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 informationElementary Number Theory
Elementary Number Theory 21.8.2013 Overview The course discusses properties of numbers, the most basic mathematical objects. We are going to follow the book: David Burton: Elementary Number Theory What
More informationThe ranges of some familiar arithmetic functions
The ranges of some familiar arithmetic functions Carl Pomerance Dartmouth College, emeritus University of Georgia, emeritus based on joint work with K. Ford, F. Luca, and P. Pollack and T. Freiburg, N.
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 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 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 informationEuler s ϕ function. Carl Pomerance Dartmouth College
Euler s ϕ function Carl Pomerance Dartmouth College Euler s ϕ function: ϕ(n) is the number of integers m [1, n] with m coprime to n. Or, it is the order of the unit group of the ring Z/nZ. Euler: If a
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 informationREFINED GOLDBACH CONJECTURES WITH PRIMES IN PROGRESSIONS
REFINED GOLDBACH CONJECTURES WITH PRIMES IN PROGRESSIONS KIMBALL MARTIN Abstract. We formulate some refinements of Goldbach s conjectures based on heuristic arguments and numerical data. For instance,
More informationAmicable numbers. CRM Workshop on New approaches in probabilistic and multiplicative number theory December 8 12, 2014
Amicable numbers CRM Workshop on New approaches in probabilistic and multiplicative number theory December 8 12, 2014 Carl Pomerance, Dartmouth College (U. Georgia, emeritus) Recall that s(n) = σ(n) n,
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 informationThe ranges of some familiar functions
The ranges of some familiar functions CRM Workshop on New approaches in probabilistic and multiplicative number theory December 8 12, 2014 Carl Pomerance, Dartmouth College (U. Georgia, emeritus) Let us
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 informationThe 98th Mathematics Colloquium Prague November 8, Random number theory. Carl Pomerance, Dartmouth College
The 98th Mathematics Colloquium Prague November 8, 2016 Random number theory Carl Pomerance, Dartmouth College In 1770, Euler wrote: Mathematicians have tried in vain to discover some order in the sequence
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 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 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 informationCounting points on elliptic curves: Hasse s theorem and recent developments
Counting points on elliptic curves: Hasse s theorem and recent developments Igor Tolkov June 3, 009 Abstract We introduce the the elliptic curve and the problem of counting the number of points on the
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 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 informationElliptic Curves Spring 2019 Problem Set #7 Due: 04/08/2019
18.783 Elliptic Curves Spring 2019 Problem Set #7 Due: 04/08/2019 Description These problems are related to the material covered in Lectures 13-14. Instructions: Solve problem 1 and then solve one of Problems
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 informationHOW OFTEN IS EULER S TOTIENT A PERFECT POWER? 1. Introduction
HOW OFTEN IS EULER S TOTIENT A PERFECT POWER? PAUL POLLACK Abstract. Fix an integer k 2. We investigate the number of n x for which ϕn) is a perfect kth power. If we assume plausible conjectures on the
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 informationTHE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS
THE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS BRIAN OSSERMAN Abstract. The study of branched covers of the Riemann sphere has connections to many fields. We recall the classical
More informationHeuristics for Prime Statistics Brown Univ. Feb. 11, K. Conrad, UConn
Heuristics for Prime Statistics Brown Univ. Feb., 2006 K. Conrad, UConn Two quotes about prime numbers Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers,
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 informationPossible Group Structures of Elliptic Curves over Finite Fields
Possible Group Structures of Elliptic Curves over Finite Fields Igor Shparlinski (Sydney) Joint work with: Bill Banks (Columbia-Missouri) Francesco Pappalardi (Roma) Reza Rezaeian Farashahi (Sydney) 1
More informationThe ranges of some familiar arithmetic functions
The ranges of some familiar arithmetic functions Max-Planck-Institut für Mathematik 2 November, 2016 Carl Pomerance, Dartmouth College Let us introduce our cast of characters: ϕ, λ, σ, s Euler s function:
More informationElliptic Curves Spring 2013 Lecture #12 03/19/2013
18.783 Elliptic Curves Spring 2013 Lecture #12 03/19/2013 We now consider our first practical application of elliptic curves: factoring integers. Before presenting the elliptic curve method (ECM) for factoring
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 informationContest Number Theory
Contest Number Theory Andre Kessler December 7, 2008 Introduction Number theory is one of the core subject areas of mathematics. It can be somewhat loosely defined as the study of the integers. Unfortunately,
More informationMATHEMATICS 6180, SPRING 2017 SOME MOTIVATIONAL PROBLEMS IN NUMBER THEORY. p k
MATHEMATICS 680, SPRING 207 SOME MOTIVATIONAL PROBLEMS IN NUMBER THEORY KATHERINE E. STANGE Number theory may be loosely defined as the study of the integers: in particular, the interaction between their
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 informationOrder and chaos. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
Order and chaos Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Perfect shuffles Suppose you take a deck of 52 cards, cut it in half, and perfectly shuffle it (with the bottom card staying
More informationarxiv: v1 [math.ho] 16 Jan 2017
COULD EULER HAVE CONJECTURED THE PRIME NUMBER THEOREM? SIMON RUBINSTEIN-SALZEDO arxiv:70.0478v [math.ho] 6 Jan 207 Abstract. In this article, we investigate how Euler might have been led to conjecture
More informationAlmost Primes of the Form p c
Almost Primes of the Form p c University of Missouri zgbmf@mail.missouri.edu Pre-Conference Workshop of Elementary, Analytic, and Algorithmic Number Theory Conference in Honor of Carl Pomerance s 70th
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 informationHorocycle Flow at Prime Times
Horocycle Flow at Prime Times Peter Sarnak Mahler Lectures 2011 Rotation of the Circle A very simple (but by no means trivial) dynamical system is the rotation (or more generally translation in a compact
More informationThe Prime Number Theorem
Chapter 3 The Prime Number Theorem This chapter gives without proof the two basic results of analytic number theory. 3.1 The Theorem Recall that if f(x), g(x) are two real-valued functions, we write to
More informationMOMENTS OF PRODUCTS OF L-FUNCTIONS DISSERTATION
MOMENTS OF PRODUCTS OF L-FUNCTIONS DISSERTATION A Dissertation presented in partial fulfillment of requirements for the degree of Doctor of Philosophy in the Department of Mathematics The University of
More informationArithmetic Statistics Lecture 1
Arithmetic Statistics Lecture 1 Álvaro Lozano-Robledo Department of Mathematics University of Connecticut May 28 th CTNT 2018 Connecticut Summer School in Number Theory Question What is Arithmetic Statistics?
More informationA good new millenium for the primes
32 Andrew Granville* is the Canadian Research Chair in number theory at the Université de Montréal. Prime numbers, the building blocks from which integers are made, are central to much of mathematics.
More informationEquidistributions in arithmetic geometry
Equidistributions in arithmetic geometry Edgar Costa Dartmouth College 14th January 2016 Dartmouth College 1 / 29 Edgar Costa Equidistributions in arithmetic geometry Motivation: Randomness Principle Rigidity/Randomness
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 informationThe multiplicative order mod n, on average
The multiplicative order mod n, on average Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA (Joint work with: Michel Balazard, Pär Kurlberg) Perfect shuffles Suppose you take a deck of 52
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 informationRamsey theory. Andrés Eduardo Caicedo. Undergraduate Math Seminar, March 22, Department of Mathematics Boise State University
Andrés Eduardo Department of Mathematics Boise State University Undergraduate Math Seminar, March 22, 2012 Thanks to the NSF for partial support through grant DMS-0801189. My work is mostly in set theory,
More informationA 1935 Erdős paper on prime numbers and Euler s function
A 1935 Erdős paper on prime numbers and Euler s function Carl Pomerance, Dartmouth College with Florian Luca, UNAM, Morelia 1 2 3 4 Hardy & Ramanujan, 1917: The normal number of prime divisors of n is
More informationCounting in number theory. Fibonacci integers. Carl Pomerance, Dartmouth College. Rademacher Lecture 3, University of Pennsylvania September, 2010
Counting in number theory Fibonacci integers Carl Pomerance, Dartmouth College Rademacher Lecture 3, University of Pennsylvania September, 2010 Leonardo of Pisa (Fibonacci) (c. 1170 c. 1250) 1 We all know
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 informationOn the arithmetic of modular forms
On the arithmetic of modular forms Gabor Wiese 15 June 2017 Modular forms There are five fundamental operations: addition, subtraction, multiplication, division, and modular forms. Martin Eichler (1912-1992)
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 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 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 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 informationDirichlet Series Associated with Cubic and Quartic Fields
Dirichlet Series Associated with Cubic and Quartic Fields Henri Cohen, Frank Thorne Institut de Mathématiques de Bordeaux October 23, 2012, Bordeaux 1 Introduction I Number fields will always be considered
More informationNORMAL 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 informationFINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures)
FINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures) Ana Zumalacárregui a.zumalacarregui@unsw.edu.au November 30, 2015 Contents 1 Operations on sets 1 2 Sum-product theorem
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 informationAnalytic number theory for probabilists
Analytic number theory for probabilists E. Kowalski ETH Zürich 27 October 2008 Je crois que je l ai su tout de suite : je partirais sur le Zéta, ce serait mon navire Argo, celui qui me conduirait à la
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 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 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 informationGeneralized Lucas Sequences Part II
Introduction Generalized Lucas Sequences Part II Daryl DeFord Washington State University February 4, 2013 Introduction Èdouard Lucas: The theory of recurrent sequences is an inexhaustible mine which contains
More informationTables of elliptic curves over number fields
Tables of elliptic curves over number fields John Cremona University of Warwick 10 March 2014 Overview 1 Why make tables? What is a table? 2 Simple enumeration 3 Using modularity 4 Curves with prescribed
More informationHOME ASSIGNMENT: ELLIPTIC CURVES OVER FINITE FIELDS
HOME ASSIGNMENT: ELLIPTIC CURVES OVER FINITE FIELDS DANIEL LARSSON CONTENTS 1. Introduction 1 2. Finite fields 1 3. Elliptic curves over finite fields 3 4. Zeta functions and the Weil conjectures 6 1.
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 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 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 informationMöbius Randomness and Dynamics
Möbius Randomness and Dynamics Peter Sarnak Mahler Lectures 2011 n 1, µ(n) = { ( 1) t if n = p 1 p 2 p t distinct, 0 if n has a square factor. 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1,.... Is this a random sequence?
More informationOrder and chaos. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
Order and chaos Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Perfect shuffles Suppose you take a deck of 52 cards, cut it in half, and perfectly shuffle it (with the bottom card staying
More informationAnalytic Number Theory Solutions
Analytic Number Theory Solutions Sean Li Cornell University sxl6@cornell.edu Jan. 03 Introduction This document is a work-in-progress solution manual for Tom Apostol s Introduction to Analytic Number Theory.
More informationDETERMINISTIC METHODS TO FIND PRIMES
DETERMINISTIC METHODS TO FIND PRIMES D.H.J. POLYMATH Abstract. Given a large positive integer N, how quickly can one construct a prime number larger than N (or between N and 2N)? Using probabilistic methods,
More informationTable of Contents. 2013, Pearson Education, Inc.
Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter
More informationELEMENTARY PROOF OF DIRICHLET THEOREM
ELEMENTARY PROOF OF DIRICHLET THEOREM ZIJIAN WANG Abstract. In this expository paper, we present the Dirichlet Theorem on primes in arithmetic progressions along with an elementary proof. We first show
More informationFrobenius and His Density Theorem for Primes
Frobenius and His Density Theorem for Primes Introduction B Sury Our starting point is the following problem which appeared in the recent IMO (International Mathematical Olympiad) 9 If p is a prime number,
More informationContradictions 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 informationVariants on Andrica s conjecture with and without the Riemann hypothesis
Variants on Andrica s conjecture with and without the Riemann hypothesis arxiv:1804.02500v2 [math.nt] 18 Sep 2018 Matt Visser ID School of Mathematics and Statistics, Victoria University of Wellington,
More informationCYCLOTOMIC FIELDS CARL ERICKSON
CYCLOTOMIC FIELDS CARL ERICKSON Cyclotomic fields are an interesting laboratory for algebraic number theory because they are connected to fundamental problems - Fermat s Last Theorem for example - and
More informationORDERS OF ELEMENTS IN A GROUP
ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since
More informationResearch Problems in Arithmetic Combinatorics
Research Problems in Arithmetic Combinatorics Ernie Croot July 13, 2006 1. (related to a quesiton of J. Bourgain) Classify all polynomials f(x, y) Z[x, y] which have the following property: There exists
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/25833 holds various files of this Leiden University dissertation Author: Palenstijn, Willem Jan Title: Radicals in Arithmetic Issue Date: 2014-05-22 Chapter
More informationDense Admissible Sets
Dense Admissible Sets Daniel M. Gordon and Gene Rodemich Center for Communications Research 4320 Westerra Court San Diego, CA 92121 {gordon,gene}@ccrwest.org Abstract. Call a set of integers {b 1, b 2,...,
More information