Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Introduction to Modern Prime Number Theory

Introduction to Modern Prime Number Theory

Introduction to Modern Prime Number Theory

T. Estermann, University of London
August 2011
Paperback
9780521168281
£41.99
GBP
Paperback

    This book was first published in 1952. It is largely devoted to the object of proving the Vinogradov-Goldbach theorem: that every sufficiently large odd number is the sum of three primes. In the course of proving this, T. Estermann, formerly Professor of Mathematics at the University of London, supplies numerous theories and results on characters and primes in arithmetic progressions. The author also ensures that the proofs presented to the reader are both clear and remarkably concise. The volume at hand addresses the Riemann zeta function, primes in arithmetical progression, and the ways in which odd numbers can be represented as the sum of three primes. At the end of the book is an index and a seven-page section of theorems and formulae for reference. This volume is both interesting and accessible, and will appeal to all with an enthusiasm for mathematics and problem solving.

    Reviews & endorsements

    'This book is a beautiful and short introduction to some basic techniques in analytic number theory presented in a style close to Landau's.' Franz Lemmermeyer, Zentralblatt MATH

    See more reviews

    Product details

    August 2011
    Paperback
    9780521168281
    86 pages
    216 × 140 × 5 mm
    0.12kg
    Available

    Table of Contents

    • Preface
    • Preface to the second impression
    • Remarks on notation
    • 1. The Riemann zeta function and a refinement of the prime number theorem
    • 2. The number of primes in an arithmetical progression
    • 3. The representations of an odd number as a sum of three primes
    • Theorems and formulae for reference.