Although it was in print for a short time only, the original edition of Multiplicative Number Theory had a major impact on research and on young mathematicians. By giving a connected account of the large sieve and Bombieri's theorem, Professor Davenport made accessible an important body of new discoveries. With this stimula tion, such great progress was made that our current understanding of these topics extends well beyond what was known in 1966. As the main results can now be proved much more easily. I made the radical decision to rewrite §§23-29 completely for the second edition. In making these alterations I have tried to preserve the tone and spirit of the original. Rather than derive Bombieri's theorem from a zero density estimate tor L timctions, as Davenport did, I have chosen to present Vaughan'S elementary proof of Bombieri's theorem. This approach depends on Vaughan's simplified version of Vinogradov's method for estimating sums over prime numbers (see §24). Vinogradov devised his method in order to estimate the sum LPH e(prx); to maintain the historical perspective I have inserted (in §§25, 26) a discussion of this exponential sum and its application to sums of primes, before turning to the large sieve and Bombieri's theorem. Before Professor Davenport's untimely death in 1969, several mathematicians had suggested small improvements which might be made in Multiplicative Number Theory, should it ever be reprinted.

A 2006 text based on courses taught successfully over many years at Michigan, Imperial College and Pennsylvania State.

Designed for precollege teachers by a collaborative of teachers, educators, and mathematicians, Famous Functions in Number Theory is based on a course offered in the Summer School Teacher Program at the Park City Mathematics Institute. But this book isn't a "course" in the traditional sense. It consists of a carefully sequenced collection of problem sets designed to develop several interconnected mathematical themes, and one of the goals of the problem sets is for readers to uncover these themes for themselves. Famous Functions in Number Theory introduces readers to the use of formal algebra in number theory. Through numerical experiments, participants learn how to use polynomial algebra as a bookkeeping mechanism that allows them to count divisors, build multiplicative functions, and compile multiplicative functions in a certain way that produces new ones. One capstone of the investigations is a beautiful result attributed to Fermat that determines the number of ways a positive integer can be written as a sum of two perfect squares. Famous Functions in Number Theory is a volume of the book series "IAS/PCMI-The Teacher Program Series" published by the American Mathematical Society. Each volume in that series covers the content of one Summer School Teacher Program year and is independent of the rest. Titles in this series are co-published with the Institute for Advanced Study/Park City Mathematics Institute. Members of the Mathematical Association of America (MAA) and the National Council of Teachers of Mathematics (NCTM) receive a 20% discount from list price.

This is a self-contained introduction to analytic methods in number theory, assuming on the part of the reader only what is typically learned in a standard undergraduate degree course. It offers to students and those beginning research a systematic and consistent account of the subject but will also be a convenient resource and reference for more experienced mathematicians. These aspects are aided by the inclusion at the end of each chapter a section of bibliographic notes and detailed exercises.

This textbook covers the main topics in number theory as taught in universities throughout the world. Number theory deals mainly with properties of integers and rational numbers; it is not an organized theory in the usual sense but a vast collection of individual topics and results, with some coherent sub-theories and a long list of unsolved problems. This book excludes topics relying heavily on complex analysis and advanced algebraic number theory. The increased use of computers in number theory is reflected in many sections (with much greater emphasis in this edition). Some results of a more advanced nature are also given, including the Gelfond-Schneider theorem, the prime number theorem, and the Mordell-Weil theorem. The latest work on Fermat's last theorem is also briefly discussed. Each chapter ends with a collection of problems; hints or sketch solutions are given at the end of the book, together with various useful tables.

A new edition of a classical treatment of elliptic and modular functions with some of their number-theoretic applications, this text offers an updated bibliography and an alternative treatment of the transformation formula for the Dedekind eta function. It covers many topics, such as Hecke’s theory of entire forms with multiplicative Fourier coefficients, and the last chapter recounts Bohr’s theory of equivalence of general Dirichlet series.