Prime number theorem
Material type:
- 0521891108 (PB)

Current library | Home library | Call number | Materials specified | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | 511.11 JAM (Browse shelf(Opens below)) | Available | 50402 |
Includes index
Includes bibliography (p. 249-250) and references
Contents
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
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 us (in an approximate but well defined sense) how many primes we can expect to find that are less than any integer we might choose.
There are no comments on this title.