
| 《解析数论导论(英文版)》 historical introduction chapter 1 the fundamental theorem of arithmetic 1.1 introduction 13 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 18 1.7 the euclidean algorithm 19 1.8 the greatest common divisor of more than two numbers 20 exercises for chapter ! 21 chapter 2 arithmetical functions and dirichlet multiplication 2.1 introduction 24 2.2 the mebius function mn) 24 2.3 the euler totient function 0(n) 25 2.4 a relation connecting (0 and it 26 2.5 a product formula for (n) 27 2.6 the dirichlet product of arithmetical functions 29 2.7 dirichlet inverses and the mebius inversion formula 30 .2.8 the mangoidt function a(n) 32 2.9 multiplicativefunctions 33 2.10 multiplicative functions and dirichlet multiplication 35 2.11 the inverse of a completely multiplicative function 36 2.12 liouville's function ).(.) 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 old{n} 57 3.6 the average order of the divisor functions a,(n) 60 3.7 the average order of(n) 61 3.8 an application to the distribution of lattice points visible from the origin 62 3.9 the average order of u(n) and of a(n) 64 3.10 the partial sums ora dirichlet product 65 3.11 applications to #(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 (x) and ,9(x) 75 4.3 relations connecting (x) and ri(x) 76 4.4 some equivalent forms of the prime number theorem 79 4.5 inequalities for ri(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 σpsx (i/p) 89 4.9 the partial sums of the m6bius 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 lot 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 110 5.4 reduced residue systems and the euler-fermat theorem il3 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 l ! 7 5.8 applications of the chinese remainder theorem il8 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 for chapter 5 126 chapter 6 finite abelian groups and their characters 6.1 definitions 129 6.2 examples of groups and subgroups 130 6.3 elementary properties of groups 130 6.4 construction of subgroups 131 6.5 characters of finite abelian groups 133 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(i, x) for real nonprincipal x l#l 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 150 7.5 proof of lemma 7.5 151 7.6 proof of lemma 7.6 152 7.7 proof of lemma 7.8 153 7.8 proof of lemma 7.7 153 7.9 distribution of primes in arithmetic progressions 154 exercises for chapter 7 155 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 8.3 ramanujan's sum and generalizations 160 8.4 multiplicative properties of the sums sk(n) 162 8.5 gauss sums associated with dirichlet characters 165 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 p61ya's inequality for the partial sums of primitive characters 173 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 (2]p) 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 200 exercisesfor chapter 9 201 chapter 10 primitive roots 10.1 the exponent ora 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 a ] 3 206 10.4 the existence of primitive roots mod p for odd primes p 206 10.5 primitive roots and quadratic residues 208 10.6 the existence of primitive roots mod p 208 10.7 the existence of primitive roots mod 2p 210 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 ora 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 lntegrai 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(0, z) 268 12.14 approximation of ζ(s, a) by finite sums 268 12.15 inequalities for iζ(s, a)l 270 12.16 inequalities for iζ(s)l and il(s, x)l 272 exercises for chapter 12 273 chapter 13 analytic proof of the prime number theorem 13.1 theplan of the proof 278 13.2 lemmas 279 13.3 a contour integral representation for ψ(x)/x2 283 13.4 upper bounds for ┃ζ(s)┃and iζ'(s)[ near the line a=1 284 13.5 the nonvanishing of ζ(s) on the line a=1 286 13.6 inequalities for ┃1//ζ(s) and ┃ζ'(s)ζ(s)┃ 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 functi6n 294 13.11 application to euler's totient 297 13.12 extension of pe1ya's inequality for character sums 299 exercises for chapter 13 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 |
商品评论(0条)