Oct 2: Exemplos of the Euclidean algorithm. Linear Diophantine equations.
Oct 4: Congruences.
Tutorial: No tutorial.
Oct 9: Modular inverses. Comments about midterm
test #1 and assignment #1.
Oct 11: Modular inverses (cont). Chinese remainder theorem.
Tutorial: Exercises: linear Diophantine equations,
congruences and Chinese remainder theorem.
Oct 16: Chinese remainder theorem (cont). Fermat's theorem.
Oct 18: Midterm test #1. [A1 handed in.]
Tutorial: Polynomial congruences and Lagrange's theorem.
Oct 23: Euler's Phi function. Euler's theorem.
Oct 25: Classical cryptosystems.
Tutorial: Solutions of Test #1. Modular exponentiation.