Atnaujinkite slapukų nuostatas

Multiplicative Number Theory I: Classical Theory [Minkštas viršelis]

(Pennsylvania State University), (University of Michigan, Ann Arbor)
  • Formatas: Paperback / softback, 572 pages, aukštis x plotis x storis: 229x152x32 mm, weight: 830 g
  • Serija: Cambridge Studies in Advanced Mathematics
  • Išleidimo metai: 26-Jul-2012
  • Leidėjas: Cambridge University Press
  • ISBN-10: 1107405823
  • ISBN-13: 9781107405820
Kitos knygos pagal šią temą:
  • Formatas: Paperback / softback, 572 pages, aukštis x plotis x storis: 229x152x32 mm, weight: 830 g
  • Serija: Cambridge Studies in Advanced Mathematics
  • Išleidimo metai: 26-Jul-2012
  • Leidėjas: Cambridge University Press
  • ISBN-10: 1107405823
  • ISBN-13: 9781107405820
Kitos knygos pagal šią temą:
Prime numbers are the multiplicative building blocks of natural numbers. Understanding their overall influence and especially their distribution gives rise to central questions in mathematics and physics. In particular, their finer distribution is closely connected with the Riemann hypothesis, the most important unsolved problem in the mathematical world. This book comprehensively covers all the topics met in first courses on multiplicative number theory and the distribution of prime numbers. The text is based on courses taught successfully over many years at the University of Michigan, Imperial College, London and Pennsylvania State University.

Prime numbers are the multiplicative building blocks of natural numbers. Understanding their overall influence and especially their distribution gives rise to central questions in mathematics and physics. The authors bring their extensive and distinguished research expertise to bear in preparing the student for intelligent reading of the more advanced research literature. The text, which is based on courses taught successfully over many years at Michigan, Imperial College and Pennsylvania State, is enriched by comprehensive historical notes and references as well as over 500 exercises.

Recenzijos

'The text is very well written and accessible to students. On many occasions the authors explicitly describe basic methods known to everyone working in the field, but too often skipped in textbooks. This book may well become the standard introduction to analytic number theory.' Zentralblatt MATH

Daugiau informacijos

A 2006 text based on courses taught successfully over many years at Michigan, Imperial College and Pennsylvania State.
Preface xi
List of notation
xiii
1 Dirichlet series: I
1(34)
1.1 Generating functions and asymptotics
1(10)
1.2 Analytic properties of Dirichlet series
11(8)
1.3 Euler products and the zeta function
19(12)
1.4 Notes
31(2)
1.5 References
33(2)
2 The elementary theory of arithmetic functions
35(41)
2.1 Mean values
35(11)
2.2 The prime number estimates of Chebyshev and of Mertens
46(8)
2.3 Applications to arithmetic functions
54(11)
2.4 The distribution of Ω(n) --- ω(n)
65(3)
2.5 Notes
68(3)
2.6 References
71(5)
3 Principles and first examples of sieve methods
76(32)
3.1 Initiation
76(6)
3.2 The Selberg lambda-squared method
82(7)
3.3 Sifting an arithmetic progression
89(2)
3.4 Twin primes
91(10)
3.5 Notes
101(3)
3.6 References
104(4)
4 Primes in arithmetic progressions: I
108(29)
4.1 Additive characters
108(7)
4.2 Dirichlet characters
115(5)
4.3 Dirichlet L-functions
120(13)
4.4 Notes
133(1)
4.5 References
134(3)
5 Dirichlet series: II
137(31)
5.1 The inverse Mellin transform
137(10)
5.2 Summability
147(15)
5.3 Notes
162(2)
5.4 References
164(4)
6 The Prime Number Theorem
168(31)
6.1 A zero-free region
168(11)
6.2 The Prime Number Theorem
179(13)
6.3 Notes
192(3)
6.4 References
195(4)
7 Applications of the Prime Number Theorem
199(45)
7.1 Numbers composed of small primes
199(16)
7.2 Numbers composed of large primes
215(5)
7.3 Primes in short intervals
220(8)
7.4 Numbers composed of a prescribed number of primes
228(11)
7.5 Notes
239(2)
7.6 References
241(3)
8 Further discussion of the Prime Number Theorem
244(38)
8.1 Relations equivalent to the Prime Number Theorem
244(6)
8.2 An elementary proof of the Prime Number Theorem
250(9)
8.3 The Wiener-Ikehara Tauberian theorem
259(7)
8.4 Beurling's generalized prime numbers
266(10)
8.5 Notes
276(3)
8.6 References
279(3)
9 Primitive characters and Gauss sums
282(44)
9.1 Primitive characters
282(4)
9.2 Gauss sums
286(9)
9.3 Quadratic characters
295(11)
9.4 Incomplete character sums
306(15)
9.5 Notes
321(2)
9.6 References
323(3)
10 Analytic properties of the zeta function and L-functions
326(32)
10.1 Functional equations and analytic continuation
326(19)
10.2 Products and sums over zeros
345(11)
10.3 Notes
356(1)
10.4 References
356(2)
11 Primes in arithmetic progressions: II
358(39)
11.1 A zero-free region
358(9)
11.2 Exceptional zeros
367(10)
11.3 The Prime Number Theorem for arithmetic progressions
377(9)
11.4 Applications
386(5)
11.5 Notes
391(2)
11.6 References
393(4)
12 Explicit formulae
397(22)
12.1 Classical formulae
397(13)
12.2 Weil's explicit formula
410(6)
12.3 Notes
416(1)
12.4 References
417(2)
13 Conditional estimates
419(33)
13.1 Estimates for primes
419(14)
13.2 Estimates for the zeta function
433(14)
13.3 Notes
447(2)
13.4 References
449(3)
14 Zeros
452(11)
14.1 General distribution of the zeros
452(4)
14.2 Zeros on the critical line
456(4)
14.3 Notes
460(1)
14.4 References
461(2)
15 Oscillations of error terms
463(23)
15.1 Applications of Landau's theorem
463(12)
15.2 The error term in the Prime Number Theorem
475(7)
15.3 Notes
482(2)
15.4 References
484(2)
APPENDICES
A The Riemann-Stieltjes integral
486(9)
A.1 Notes
492(1)
A.2 References
493(2)
B Bernoulli numbers and the Euler-MacLaurin summation formula
495(25)
B.1 Notes
513(4)
B.2 References
517(3)
C The gamma function
520(15)
C.1 Notes
531(2)
C.2 References
533(2)
D Topics in harmonic analysis
535(9)
D.1 Pointwise convergence of Fourier series
535(3)
D.2 The Poisson summation formula
538(4)
D.3 Notes
542(1)
D.4 References
542(2)
Name index 544(6)
Subject index 550