Exam 1, Mo Sep 20

integers, well ordering, proofs by induction

divisibility, gcd, Euclidean algorithm

primes, fundamental theorem, lcm

Exam 2, We Oct 13

linear Diophantine equations

congruences: modular arithmetic, linear congruences, Chinese remainder theorem

divisibility tests

Wilson's theorem

Exam 3, Mo Nov 8

Fermat's little theorem, Euler's theorem

pseudoprimes, Mersenne numbers

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

orders, property of orders

Exam 4, We Dec 8

primitive roots, discrete logarithms and index arithmetic

quadratic congruences, quadratic (non)residues

Legendre symbol, quadratic reciprocity