Introduction to Analytic Number Theory by Tom M. Apostol, ISBN-13: 978-1441928054

Introduction to Analytic Number Theory by Tom M. Apostol, ISBN-13: 978-1441928054

[PDF eBook eTextbook]

• Publisher: ‎ Springer (December 1, 2010)
• Language: ‎ English
• 352 pages
• ISBN-10: ‎ 1441928057
• ISBN-13: ‎ 978-1441928054

“This book is the first volume of a two-volume textbook for undergraduates and is indeed the crystallization of a course offered by the author at the California Institute of Technology to undergraduates without any previous knowledge of number theory. For this reason, the book starts with the most elementary properties of the natural integers. Nevertheless, the text succeeds in presenting an enormous amount of material in little more than 300 pages. The presentation is invariably lucid and the book is a real pleasure to read.”

―MATHEMATICAL REVIEWS

“After reading Introduction to Analytic Number Theory one is left with the impression that the author, Tom M. Apostal, has pulled off some magic trick. … I must admit that I love this book. The selection of topics is excellent, the exposition is fluid, the proofs are clear and nicely structured, and every chapter contains its own set of … exercises. … this book is very readable and approachable, and it would work very nicely as a text for a second course in number theory.” (Álvaro Lozano-Robledo, The Mathematical Association of America, December, 2011)

Table of Contents:

