Basics

After the introduction of the well-ordering axiom and the principle of mathematical induction, the topics being covered include the Euclidean algorithm, the Chinese remainder theorem, and the fundamental theorem of arithmetic. There are also the theorems of Lagrange, Dirichlet, Thue, and Aubry, and an explanation on how \(a^{b}\) (mod n) can be evaluated efficiently.