0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Number theory

Buy Now

Introduction to Modern Prime Number Theory (Paperback) Loot Price: R1,252
Discovery Miles 12 520
Introduction to Modern Prime Number Theory (Paperback): T. Estermann

Introduction to Modern Prime Number Theory (Paperback)

T. Estermann

 (sign in to rate)
Loot Price R1,252 Discovery Miles 12 520 | Repayment Terms: R117 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

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.

General

Imprint: Cambridge UniversityPress
Country of origin: United Kingdom
Release date: August 2011
First published: April 2011
Authors: T. Estermann
Dimensions: 216 x 140 x 5mm (L x W x T)
Format: Paperback - Trade
Pages: 86
ISBN-13: 978-0-521-16828-1
Categories: Books > Science & Mathematics > Mathematics > Number theory > General
Promotions
LSN: 0-521-16828-7
Barcode: 9780521168281

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners