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.

This basic introduction to number theory is ideal for those with no previous knowledge of the subject. The main topics of divisibility, congruences, and the distribution of prime numbers are covered. Of particular interest is the inclusion of a proof for one of the most famous results in mathematics, the prime number theorem. With many examples and exercises, and only requiring knowledge of a little calculus and algebra, this book will suit individuals with imagination and interest in following a mathematical argument to its conclusion.

Number theory was once famously labeled the queen of mathematics by Gauss. The multiplicative structure of the integers in particular deals with many fascinating problems some of which are easy to understand but very difficult to solve. In the past, a variety of very different techniques has been applied to further its understanding. Classical methods in analytic theory such as Mertens’ theorem and Chebyshev’s inequalities and the celebrated Prime Number Theorem give estimates for the distribution of prime numbers. Later on, multiplicative structure of integers leads to multiplicative arithmetical functions for which there are many important examples in number theory. Their theory involves the Dirichlet convolution product which arises with the inclusion of several summation techniques and a survey of classical results such as Hall and Tenenbaum’s theorem and the Möbius Inversion Formula. Another topic is the counting integer points close to smooth curves and its relation to the distribution of squarefree numbers, which is rarely covered in existing texts. Final chapters focus on exponential sums and algebraic number fields. A number of exercises at varying levels are also included. Topics in Multiplicative Number Theory introduces offers a comprehensive introduction into these topics with an emphasis on analytic number theory. Since it requires very little technical expertise it will appeal to a wide target group including upper level undergraduates, doctoral and masters level students.

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.

"This book is the first volume of a two-volume textbook for undergraduates and is indeed the crystallization of a course offered by the author at the California Institute of Technology to undergraduates without any previous knowledge of number theory. For this reason, the book starts with the most elementary properties of the natural integers. Nevertheless, the text succeeds in presenting an enormous amount of material in little more than 300 pages."-—MATHEMATICAL REVIEWS

This textbook offers a unique exploration of analytic number theory that is focused on explicit and realistic numerical bounds. By giving precise proofs in simplified settings, the author strategically builds practical tools and insights for exploring the behavior of arithmetical functions. An active learning style is encouraged across nearly three hundred exercises, making this an indispensable resource for both students and instructors. Designed to allow readers several different pathways to progress from basic notions to active areas of research, the book begins with a study of arithmetic functions and notions of arithmetical interest. From here, several guided “walks” invite readers to continue, offering explorations along three broad themes: the convolution method, the Levin–Faĭnleĭb theorem, and the Mellin transform. Having followed any one of the walks, readers will arrive at “higher ground”, where they will find opportunities for extensions and applications, such as the Selberg formula, Brun’s sieve, and the Large Sieve Inequality. Methodology is emphasized throughout, with frequent opportunities to explore numerically using computer algebra packages Pari/GP and Sage. Excursions in Multiplicative Number Theory is ideal for graduate students and upper-level undergraduate students who are familiar with the fundamentals of analytic number theory. It will also appeal to researchers in mathematics and engineering interested in experimental techniques in this active area.

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.

This valuable book focuses on a collection of powerful methods of analysis that yield deep number-theoretical estimates. Particular attention is given to counting functions of prime numbers and multiplicative arithmetic functions. Both real variable (?elementary?) and complex variable (?analytic?) methods are employed. The reader is assumed to have knowledge of elementary number theory (abstract algebra will also do) and real and complex analysis. Specialized analytic techniques, including transform and Tauberian methods, are developed as needed.Comments and corrigenda for the book are found at http: //www.math.uiuc.edu/ diamond/