Lecture Schedule
Note: The section numbers refer to the course notes for the class. We may deviate from this schedule.
| Date | Topics | Sections/Notes | Remarks |
| May 3, 4/5, 6 | Proofs, Induction | 1.5, 1.6, 1.7 | Example proofs from 2.1 |
| May 10, 11/12, 13 | Strong induction, Recurrences | 1.7, 8.1 | |
| May 17, 18/19, 20 | Recursion: Exponentiation, Karatsuba multiplication | notes | |
| May 25/26, 27 | GCDs, Euclidean algorithm, Primes | 2.1, 2.3, 2.5, notes | UW holiday on May 24 |
| May 31, June 1/2, 3 | Modular arithmetic, Fermat Little Theorem | 2.5, 3.1, 4.1, notes | |
| June 7, 8/9, 10 | RSA cryptosystem | 5.2, notes | |
| June 14, 15/16, 17, 21 | Basic combinatorics | 6.1, 6.2, 6.3 | |
| June 22/23, 24, 28, 29/30 | Discrete Probability |
6.4,
|
|
| July 5, 6/7 |
|
|
UW holidays on July 1,2 |
| July 8, 12, 13/14 | Graphs | 9.1 | |
| July 15, 19, 20/21 | Paths, connectivity, trees | 9.3, 10.1, 10.2, 10.3 | |
| July 22, 26, 27 |
Eulerian graphs, |
notes | Lectures end on July 27 |