This book is a revised and greatly expanded version of our book Elements of Number Theory published in 1972. As with the first book the primary audience we envisage consists of upper level undergraduate mathematics majors and graduate students. We have assumed some familiarity with the material in a standard undergraduate course in abstract algebra. A large portion of Chapters 1-11 can be read even without such background with the aid of a small amount of supplementary reading. The later chapters assume some knowledge of Galois theory, and in Chapters 16 and 18 an acquaintance with the theory of complex variables is necessary. Number theory is an ancient subject and its content is vast. Any intro ductory book must, of necessity, make a very limited selection from the fascinat ing array of possible topics. Our focus is on topics which point in the direction of algebraic number theory and arithmetic algebraic geometry. By a careful selection of subject matter we have found it possible to exposit some rather advanced material without requiring very much in the way oftechnical background. Most of this material is classical in the sense that is was dis covered during the nineteenth century and earlier, but it is also modern because it is intimately related to important research going on at the present time.

This well-developed, accessible text details the historical development of the subject throughout. It also provides wide-ranging coverage of significant results with comparatively elementary proofs, some of them new. This second edition contains two new chapters that provide a complete proof of the Mordel-Weil theorem for elliptic curves over the rational numbers and an overview of recent progress on the arithmetic of elliptic curves.

This edition has been called ‘startlingly up-to-date’, and in this corrected second printing you can be sure that it’s even more contemporaneous. It surveys from a unified point of view both the modern state and the trends of continuing development in various branches of number theory. Illuminated by elementary problems, the central ideas of modern theories are laid bare. Some topics covered include non-Abelian generalizations of class field theory, recursive computability and Diophantine equations, zeta- and L-functions. This substantially revised and expanded new edition contains several new sections, such as Wiles' proof of Fermat's Last Theorem, and relevant techniques coming from a synthesis of various theories.

In a manner accessible to beginning undergraduates, An Invitation to Modern Number Theory introduces many of the central problems, conjectures, results, and techniques of the field, such as the Riemann Hypothesis, Roth's Theorem, the Circle Method, and Random Matrix Theory. Showing how experiments are used to test conjectures and prove theorems, the book allows students to do original work on such problems, often using little more than calculus (though there are numerous remarks for those with deeper backgrounds). It shows students what number theory theorems are used for and what led to them and suggests problems for further research. Steven Miller and Ramin Takloo-Bighash introduce the problems and the computational skills required to numerically investigate them, providing background material (from probability to statistics to Fourier analysis) whenever necessary. They guide students through a variety of problems, ranging from basic number theory, cryptography, and Goldbach's Problem, to the algebraic structures of numbers and continued fractions, showing connections between these subjects and encouraging students to study them further. In addition, this is the first undergraduate book to explore Random Matrix Theory, which has recently become a powerful tool for predicting answers in number theory. Providing exercises, references to the background literature, and Web links to previous student research projects, An Invitation to Modern Number Theory can be used to teach a research seminar or a lecture class.

Describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. A complete theoretical introduction is given for each subject, reducing prerequisites to a minimum. The detailed description of each algorithm allows immediate.

Elementary Number Theory and Its Applicationsis noted for its outstanding exercise sets, including basic exercises, exercises designed to help students explore key concepts, and challenging exercises. Computational exercises and computer projects are also provided. In addition to years of use and professor feedback, the fifth edition of this text has been thoroughly checked to ensure the quality and accuracy of the mathematical content and the exercises. The blending of classical theory with modern applications is a hallmark feature of the text. The Fifth Edition builds on this strength with new examples and exercises, additional applications and increased cryptology coverage. The author devotes a great deal of attention to making this new edition up-to-date, incorporating new results and discoveries in number theory made in the past few years.