- Provides full coverage of all traditional number theory topics, along with cryptography
- Includes "Check Your Understanding" sections that offer a tutorial approach
- Presents the building blocks first, gradually increasing the level of difficulty

*Solutions manual available upon qualifying course adoption*

Number theory has a rich history. For many years it was one of the purest areas of pure mathematics, studied because of the intellectual fascination with properties of integers. More recently, it has been an area that also has important applications to subjects such as cryptography. **An Introduction to Number Theory with Cryptography** presents number theory along with many interesting applications. Designed for an undergraduate-level course, it covers standard number theory topics and gives instructors the option of integrating several other topics into their coverage. The "Check Your Understanding" problems aid in learning the basics, and there are numerous exercises, projects, and computer explorations of varying levels of difficulty.

**Introduction**Diophantine Equations

Modular Arithmetic

Primes and the Distribution of Primes

Cryptography

Euclid's Theorem

Euclid's Original Proof

The Sieve of Eratosthenes

The Division Algorithm

The Greatest Common Divisor

The Euclidean Algorithm

Other Bases

Linear Diophantine Equations

The Postage Stamp Problem

Fermat and Mersenne Numbers

Chapter Highlights

Problems

The Fundamental Theorem of Arithmetic

Euclid and the Fundamental Theorem of Arithmetic

Chapter Highlights

Problems

Irrationality Proofs

The Rational Root Theorem

Pythagorean Triples

Differences of Squares

Prime Factorization of Factorials

The Riemann Zeta Function

Chapter Highlights

Problems

Modular Exponentiation

Divisibility Tests

Linear Congruences

The Chinese Remainder Theorem

Fractions mod m

Fermat's Theorem

Euler's Theorem

Wilson's Theorem

Queens on a Chessboard

Chapter Highlights

Problems

Shift and Affine Ciphers

Secret Sharing

RSA

Chapter Highlights

Problems

Polynomials Mod Primes

Solutions Modulo Prime Powers

Composite Moduli

Chapter Highlights

Problems

Primitive Roots

Decimals

Card Shuffling

The Discrete Log Problem

Existence of Primitive Roots

Chapter Highlights

Problems

Coin Flipping over the Telephone

Mental Poker

The ElGamal Public Key Cryptosystem

Digital Signatures

Chapter Highlights

Problems

Computing Square Roots Mod p

Quadratic Equations

The Jacobi Symbol

Proof of Quadratic Reciprocity

Chapter Highlights

Problems

Primality Testing Factorization

Coin Flipping over the Telephone

Chapter Highlights

Problems

Sums of Two Squares

Sums of Four Squares

Pell's Equation

Chapter Highlights

Problems

Perfect Numbers

Multiplicative Functions

Chapter Highlights

Problems

Basic Theory

Rational Numbers

Periodic Continued Fractions

Square Roots of Integers

Some Irrational Numbers

Chapter Highlights

Problems

Gaussian Irreducibles

The Division Algorithm

Unique Factorization

Applications

Chapter Highlights

Problems

Algebraic Integers

Units

Z[√-2]

Z[√3]

Non-unique Factorization

Chapter Highlights

Problems

Bertrand's Postulate

Chebyshev's Approximate Prime Number Theorem

Chapter Highlights

Problems

Elliptic Curves

Modularity

**Supplementary Topics **Geometric Series

Mathematical Induction

Pascal’s Triangle and the Binomial Theorem

Fibonacci Numbers

Problems

**Answers and Hints for Odd-Numbered Exercises**Index

"… provides a fine history of number theory and surveys its applications. College-level undergrads will appreciate the number theory topics, arranged in a format suitable for any standard course in the topic, and will also appreciate the inclusion of many exercises and projects to support all the theory provided. In providing a foundation text with step-by-step analysis, examples, and exercises, this is a top teaching tool recommended for any cryptography student or instructor."

—California Bookwatch, January 2014