The Prime Number Theorem

Produktbeschreibung

At first glance the prime numbers appear to be distributed in a very irregular way amongst the integers, but it is possible to produce a simple formula that tells (in an approximate but well-defined sense) how many primes can be found that are less than any integer. The prime number theorem tells what this formula is and it is indisputably one of the the great classical theorems of mathematics. This textbook introduces the prime number theorem and is suitable for advanced undergraduates and beginning graduate students. The author deftly shows how analytical tools can be used in number theory to attack a 'real' problem. 

Inhaltsverzeichnis

Preface; 1. Foundations; 2. Some important Dirichlet series and arithmetic functions; 3. The basic theorems; 4. Prime numbers in residue classes: Dirichlet's theorem; 5. Error estimates and the Riemann hypothesis; 6. An 'elementary' proof of the prime number theorem; Appendices; Bibliography; Index. 

Kritik

'The entire exposition is extremely lucid, motivated and amply commentated throughout. With numerous examples illustrating the purely theoretical parts. Unquestionably, the book bespeaks the author's teaching skill and experience just as much as his gripping passion for this refined and fascinating topic. Altogether, this textbook is outstandingly suitable for both a course on prime number theory, at the upper-graduate level, and as a source for self-instruction ... Anyway, this text is a highly valuable enhancement of the existing literature on the subject which stands out by its particular user-friendliness.' Zentralblatt MATH