| Dates | Topics | Recommended reading | Notes |
|---|---|---|---|
| May 4, 6, 8 | Course logistics, logic, quantifiers | 1.1, 1.2, 1.3 | No tutorial this week |
| May 11, 13, 15 | Proof techniques, mathematical induction | 1.5, 1.6, 1.7 | |
| May 20, 22 | Divisibility, the greatest common divisor, Euclid's algorithm | 2.1, 2.3 | No class on May 18 (Victoria Day) |
| May 25, 27, 29 | Extended Euclidean algorithm, properties of the GCD | 2.3 | |
| June 1, 3, 5 | Linear diophantine equations, prime numbers | 2.4, 2.5 | |
| June 8, 10, 12 | Congruences and their properties, rules for divisibility | 3.1, 3.2 | |
| June 15, 17, 19 | Solving linear congruences, Chinese remainder theorem | 3.3, 3.4 | Midterm on June 17 |
| June 22, 24, 26 | Fermat's little theorem, private-key cryptography | 4.1, 5.1 | |
| June 29, July 3 | RSA cryptosystem | 5.2 | No class on July 1 (Canada Day) |
| July 6, 8, 10 | RSA, permutations, subsets, the binomial theorem | 5.2, 6.1, 6.2 | |
| July 13, 15, 17 | Graphs, paths and cycles, connectivity | 9.1, 9.3, 10.1 | |
| July 20, 22, 24 | Trees | 10.2, 10.3, 10.4 | |
| July 27 | Planarity | 11.1, 11.3 | Last lecture |
Note that this schedule is subject to change as the course progresses.