Introductory Number Theory
Patterns, Proofs, and Primes
A first course in number theory
An illustrated path from the Euclidean algorithm and unique factorization through continued fractions, modular arithmetic, Fermat's little theorem, groups, binomial divisibility, and Chebyshev's estimate for the primes.