ON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE
|
|
- Preston Hicks
- 5 years ago
- Views:
Transcription
1 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
2 Dirichlet showed that f(n) = an + b is prime for infinitely many n N if and only if gcd(a, b) = 1. If f(n) is a polynomial of degree 2 or higher, no similar statement is known. Set Λ(n) = { log p if n = p k ; 0 otherwise. G. H. Hardy and J. E. Littlewood conjectured that (1) where n x Λ(n 2 + k) S(k)x, S(k) = p>2 1 ( ) k p p 1 with ( k p ) being the Legendre symbol. 1
3 Theorem 1 (Baier, Z. 2006). Given A, B > 0, we have, for x 2 (log x) A y x 2, k y µ(k) 0 n x Λ(n 2 + k) S(k)x 2 = O ( yx 2 (log x) B ). From the theorem, we have the following. Corollary 1 (Baier, Z. 2006). Given A, B, C > 0 and S(k) as defined in the theorem, we have, for x 2 (log x) A y x 2, that n x Λ(n 2 + k) = S(k)x + O ( x (log x) B holds for all square-free k not exceeding y with at most O ( y(log x) C) exceptions. ) The theorem and corollary verify that the Hardy- Littlewood conjecture (1) is the correct conjecture.
4 Proof. Circle method, we split the integration interval [0,1] into major arcs and minor arcs. n x 1 = Λ(n 2 + k) 0 Λ(m)e(αm) e ( α(n 2 + k) ) dα, m z n x where e(z) = exp(2πiz), and z = x 2 + y. In brief, the major arcs are the part of the interval [0,1] that are close to a rational number of with small denominator and the minor arcs are the rest. The contribution of the major arcss will give raise to the main term. The rest will be error terms.
5 Theorem 1 has recently been improved. The theorem holds true for much smaller values of y, i.e. x 1+ε y x 2 ε. Moreover, the unfortunately restriction that k must be square-free is also removed. In fact, the improvment follows from the follow theorem for short segments of quadratic progressions on average. Theorem 2 (Baier, Z. 2007). Suppose that z 3, z 2/3+ε z 1 ε and z 1/2+ε K z 1 ε. Then, given B > 0, we have (2) where and 2z z 1 k K S Λ (t,, k) S(k)S 1 (t,, k) 2 dt S Λ (t,, k) = 2 K (log z) B, S 1 (t,, k) = t<n 2 +k t+ t<n 2 +k t+ Λ(n 2 + k), 1.
6 Here our approach is a variant of the dispersion method of J. V. Linnik. Expanding the modulus square in (2), we will get three terms U(t), V (t) and W(t), the mean-values of which we develop asymptotic formulas. The main terms will cancel out at the end, giving the desired result. Under the generalized Riemann hypothesis(grh) for Dirichlet L-function, may be taken from a wider range z 1/2+ε z 1 ε. It would be highly desirable to have the results in which K = o( z) in Theorem 2 since in that situation the quadratic progressions under consideration would be completely disjoint. We should highly value any suggestion toward this end.
7 Theorem 3 (Baier, Z. 2006). For any ε > 0, there exist infinitely many primes of the form p = am 2 +1 with a p 5/9+ε. This is an approximation to the n problem as the latter is equivalent to the statement of the theorem with a = 1. Hence in this sense, the smaller the majorant we can have for a, the closer we are to the n problem. A more quantitatively, for any ε > 0, #{p x : p = am 2 + 1, a p 5/9+ε } x 7/9 ε. The result is to pick out primes that are congruent to 1 modulo a large square, which was given by Bombieri-Vinogradov Theorem for Square moduli which follows from large sieve for square moduli.
8 The method would also give similar statements for a variety of polynomials such as am 2 1. But the n 2 1 problems needs no approximation. We also note that the set of integers of the form m is very sparse. Note that #{n x : n = m 2 + 1} = O( x). It is generally very difficult to produce primes out of such sparse sets. Friedlander and Iwaniec proved the celebrated result of the infinitude of primes of the form m 2 +n 4 (with an asymptotic formula). #{k x : k = m 2 + n 4 } = O(x 3/4 ). Heath-Brown proved a similar statement for m 3 + 2n 3. #{k x : k = m 3 + 2n 3 } = O(x 2/3 ). The set of natural numbers n = am with a n 5/9+ε is also very sparse. #{n x : n = am 2 + 1, a n 5/9+ε } = O(x 7/9+ε ).
9 Theorem 4 (Baier, Z. 2006). For any ε > 0 and fixed A > 0, we have q x 2/9 ε q where max a gcd(a,q)=1 ψ(x; q, a) = ψ(x; q2, a) x ϕ(q 2 ) Λ(n). n x n a mod q x (log x) A, q does not run over the correct range. This would be a complete analogue of the classical Bombieri-Vinogradov theorem if the range for q is 0 < q x 1/4 ε. The theorem improve a result of H. Mikawa, T. Peneva which is an improvement of a result of P. Elliott. The theorem follows from large sieve for square moduli.
10 Various versions of large sieve for square moduli were obtained both jointly and indepdently by Baier and Z., via very intricate techniques. Detecting Farey fractions with square denomenators in short intervals via combinatorial arguments. Exploring cancellation of main term coming from stationary phase with weights. Exploring cancellation due to change of arguement of quadratic Gauss sums. We don t have the complete analogue of classical Bombieri-Vinogradov theorem for sqaure moduli because we did not obtain the complete analogue of large sieve for square moduli.
11 Conjecturally(Z. 2004), we expect Farey fractions with square denomenators to distribute in a nice way. The conjecture was tested numerically. If such fractions are distributed nicely, then large sieve for square moduli is nice. If we have a nice large sieve for square moduli, then Theorem 4 has the correct range. Theorem 4 with the correct range gives infinitude of primes Note p = am with a p 1/2+ε. #{n x : n = am 2 + 1, a n 1/2+ε } = O(x 3/4+ε ). The GRH gives the same result as above. The Elliott-Halberstam conjecture for square moduli would give infinitude of primes p = am with a p ε. The the number of n = am with n x and a n ε is O(x 1/2+ε ).
12 Let E be an elliptic curve over Q. For any prime number p of good reduction, the number of points on the reduced curve modulo p equals #E(F p ) = p + 1 λ E (p). By Hasse s theorem, there exists a unique angle 0 θ π such that λ E (p) = p ( e iθ E(p) + e iθ E (p) ) = 2 pcos θ E (p). If E has complex multiplication(cm), Deuring (1941) showed that half of the primes satisfy λ E (p) = 0 ( supersingular primes ), and for the remaining half of the primes the angles θ E (p) are distributed uniformly in the interval [0, π]. If E admits no CM, Sato and Tate (1965) formulated the following conjecture. For any 0 θ 1 θ 2 π, and x 1, let π θ 1,θ 2 E (x) := #{p x : θ 1 θ E (p) θ 2 }. Then, with π(x) = #{p x : p P}, lim x π θ 1,θ 2 E π(x) (x) θ 2 = 2 sin 2 θ dθ. π θ 1
13 Modified Sato-Tate Conjecture: Suppose E is an elliptic curve over Q without complex multiplication. For 1 α β 1, x 1, let Then Θ E (α, β; x) := p x α λ E (p)/(2 p) β log p. lim x Θ E (α, β; x) x = F(α, β) := 2 π β α 1 t 2 dt.
14 Relation to symmetric power L-functions Langlands and Serre have related the Sato-Tate conjecture to symmetric power L-functions associated to the curve E. Sato-Tate conjecture holds if each symmetric power L-function associated to E L m (E; s) := p (E) m j=0 ( 1 e (m 2j)iθ E (p) p s ) 1 can be extended meromorphically to the complex plane, satisfy the expected functional equation and are holomorphic and non-zero for Rs 1. In a recent preprint R. E. Taylor (2006) proved the afore-mentioned conditions hold, thus proving the Sato-Tate conjecture.
15 In the sequel, we set γ := β α. Theorem 5 (Baier, Z. 2006). Let x 1, 0 < α β 1. Assume that x ε 5/12 γ/β x ε and F(α, β) x 1/2+ε. Then, if A, B > x 1/2+ε and AB > x 1+ε /F(α, β), we have, for every c > 0, 1 4AB a A b B = xf(α, β) Θ E(a,b) (α, β; x) ( ( )) O log c, x where the implied O-constant depends only on c. We also have the following almost-all result. Theorem 6 (Baier, Z. 2006). Let x 1, 0 < α β 1. Assume that x ε 5/12 γ/β x ε, F(α, β) x 1/2+ε, A, B > x 1+ε, x 2+ε /F(α, β) 2 < AB, and AB < exp(exp(x 1 ε )). Then, for any c, d > 0, we have ( ( )) 1 Θ E(a,b) (α, β; x) = xf(α, β) 1 + O log c x for all a A, b B with at most O ( AB/(log x) d) exceptions. Here the implied O-constant depends only on c and d.
16 Remarks on the Sato-Tate results Taylor s work does not imply any result on average due to the lack of uniformity with respect to the coefficients a and b and also the angles α and β. Using results due to Duering, the expression of our interest follow an asymptotic formula whose main term involves the Kronecker class number. Applying the Dirichlet class number formula, the said main term is studied by considering the resulting Dirichlet L-functions. We need a Barban-Davenport-Halberstam type theorem for short intervals for the main term. The error terms are transformed into character sums via considerations for isomorphism classes of elliptic curves over F p. Characterizing the isomorphism classes will give raise to congruence relations on the coefficients of the elliptic curves which are detected using character sums.
17 The result follows by careful studies of the resulting characters sums, using fourth moment estimate of character sums of Frieldander-Iwaniec and Polya- Vinogradov estimate for character sums. These results improve some recent results of K. James and G. Yu(2006). These results have recently been improved by W. D. Banks and I. E. Shparlinski (2006). The connection between primes in quadratic progressions and Sato-Tate conjecture lies in a much more general conjecture attributed to S. Lang and H. Trotter. Lang-Trotter conjecture implies Sato-Tate conjecture and gives the Hardy-Littlewood asymptotics (1) for a large family of quadratic progressions.
RESEARCH STATEMENT OF LIANGYI ZHAO
RESEARCH STATEMENT OF LIANGYI ZHAO I. Research Overview My research interests mainly lie in analytic number theory and include mean-value type theorems, exponential and character sums, L-functions, elliptic
More informationResults of modern sieve methods in prime number theory and more
Results of modern sieve methods in prime number theory and more Karin Halupczok (WWU Münster) EWM-Conference 2012, Universität Bielefeld, 12 November 2012 1 Basic ideas of sieve theory 2 Classical applications
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 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 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 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 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 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 informationBURGESS BOUND FOR CHARACTER SUMS. 1. Introduction Here we give a survey on the bounds for character sums of D. A. Burgess [1].
BURGESS BOUND FOR CHARACTER SUMS LIANGYI ZHAO 1. Introduction Here we give a survey on the bounds for character sums of D. A. Burgess [1]. We henceforth set (1.1) S χ (N) = χ(n), M
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 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 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 informationExponential and character sums with Mersenne numbers
Exponential and character sums with Mersenne numbers William D. Banks Dept. of Mathematics, University of Missouri Columbia, MO 652, USA bankswd@missouri.edu John B. Friedlander Dept. of Mathematics, University
More 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 informationProjects on elliptic curves and modular forms
Projects on elliptic curves and modular forms Math 480, Spring 2010 In the following are 11 projects for this course. Some of the projects are rather ambitious and may very well be the topic of a master
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 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 informationMTH598A Report The Vinogradov Theorem
MTH598A Report The Vinogradov Theorem Anurag Sahay 11141/11917141 under the supervision of Dr. Somnath Jha Dept. of Mathematics and Statistics 4th November, 2015 Abstract The Goldbach conjecture is one
More information(Primes and) Squares modulo p
(Primes and) Squares modulo p Paul Pollack MAA Invited Paper Session on Accessible Problems in Modern Number Theory January 13, 2018 1 of 15 Question Consider the infinite arithmetic progression Does it
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 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 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 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 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 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 informationCharacter sums with Beatty sequences on Burgess-type intervals
Character sums with Beatty sequences on Burgess-type intervals William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationA numerically explicit Burgess inequality and an application to qua
A numerically explicit Burgess inequality and an application to quadratic non-residues Swarthmore College AMS Sectional Meeting Akron, OH October 21, 2012 Squares Consider the sequence Can it contain any
More informationA Smorgasbord of Applications of Fourier Analysis to Number Theory
A Smorgasbord of Applications of Fourier Analysis to Number Theory by Daniel Baczkowski Uniform Distribution modulo Definition. Let {x} denote the fractional part of a real number x. A sequence (u n R
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 informationQUADRATIC FIELDS WITH CYCLIC 2-CLASS GROUPS
QUADRATIC FIELDS WITH CYCLIC -CLASS GROUPS CARLOS DOMINGUEZ, STEVEN J. MILLER, AND SIMAN WONG Abstract. For any integer k 1, we show that there are infinitely many complex quadratic fields whose -class
More 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 informationWhy is the Riemann Hypothesis Important?
Why is the Riemann Hypothesis Important? Keith Conrad University of Connecticut August 11, 2016 1859: Riemann s Address to the Berlin Academy of Sciences The Zeta-function For s C with Re(s) > 1, set ζ(s)
More informationThe ternary Goldbach problem. Harald Andrés Helfgott. Introduction. The circle method. The major arcs. Minor arcs. Conclusion.
The ternary May 2013 The ternary : what is it? What was known? Ternary Golbach conjecture (1742), or three-prime problem: Every odd number n 7 is the sum of three primes. (Binary Goldbach conjecture: every
More 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 informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
More informationThe Least Inert Prime in a Real Quadratic Field
Explicit Palmetto Number Theory Series December 4, 2010 Explicit An upperbound on the least inert prime in a real quadratic field An integer D is a fundamental discriminant if and only if either D is squarefree,
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 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 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 informationOn some congruence properties of elliptic curves
arxiv:0803.2809v5 [math.nt] 19 Jun 2009 On some congruence properties of elliptic curves Derong Qiu (School of Mathematical Sciences, Institute of Mathematics and Interdisciplinary Science, Capital Normal
More informationMath 229: Introduction to Analytic Number Theory Elementary approaches I: Variations on a theme of Euclid
Math 229: Introduction to Analytic Number Theory Elementary approaches I: Variations on a theme of Euclid Like much of mathematics, the history of the distribution of primes begins with Euclid: Theorem
More informationOn pseudosquares and pseudopowers
On pseudosquares and pseudopowers Carl Pomerance Department of Mathematics Dartmouth College Hanover, NH 03755-3551, USA carl.pomerance@dartmouth.edu Igor E. Shparlinski Department of Computing Macquarie
More informationas x. Before giving the detailed proof, we outline our strategy. Define the functions for Re s > 1.
Chapter 7 The Prime number theorem for arithmetic progressions 7.1 The Prime number theorem Denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.1. We have π( log as. Before
More informationAVERAGE TWIN PRIME CONJECTURE FOR ELLIPTIC CURVES
AVERAGE TWIN PRIME CONJECTURE FOR ELLIPTIC CURVES ANTAL BALOG, ALINA-CARMEN COJOCARU AND CHANTAL DAVID Abstract Let E be an elliptic curve over Q In 988, N Koblitz conjectured a precise asymptotic for
More informationGoldbach 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 informationBalanced subgroups of the multiplicative group
Balanced subgroups of the multiplicative group Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Based on joint work with D. Ulmer To motivate the topic, let s begin with elliptic curves. If
More informationPrime numbers with Beatty sequences
Prime numbers with Beatty sequences William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Igor E. Shparlinski Department of Computing Macquarie
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 informationJournal of Combinatorics and Number Theory 1(2009), no. 1, ON SUMS OF PRIMES AND TRIANGULAR NUMBERS. Zhi-Wei Sun
Journal of Combinatorics and Number Theory 1(009), no. 1, 65 76. ON SUMS OF PRIMES AND TRIANGULAR NUMBERS Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing 10093, People s Republic of China
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 informationDensity of non-residues in Burgess-type intervals and applications
Bull. London Math. Soc. 40 2008) 88 96 C 2008 London Mathematical Society doi:0.2/blms/bdm Density of non-residues in Burgess-type intervals and applications W. D. Banks, M. Z. Garaev, D. R. Heath-Brown
More informationOn pseudosquares and pseudopowers
On pseudosquares and pseudopowers Carl Pomerance Department of Mathematics Dartmouth College Hanover, NH 03755-3551, USA carl.pomerance@dartmouth.edu Igor E. Shparlinski Department of Computing Macquarie
More informationPolygonal 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 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 informationCHEBYSHEV S BIAS AND GENERALIZED RIEMANN HYPOTHESIS
Journal of Algebra, Number Theory: Advances and Applications Volume 8, Number -, 0, Pages 4-55 CHEBYSHEV S BIAS AND GENERALIZED RIEMANN HYPOTHESIS ADEL ALAHMADI, MICHEL PLANAT and PATRICK SOLÉ 3 MECAA
More informationEXTREMAL PRIMES FOR ELLIPTIC CURVES WITH COMPLEX MULTIPLICATION
EXTREMAL PRIMES FOR ELLIPTIC CURVES WITH COMPLEX MULTIPLICATION KEVIN JAMES AND PAUL POLLACK Abstract. Fix an elliptic curve E/Q. For each prime p of good reduction, let a p = p + #E(F p ). A well-known
More informationBjorn Poonen. MSRI Introductory Workshop on Rational and Integral Points on Higher-dimensional Varieties. January 17, 2006
University of California at Berkeley MSRI Introductory Workshop on Rational and Integral Points on Higher-dimensional (organized by Jean-Louis Colliot-Thélène, Roger Heath-Brown, János Kollár,, Alice Silverberg,
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 informationOn the representation of primes by polynomials (a survey of some recent results)
On the representation of primes by polynomials (a survey of some recent results) B.Z. Moroz 0. This survey article has appeared in: Proceedings of the Mathematical Institute of the Belarussian Academy
More informationPrimes in arithmetic progressions
(September 26, 205) Primes in arithmetic progressions Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/mfms/notes 205-6/06 Dirichlet.pdf].
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 informationAdvanced Number Theory Note #8: Dirichlet's theorem on primes in arithmetic progressions 29 August 2012 at 19:01
Advanced Number Theory Note #8: Dirichlet's theorem on primes in arithmetic progressions 29 August 2012 at 19:01 Public In this note, which is intended mainly as a technical memo for myself, I give a 'blow-by-blow'
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
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 informationPrime Gaps and Adeles. Tom Wright Johns Hopkins University (joint with B. Weiss, University of Michigan)
Prime Gaps and Adeles Tom Wright Johns Hopkins University (joint with B. Weiss, University of Michigan) January 16, 2010 History 2000 years ago, Euclid posed the following conjecture: Twin Prime Conjecture:
More informationLINNIK S THEOREM MATH 613E UBC
LINNIK S THEOREM MATH 63E UBC FINAL REPORT BY COLIN WEIR AND TOPIC PRESENTED BY NICK HARLAND Abstract This report will describe in detail the proof of Linnik s theorem regarding the least prime in an arithmetic
More informationThe distribution of consecutive prime biases
The distribution of consecutive prime biases Robert J. Lemke Oliver 1 Tufts University (Joint with K. Soundararajan) 1 Partially supported by NSF grant DMS-1601398 Chebyshev s Bias Let π(x; q, a) := #{p
More informationPrimes in arithmetic progressions to large moduli
CHAPTER 3 Primes in arithmetic progressions to large moduli In this section we prove the celebrated theorem of Bombieri and Vinogradov Theorem 3. (Bombieri-Vinogradov). For any A, thereeistsb = B(A) such
More 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 informationGroup Structures of Elliptic Curves:
Group Structures of Elliptic Curves: Statistics, Heuristics, Algorithms, Numerics Igor E. Shparlinski University of New South Wales Sydney 2 Introduction Two common beliefs A. Besides possible torsion
More informationOn 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 informationThe Lang-Trotter Conjecture on Average
arxiv:math/0609095v [math.nt] Se 2006 The Lang-Trotter Conjecture on Average Stehan Baier July, 208 Abstract For an ellitic curve E over Q and an integer r let πe r (x) be the number of rimes x of good
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 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 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 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 informationOverview. exp(2πiq(x)z) x Z m
Overview We give an introduction to the theory of automorphic forms on the multiplicative group of a quaternion algebra over Q and over totally real fields F (including Hilbert modular forms). We know
More informationDIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS
DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS JEREMY LOVEJOY Abstract. We study the generating function for (n), the number of partitions of a natural number n into distinct parts. Using
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
More informationAlan Turing and the Riemann hypothesis. Andrew Booker
Alan Turing and the Riemann hypothesis Andrew Booker Introduction to ζ(s) and the Riemann hypothesis The Riemann ζ-function is defined for a complex variable s with real part R(s) > 1 by ζ(s) := n=1 1
More informationSOME REMARKS ON ARTIN'S CONJECTURE
Canad. Math. Bull. Vol. 30 (1), 1987 SOME REMARKS ON ARTIN'S CONJECTURE BY M. RAM MURTY AND S. SR1NIVASAN ABSTRACT. It is a classical conjecture of E. Artin that any integer a > 1 which is not a perfect
More information1, for s = σ + it where σ, t R and σ > 1
DIRICHLET L-FUNCTIONS AND DEDEKIND ζ-functions FRIMPONG A. BAIDOO Abstract. We begin by introducing Dirichlet L-functions which we use to prove Dirichlet s theorem on arithmetic progressions. From there,
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 informationPOTENTIAL PROBLEM DESCRIPTIONS
POTENTIAL PROBLEM DESCRIPTIONS I. Combinatorics (a) Problem 1: Partitions We define a partition of a number, n, to be a sequence of non-increasing positive integers that sum to n. We want to examine the
More informationTHE DISTRIBUTION OF ADDITIVE FUNCTIONS IN SHORT INTERVALS ON THE SET OF SHIFTED INTEGERS HAVING A FIXED NUMBER OF PRIME FACTORS
Annales Univ. Sci. Budaest., Sect. Com. 38 202) 57-70 THE DISTRIBUTION OF ADDITIVE FUNCTIONS IN SHORT INTERVALS ON THE SET OF SHIFTED INTEGERS HAVING A FIXED NUMBER OF PRIME FACTORS J.-M. De Koninck Québec,
More informationFINITE GROUPS AND EQUATIONS OVER FINITE FIELDS A PROBLEM SET FOR ARIZONA WINTER SCHOOL 2016
FINITE GROUPS AND EQUATIONS OVER FINITE FIELDS A PROBLEM SET FOR ARIZONA WINTER SCHOOL 2016 PREPARED BY SHABNAM AKHTARI Introduction and Notations The problems in Part I are related to Andrew Sutherland
More informationCarmichael numbers with a totient of the form a 2 + nb 2
Carmichael numbers with a totient of the form a 2 + nb 2 William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bankswd@missouri.edu Abstract Let ϕ be the Euler function.
More 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 informationDivisibility. 1.1 Foundations
1 Divisibility 1.1 Foundations The set 1, 2, 3,...of all natural numbers will be denoted by N. There is no need to enter here into philosophical questions concerning the existence of N. It will suffice
More informationPretentiousness in analytic number theory. Andrew Granville A report on joint work with K. Soundararajan, and Antal Balog
Pretentiousness in analytic number theory Andrew Granville A report on joint work with K. Soundararajan, and Antal Balog The number of primes up to x Gauss, Christmas eve 1849: As a boy of 15 or 16, I
More informationTHE GENERALIZED ARTIN CONJECTURE AND ARITHMETIC ORBIFOLDS
THE GENERALIZED ARTIN CONJECTURE AND ARITHMETIC ORBIFOLDS M. RAM MURTY AND KATHLEEN L. PETERSEN Abstract. Let K be a number field with positive unit rank, and let O K denote the ring of integers of K.
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 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 informationPrime Divisors of Palindromes
Prime Divisors of Palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 6511 USA bbanks@math.missouri.edu Igor E. Shparlinski Department of Computing, Macquarie University
More 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 Carmichael numbers in arithmetic progressions
On Carmichael numbers in arithmetic progressions William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Carl Pomerance Department of Mathematics
More informationON THE SEMIPRIMITIVITY OF CYCLIC CODES
ON THE SEMIPRIMITIVITY OF CYCLIC CODES YVES AUBRY AND PHILIPPE LANGEVIN Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one exception, that an irreducible cyclic
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 informationA First Look at the Complex Modulus
A First Look at the Complex Modulus After expanding the field of arithmetic by introducing complex numbers, and also defining their properties, Gauss introduces the complex modulus. We have treated the
More information