Methods in number theory / Melvyn B. Nathanson

This is the Springer International Edition.

Includes bibliographical references and index.

Cover -- Preface -- Notation and Conventions -- Table of Contents -- 1. Divisibility and Primes -- 2. Congruences -- 3. Primitive Roots and Quadratic Reciprocity -- 4. Fourier Analysis on Finite Abelian Groups -- 5. The abc Conjecture -- 6. Arithmetic Functions -- 7. Divisor Functions -- 8. Prime Numbers -- 9. The Prime Number Theorem -- 10. Primes in Arithmetic Progressions -- 11. Waring's Problem -- 12. Sums of Sequences of Polynomials -- 13. Liouville's Identity -- 14. Sums of an Even Number of Squares -- 15. Partition Asymptotics -- 16. An Inverse Theorem for Partitions References.

Elementary Methods in Number Theory begins with "a first course in number theory" for students with no previous knowledge of the subject. The main topics are divisibility, prime numbers, and congruences. There is also an introduction to Fourier analysis on finite abelian groups, and a discussion on the abc conjecture and its consequences in elementary number theory. In the second and third parts of the book, deep results in number theory are proved using only elementary methods. Part II is about multiplicative number theory, and includes two of the most famous results in mathematics: the Erds-Selberg elementary proof of the prime number theorem, and Dirichlets theorem on primes in arithmetic progressions. Part III is an introduction to three classical topics in additive number theory: Warings problems for polynomials, Liouvilles method to determine the number of representations of an integer as the sum of an even number of squares, and the asymptotics of partition functions. Melvyn B. Nathanson is Professor of Mathematics at the City University of New York (Lehman College and the Graduate Center). He is the author of the two other graduate texts: Additive Number Theory: The Classical Bases and Additive Number Theory: Inverse Problems and the Geometry of Sumsets.