Chapter 1
The Fundamental Theorem of Arithmetic
1.1 Introduction I 3
1.2 Divisibility 14
1.3 Greatest common divisor 14
1.4 Prime numbers 16
1.5 The fundamental theorem of arithmetic 17
1.6 The series of reciprocals of the primes I 8
1.7 The Euclidean algorithm 19
1.8 The greatest common divisor of more than two numbers 20
Exercises for Chapter I 21
Chapter 2
Arithmetical Functions and Dirichlet Multiplication
2.1 Introduction 24
2.2 The Mobius function JL(n) 24
2.3 The Euler totient function cp(n) 25
2.4 A relation connecting cp and Jl 26
2.5 A product formula for cp(n) 27
2.6 The Dirichlet product of arithmetical functions 29
2.7 Dirichlet inverses and the Mobius inversion formula 30
2.8 The Mangoldt function A(n) 32
2.9 Multiplicative functions 33
2.10 Multiplicative functions and Dirichlet multiplication 35
2.11 The inverse of a completely multiplicative function 36
2.12 Liouville’s function l.(n) 37
2.13 The divisor functions a,(n) 38
2.14 Generalized convolutions 39
2.15 Formal power series 41
2.16 The Bell series of an arithmetical function 42
2.17 Bell series and Dirichlet multiplication 44
2.18 Derivatives of arithmetical functions 45
2.19 The Selberg identity 46
Exercises for Chapter 2 46
Chapter 3
Averages of Arithmetical Functions
3.1 Introduction 52
3.2 The big oh notation. Asymptotic equality of functions 53
3.3 Euler’s summation formula 54
3.4 Some elementary asymptotic formulas 55
3.5 The average order of d(n) 57
3.6 The average order of the divisor functions a,(n) 60
3.7 The average order of cp(n) 61
3.8 An application to the distribution of lattice points visible from the origin 62
3.9 The average order of J.t(n) and of A(n) 64
3.10 The partial sums of a Dirichlet product 65
3.11 Applications to J.t(n) and A(n) 66
3.12 Another identity for the partial sums of a Dirichlet product 69
Exercises for Chapter 3 70
Chapter 4
Some Elementary Theorems on the Distribution of Prime
Numbers
4.1 Introduction 74
4.2 Chebyshev’s functions t/J(x) and ,9(x) 75
4.3 Relations connecting 9(x) and n(x) 76
4.4 Some equivalent forms of the prime number theorem 79
4.5 Inequalities for n(n) and Pn 82
4.6 Shapiro’s Tauberian theorem 85
4.7 Applications of Shapiro’s theorem 88
4.8 An asymptotic formula for the partial sums Lpsx (1/p) 89
4.9 The partial sums of the Mobius function 91
4.10 Brief sketch of an elementary proof of the prime number theorem 98
4.11 Selberg’s asymptotic formula 99
Exercises for Chapter 4 101
Chapter 5
Congruences
5.1 Definition and basic properties of congruences 106
5.2 Residue classes and complete residue systems 109
5.3 Linear congruences I 10
5.4 Reduced residue systems and the Euler-Fermat theorem 113
5.5 Polynomial congruences modulo p. Lagrange’s theorem 114
5.6 Applications of Lagrange’s theorem 115
5.7 Simultaneous linear congruences. The Chinese remainder theorem 117
5.8 Applications of the Chinese remainder theorem 118
5.9 Polynomial congruences with prime power moduli 120
5.10 The principle of cross-classification 123
5.11 A decomposition property of reduced residue systems 125
Exercises/or Chapter 5 /26
Chapter 6
Finite Abelian Groups and Their Characters
6.1 Definitions /29
6.2 Examples of groups and subgroups 130
6.3 Elementary properties of groups 130
6.4 Construction of subgroups /31
fi.5 Characters of finite abelian groups I 33
6.6 The character group 135
6.7 The orthogonality relations for characters 136
6.8 Dirichlet characters 137
6.9 Sums involving Dirichlet characters 140
6.10 The nonvanishing of L(l. x) for real nonprincipal x 141
Exercises for Chapter 6 143
Chapter 7
Dirichlet’s Theorem on Primes in Arithmetic Progressions
7.1 Introduction 146
7.2 Dirichlet’s theorem for primes of the form 4n – I and 4n + I 147
7.3 The plan of the proof of Dirichlet’s theorem 148
7.4 Proof of Lemma 7.4 /50
7.5 Proof of Lemma 7.5 /51
7.6 Proof of Lemma 7.6 15 2
7.7 Proof of Lemma 7.8 153
7.8 Proof of Lemma 7.7 /53
7.9 Distribution of primes in arithmetic progressions /54
Exercises for Chapter 7 /55
Chapter 8
Periodic Arithmetical Functions and Gauss Sums
8.1 Functions periodic modulo k 157
8.2 Existence of finite Fourier series for periodic arithmetical functions 158
lU Ramanujan’s sum and generalizations 160
8.4 Multiplicative properties of the sums sk(n) 162
8.5 Gauss sums associated with Dirichlet characters /65
8.6 Dirichlet characters with nonvanishing Gauss sums 166
8.7 Induced moduli and primitive characters 167
8.8 Further properties of induced moduli 168
8.9 The conductor of a character 171
8.10 Primitive characters and separable Gauss sums 171
8.11 The finite Fourier series of the Dirichlet characters 172
8.12 Polya ‘s inequality for the partial sums of primitive characters 17 3
Exercises for Chapter 8 175
Chapter 9
Quadratic Residues and the Quadratic Reciprocity Law
9.1 Quadratic residues 178
9.2 Legendre’s symbol and its properties 179
9.3 Evaluation of (-lip) and (21p) 181
9.4 Gauss’lemma 182
9.5 The quadratic reciprocity law 185
9.6 Applications of the reciprocity law 186
9.7 The Jacobi symbol 187
9.8 Applications to Diophantine equations 190
9.9 Gauss sums and the quadratic reciprocity law 192
9.10 The reciprocity law for quadratic Gauss sums 195
9.11 Another proof of the quadratic reciprocity law 2UO
Exercises for Chapter 9 201
Chapter 10
Primitive Roots
10.1 The exponent of a number mod m. Primitive roots 204
10.2 Primitive roots and reduced residue systems 205
10.3 The nonexistence of primitive roots mod 2″ for oc ;;:: 3 206
10.4 The existence of primitive roots mod p for odd primes p 206
10.5 Primitive roots and quadratic residues 208
I 0.6 The existence of primitive roots mod p’ 208
10.7 The existence of primitive roots mod 2p” 2 JO
10.8 The nonexistence of primitive roots in the remaining cases 211
10.9 The number of primitive roots mod m 212
10.10 The index calculus 213
10.11 Primitive roots and Dirichlet characters 218
10.12 Real-valued Dirichlet characters mod p• 220
10.13 Primitive Dirichlet characters mod p• 221
Exercises for Chapter 10 222
Chapter 11
Dirichlet Series and Euler Products
11.1 Introduction 224
11.2 The half-plane of absolute convergence of a Dirichlet series 225
11.3 The function defined by a Dirichlet series 226
11.4 Multiplication of Dirichlet series 228
11.5 Euler products 230
11.6 The half-plane of convergence of a Dirichlet series 232
11.7 Analytic properties of Dirichlet series 234
11.8 Dirichlet series with nonnegative coefficients 236
11.9 Dirichlet series expressed as exponentials of Dirichlet series 238
11.10 Mean value formulas for Dirichlet series 240
11.11 An integral formula for the coefficients of a Dirichlet series 242
11.12 An integral formula for the partial sums of a Dirichlet series 243
Exercises for Chapter II 246
Chapter 12
The Functions ‘(s) and L(s, x)
12.1 Introduction 249
12.2 Properties of the gamma function 250
12.3 Integral representation for the Hurwitz zeta function 251
12.4 A contour integral representation for the Hurwitz zeta function 253
12.5 The analytic continuation of the Hurwitz zeta function 254
12.6 Analytic continuation of ((s) and L(s, x) 255
12.7 Hurwitz’s formula for ((s, a) 256
12.8 The functional equation for the Riemann zeta function 259
12.9 A functional equation for the Hurwitz zeta function 261
12.10 The functional equation for L-functions 261
12.11 Evaluation of ((- n, a) 264
12.12 Properties of Bernoulli numbers and Bernoulli polynomials 265
12.13 Formulas for L(O, xl 268
12.14 Approximation of ((s, a) by finite sums 268
12.15 Inequalities for l((s, a) I 270
12.16 Inequalities for l((s)l and IL(s, xll 272
Exercises for Chapter 12 27 3
Chapter 13
Analytic Proof of the Prime Number Theorem
13.1 The plan of the proof 278
13.2 Lemmas 279
13.3 A contour integral representation for ljJ 1(x)/x2 283
13.4 Upper bounds for l((s)l and l(‘(s)l near the line u = 1 284
13.5 The nonvanishing of ((s) on the line u = 1 286
13.6 Inequalities for 11/((s)l and l(‘(s)/((s)l 287
13.7 Completion of the proof of the prime number theorem 289
13.8 Zero-free regions for ((s) 291
13.9 The Riemann hypothesis 293
13.10 Application to the divisor function 294
13.11 Application to Euler’s totient 297
13.12 Extension of Polya ‘s inequality for character sums 299
Exercises for Chapter I 3 300
Chapter 14
Partitions
14.1 Introduction 304
14.2 Geometric representation of partitions 307
14.3 Generating functions for partitions 308
14.4 Euler’s pentagonal-number theorem 311
14.5 Combinatorial proof of Euler’s pentagonal-number theorem 313
14.6 Euler’s recursion formula for p(n) 315
14.7 An upper bound for p(n) 316
14.8 Jacobi’s triple product identity 318
14.9 Consequences of Jacobi’s identity 321
14.10 Logarithmic differentiation of generating functions 322
14.11 The partition identities of Ramanujan 324
Exercises for Chapter 14 325
Bibliography 329
Index of Special Symbols 333
Index 335

TOM M. APOSTOL, Emeritus Professor at the California Institute of Technology, is the author of several highly regarded texts on calculus, analysis, and number theory, and is Director of Project MATHEMATICS!, a series of computer-animated mathematics videotapes.

What makes us different?

• Instant Download

• Always Competitive Pricing

• 100% Privacy

• FREE Sample Available

• 24-7 LIVE Customer Support