Lectures
Lecture 9 (Contrapositive) Typed Written Notes
Lecture 10 (Contradiction) Typed Written Notes
In Lecture 11, there is a mistake in the written notes. I argue that 0 < m-n < 1. However, the lower bound could be as bad as -1. This would give that m=n which is a contradiction. This is fixed in the typed notes
Lecture 11 (Division Algorithm, uniqueness, injections, surjections) Typed Written Notes
Lecture 12 (Random Proofs) Typed Written Notes