Analytic. Number Theory. Exploring the Anatomy of Integers. Jean-Marie. De Koninck. Florian Luca. ffk li? Graduate Studies.

Similar documents
COMPLEX ANALYSIS in NUMBER THEORY

Analytic Number Theory

The New Book of Prime Number Records

Cryptography. Number Theory with AN INTRODUCTION TO. James S. Kraft. Lawrence C. Washington. CRC Press

Summary Slides for MATH 342 June 25, 2018

Part II. Number Theory. Year

Number Theory and Algebraic Equations. Odile Marie-Thérèse Pons

A Classical Introduction to Modern Number Theory

Introduction to Number Theory

ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS. Special Functions GEORGE E. ANDREWS RICHARD ASKEY RANJAN ROY CAMBRIDGE UNIVERSITY PRESS

Divisibility. 1.1 Foundations

An Invitation to Modern Number Theory. Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD

E.J. Barbeau. Polynomials. With 36 Illustrations. Springer

Contents. Preface to the First Edition. Preface to the Second Edition. Preface to the Third Edition

Various new observations about primes

Elementary Number Theory

Prime and Perfect Numbers

God may not play dice with the universe, but something strange is going on with the prime numbers.

The 98th Mathematics Colloquium Prague November 8, Random number theory. Carl Pomerance, Dartmouth College

Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations

Flat primes and thin primes

Contest Number Theory

SQUARE PATTERNS AND INFINITUDE OF PRIMES

Probabilistic Aspects of the Integer-Polynomial Analogy

Lecture 7. January 15, Since this is an Effective Number Theory school, we should list some effective results. x < π(x) holds for all x 67.

On the Fractional Parts of a n /n

The ranges of some familiar arithmetic functions

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.

CHAPTER 6. Prime Numbers. Definition and Fundamental Results

Theta Constants, Riemann Surfaces and the Modular Group

Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem

Analytic Number Theory

198 VOLUME 46/47, NUMBER 3

Contents. Preface xi. vii

Math 412: Number Theory Lecture 3: Prime Decomposition of

PRIME NUMBERS YANKI LEKILI

7. Prime Numbers Part VI of PJE

Sifting the Primes. Gihan Marasingha University of Oxford

ENTRY NUMBER THEORY. [ENTRY NUMBER THEORY] Authors: Oliver Knill: 2003 Literature: Hua, introduction to number theory.

M381 Number Theory 2004 Page 1

The Riemann Hypothesis

JEAN-MARIE DE KONINCK AND IMRE KÁTAI

Discrete Structures Lecture Primes and Greatest Common Divisor

Applications of Number Theory in Statistics

Partial Sums of Powers of Prime Factors

Heuristics for Prime Statistics Brown Univ. Feb. 11, K. Conrad, UConn

LTCC basic course: Analytic Number Theory. Andrew Granville

Euclid-Euler-Jiang Prime Theorem

A remark on a conjecture of Chowla

Euler s ϕ function. Carl Pomerance Dartmouth College

Some new representation problems involving primes

Carmichael numbers and the sieve

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively

Here is another characterization of prime numbers.

Results of modern sieve methods in prime number theory and more

MATH 310 Course Objectives

Proofs of the infinitude of primes

Perfect Power Riesel Numbers

On the number of co-prime-free sets. Neil J. Calkin and Andrew Granville *

The first dynamical system

1 Euler s idea: revisiting the infinitude of primes

Fermat numbers and integers of the form a k + a l + p α

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

Towards the Twin Prime Conjecture

An Introduction to Complex Function Theory

[Part 2] Asymmetric-Key Encipherment. Chapter 9. Mathematics of Cryptography. Objectives. Contents. Objectives

4 PRIMITIVE ROOTS Order and Primitive Roots The Index Existence of primitive roots for prime modulus...

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

A 1935 Erdős paper on prime numbers and Euler s function

The ranges of some familiar functions

Math 3336 Section 4.3 Primes and Greatest Common Divisors. Prime Numbers and their Properties Conjectures and Open Problems About Primes

Analytic number theory for probabilists

INTEGERS DIVISIBLE BY THE SUM OF THEIR PRIME FACTORS

Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem

#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC

GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT

An Introduction to Sieve Methods and Their Applications

ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM. 1. Introduction

CHEBYSHEV S BIAS AND GENERALIZED RIEMANN HYPOTHESIS

AN EQUATION INVOLVING ARITHMETIC FUNCTIONS AND RIESEL NUMBERS

THE FORMATION OF PRIME NUMBERS THE SOLUTION FOR GOLDBACH S CONJECTURES

On strings of consecutive economical numbers of arbitrary length

Modern Computer Algebra

