All official documents can be found on LEARN . Please be sure to check LEARN daily for up to date announcements, errata and files including an up-to-date version of the course notes, sample exams, assignments and their solutions.
Below are both typed version and the hand written versions of the notes. The typed version are intended to be a typed version of the hand written notes (but might contain typos). The handwritten notes were notes I used for my Fall 2015 classes. I've also included a typed version of all notes as well as all the handouts I used in class. A zip package of all the files is also available if you would like to reproduce these.
Lecture 2 (Statements and (in)equality proofs) Typed Written Notes
Lecture 3 (Truth Tables) Typed Written Notes
Lecture 4 (Divisibility) Typed Written Notes
Lecture 5 (Divisibility of Integer Combinations and Intro to Sets) Typed Written Notes
Lecture 6 (Sets) Typed Written Notes
Lecture 7 (Quantifiers) Typed Written Notes
Lecture 8 (Negating and Nesting Quantifiers) Typed Written Notes
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
Lecture 13 (Induction) Typed Written Notes
Lecture 14 (Strong Induction) Typed Written Notes
Lecture 15 (More Induction) Typed Written Notes
Lecture 16 (End of Induction, Fundamental Theorem of Arithmetic, GCD Intro) Typed Written Notes
Lecture 17 (GCD Introduction, GCD With Remainders) Typed Written Notes
Lecture 18 (Euclidean Algorithm, Back Substitution, Bezout's Theorem ,Euclid's Lemma) Typed Written Notes
Lecture 19 (Fundamental Theorem of Arithmetic, GCDCT) Typed Written Notes
Note: Lectures 20 and 21 might be swapped. I prefer doing EEA on midterm day.
Lecture 20 (Extended Euclidean Algorithm) Typed Written Notes
Lecture 21 (GCD Properties) (Thanks Amy!) Typed Written Notes
Lecture 22 (DFPF (Divisors from prime factorization) and GCDPF) Typed Written Notes
Lecture 23 (Linear Diophantine Equations Part 1) Typed Written Notes
Lecture 24 (Linear Diophantine Equations Part 2 and Congruences Introduction) Typed Written Notes
Lecture 25 (Congruences Part 1 [Properties]) Typed Written Notes
Lecture 26 (Congruences Part 2 [Divisibility, Division and CISR]) Typed Written Notes
Lecture 27 (Linear Congruences) Typed Written Notes
Lecture 28 (Integers Modulo m) Typed Written Notes
Lecture 29 (Inverses and FLT) Typed Written Notes
Lecture 30 (More FLT and CRT) Typed Written Notes
Lecture 31 (More CRT and Splitting the Modulus) Typed Written Notes
Lecture 32 (Splitting the Modulus and Introduction to Cryptography) Typed Written Notes
Lecture 33 (RSA) Typed Written Notes
Lecture 34 (Introduction to Complex Numbers) Typed Written Notes
Lecture 35 (Complex Number Arithmetic and Conjugates) Typed Written Notes
Lecture 36 (Modulus and Polar Coordinates) Typed Written Notes
Lecture 37 (Polar Multiplication and De Moivre's Theorem) Typed Written Notes
Lecture 38 (More De Moivre's Theorem and Complex Exponentials) Typed Written Notes
Lecture 39 (Complex nth Roots) Typed Written Notes
Lecture 40 (Introduction to Polynomials) Typed Written Notes
Lecture 41 (Division Algorithm for Polynomials, Remainder Theorem, Factor Theorem(s)) Typed Written Notes
Lecture 42 (Fundamental Theorem of Algebra) Typed Written Notes
Lecture 43 (Rational Roots Theorem) Typed Written Notes
Lecture 44 (Conjugate Roots Theorem, Real Quadratic Factors and Real Factorization) Typed Written Notes