Exam 1, Thu Feb 7

integers, well ordering, proofs by induction

divisibility, gcd, Euclidean algorithm

primes, fundamental theorem, lcm

Exam 2, Thu Mar 7

linear Diophantine equations

congruences: modular arithmetic, linear congruences, Chinese remainder theorem

divisibility tests

Wilson's theorem

Exam 3, Thu Apr 11

Fermat's little theorem, Euler's theorem

pseudoprimes, Mersenne numbers

multiplicative functions, φ, τ, σ, μ, Möbius inversion

basics about orders

Exam 4, Mon May 13

orders, primitive roots, index arithmetic

quadratic congruences, quadratic (non)residues

Legendre symbol, quadratic reciprocity