CONTENTS. Preface Preliminaries 1

New bounds on gaps between primes

Rassias Conjecture. For any prime p with p>2therearetwoprimesp 1, p 2, with p 1 <p 2 such that p = p 1 + p 2 +1 p 1 . (1)

The ranges of some familiar arithmetic functions

Solutions to Problem Set 3 - Fall 2008 Due Tuesday, Sep. 30 at 1:00

Walsh Series and Transforms

New Perspectives. Functional Inequalities: and New Applications. Nassif Ghoussoub Amir Moradifam. Monographs. Surveys and

Proof of Infinite Number of Triplet Primes. Stephen Marshall. 28 May Abstract

Contradictions in some primes conjectures

Table of Contents. 2013, Pearson Education, Inc.

18.785: Analytic Number Theory, MIT, spring 2007 (K.S. Kedlaya) Brun s combinatorial sieve

ON THE AVERAGE RESULTS BY P. J. STEPHENS, S. LI, AND C. POMERANCE

Math 259: Introduction to Analytic Number Theory The Selberg (quadratic) sieve and some applications

Marcos J. González Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Sartenejas, Caracas, Venezuela

Primes and Factorization

On Legendre s formula and distribution of prime numbers

On the largest prime factor of the Mersenne numbers

Transcription:

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 ix Notation xiii Frequently Used Functions xvii Chapter 1. Preliminary Notions 1 1.1. Approximating a sum by an integral 1 1.2. The Euler-MacLaurin formula 2 1.3. The Abel summation formula 5 1.4. Stieltjes integrals 7 1.5. Slowly oscillating functions 8 1.6. Combinatorial results 9 1.7. The Chinese Remainder Theorem 10 1.8. The density of a set of integers 11 1.9. The Stirling formula 11 1.10. Basic inequalities 13 Problems on Chapter 1 15 Chapter 2. Prime Numbers and Their Properties 19 2.1. Prime numbers and their polynomial representations 19 2.2. There exist infinitely many primes 21 2.3. A first glimpse at the size of ir(x) 21 2.4. Fermat numbers 22 2.5. A better lower bound for 7r(a;) 24 iii

iv 2.6. The Chebyshev estimates 24 2.7. The Bertrand Postulate 29 2.8. The distance between consecutive primes 31 2.9. Mersenne primes 32 2.10. Conjectures on the distribution of prime numbers 33 Problems on Chapter 2 36 Chapter 3. The Riemann Zeta Function 39 3.1. The definition of the Riemann Zeta Function 39 3.2. Extending the Zeta Function to the half-plane cr > 0 40 3.3. The derivative of the Riemann Zeta Function 41 3.4. The zeros of the Zeta Function 43 3.5. Euler's estimate <(2) tt2/6 = 45 Problems on Chapter 3 48 Chapter 4. Setting the Stage for the Proof of the Prime Number Theorem 51 4.1. Key functions related to the Prime Number Theorem 51 4.2. A closer analysis of the functions 0(x) and i)j(x) 52 4.3. Useful estimates 53 4.4. The Mertens estimate 55 4.5. The Mobius function 56 4.6. The divisor function 58 Problems on Chapter 4 60 Chapter 5. The Proof of the Prime Number Theorem 63 5.1. A theorem of D. J. Newman 63 5.2. An application of Newman's theorem 65 5.3. The proof of the Prime Number Theorem 66 5.4. A review of the proof of the Prime Number Theorem 69 5.5. The Riemann Hypothesis and the Prime Number Theorem 70 5.6. Useful estimates involving primes 71 5.7. Elementary proofs of the Prime Number Theorem 72 Problems on Chapter 5 72 Chapter 6. The Global Behavior of Arithmetic Functions 75 6.1. Dirichlet series and arithmetic functions 75 6.2. The uniqueness of representation of a Dirichlet series 77

v 6.3. Multiplicative functions 79 6.4. Generating functions and Dirichlet products 81 6.5. Wintner's theorem 82 6.6. Additive functions 85 6.7. The average orders of w(n) and f2(n) 86 6.8. The average order of an additive function 87 6.9. The Erdos-Wintner theorem 88 Problems on Chapter 6 89 Chapter 7. The Local Behavior of Arithmetic Functions 93 7.1. The normal order of an arithmetic function 93 7.2. The Turan-Kubilius inequality 94 7.3. Maximal order of the divisor function 99 7.4. An upper bound for d(n) 101 7.5. Asymptotic densities 103 7.6. Perfect numbers 106 7.7. Sierpiriski, Riesel, and Romanov 106 7.8. Some open problems of an elementary nature 108 Problems on Chapter 7 109 Chapter 8. The Fascinating Euler Function 115 8.1. The Euler function 115 8.2. Elementary properties of the Euler function 117 8.3. The average order of the Euler function 118 8.4. When is <j)(n)a(n) a square? 119 8.5. The distribution of the values of <p{n)/n 121 8.6. The local behavior of the Euler function 122 Problems on Chapter 8 124 Chapter 9. Smooth Numbers 127 9.1. Notation 127 9.2. The smallest prime factor of an integer 127 9.3. The largest prime factor of an integer 131 9.4. The Rankin method 137 9.5. An application to pseudoprimes 141 9.6. The geometric method 145 9.7. The best known estimates on W(x,y) 146

