Elementary Number Theory takes an accessible approach to teaching students about the role of number theory in pure mathematics and its important applications to cryptography and other areas.
The first chapter of the book explains how to do proofs and includes a brief discussion of lemmas, propositions, theorems, and corollaries. The core of the text covers linear Diophantine equations; unique factorization; congruences; Fermat’s, Euler’s, and Wilson’s theorems; order and primitive roots; and quadratic reciprocity. The authors also discuss numerous cryptographic topics, such as RSA and discrete logarithms, along with recent developments.
The book offers many pedagogical features. The "check your understanding" problems scattered throughout the chapters assess whether students have learned essential information. At the end of every chapter, exercises reinforce an understanding of the material. Other exercises introduce new and interesting ideas while computer exercises reflect the kinds of explorations that number theorists often carry out in their research.
"This is a nice introduction to elementary number theory, designed for use in a basic undergraduate course. It can be used also for advanced high school students taking an accessible approach for an independent study. The book underlines the role of number theory in pure mathematics and its applications to cryptography and other areas."
—Zentralblatt MATH 1322
Introduction. Divisibility. Linear Diophantine Equations. Unique Factorization. Applications of Unique Factorization. Congruences. Fermat, Euler, Wilson. Cryptographic Applications. Order and Primitive Roots. More Cryptographic Applications. Quadratic Reciprocity. Primality and Factorization. Sums of Squares. Arithmetic Functions. Continued Fractions. Recent Developments. Appendices. Index.