vi 9.8. The Dickman function 147 9.9. Consecutive smooth numbers 149 Problems on Chapter 9 150 Chapter 10. The Hardy-Ramanujan and Landau Theorems 157 10.1. The Hardy-Ramanujan inequality 157 10.2. Landau's theorem 159 Problems on Chapter 10 164 Chapter 11. The abc Conjecture and Some of Its Applications 167 11.1. The abc conjecture 167 11.2. The relevance of the condition e > 0 168 11.3. The Generalized Fermat Equation 171 11.4. Consecutive powerful numbers 172 11.5. Sums of fc-powerful numbers 172 11.6. The Erdos-Woods conjecture 173 11.7. A problem of Gandhi 174 11.8. The k-abc conjecture 175 Problems on Chapter 11 176 Chapter 12. Sieve Methods 179 12.1. The sieve of Eratosthenes 179 12.2. The Brun sieve 180 12.3. Twin primes 184 12.4. The Brun combinatorial sieve 187 12.5. A Chebyshev type estimate 187 12.6. The Brun-Titchmarsh theorem 188 12.7. Twin primes revisited 190 12.8. Smooth shifted primes 191 12.9. The Goldbach conjecture 192 12.10. The Schnirelman theorem 194 12.11. The Selberg sieve 198 12.12. The Brun-Titchmarsh theorem from the Selberg sieve 201 12.13. The Large sieve 202 12.14. Quasi-squares 203 12.15. The smallest quadratic nonresidue modulo p 204 Problems on Chapter 12 206

I vii Chapter 13. Prime Numbers in Arithmetic Progression 217 13.1. Quadratic residues 217 13.2. The proof of the Quadratic Reciprocity Law 220 13.3. Primes in arithmetic progressions with small moduli 222 13.4. The Primitive Divisor theorem 224 13.5. Comments on the Primitive Divisor theorem 227 Problems on Chapter 13 228 Chapter 14. Characters and the Dirichlet Theorem 233 14.1. Primitive roots 233 14.2. Characters 235 14.3. Theorems about characters 236 14.4. L-series 240 14.5. L(l,x) is finite if x is a non-principal character 242 14.6. The nonvanishing of L(l, x): first step 243 14.7. The completion of the proof of the Dirichlet theorem 244 Problems on Chapter 14 247 Chapter 15. Selected Applications of Primes in Arithmetic Progression 251 15.1. Known results about primes in arithmetical progressions 251 15.2. Some Diophantine applications 254 15.3. Primes p with p squarefree 257 15.4. More applications of primes in arithmetic progressions 259 15.5. Probabilistic applications 261 Problems on Chapter 15 263 Chapter 16. The Index of Composition of an Integer 267 16.1. Introduction 267 16.2. Elementary results 268 16.3. Mean values of A and 1/A 270 16.4. Local behavior of A(n) 273 16.5. Distribution function of A(n) 275 16.6. Probabilistic results 276 Problems on Chapter 16 279 Appendix: Basic Complex Analysis Theory 281 17.1. Basic definitions 281

viii 17.2. Infinite products 283 17.3. The derivative of a function of a complex variable 284 17.4. The integral of a function along a path 285 17.5. The Cauchy theorem 287 17.6. The Cauchy integral formula 289 Solutions to Even-Numbered Problems 291 Solutions to problems from Chapter 1 291 Solutions to problems from Chapter 2 295 Solutions to problems from Chapter 3 303 Solutions to problems from Chapter 4 309 Solutions to problems from Chapter 5 312 Solutions to problems from Chapter 6 318 Solutions to problems from Chapter 7 321 Solutions to problems from Chapter 8 334 Solutions to problems from Chapter 9 338 Solutions to problems from Chapter 10 351 Solutions to problems from Chapter 11 353 Solutions to problems from Chapter 12 356 Solutions to problems from Chapter 13 377 Solutions to problems from Chapter 14 384 Solutions to problems from Chapter 15 392 Solutions to problems from Chapter 16 401 Bibliography 405 Index 413