| Time | Class content | Section covered | Remarks | R August 30 | Introduction; Set theory | 1.1-1.6 | hw1 | T Sept 4 | Logic | 2.1-2.4 | Truth table and puzzle problems | R Sept 6 | Quantifier statements | 2.10, 7.2 | hw2 | T Sept 11 | Method of Proofs | 3.1-3.2, 4.4-4.6 | R Sept 13 | Proof by Contrdictions | 3.3, 5.1-5.4 | hw3 | T Sept 18 | Induction-1 | 6.1-6.2 | two examples | R Sept 20 | Induction-2 | 6.3-6.4 | hw4 | T Sept 25 | Divisibility and Division Theorem | 11.1-11.2 | R Sept 27 | GCD and Euclidean Algorithm | 11.3-11.4 | hw5 | T Oct 2 | Relative prime integers | 11.5 | R Oct 4 | Fundamental Theorem of Arithmetic | 11.6 | T Oct 9 | Congruence modulo n | 8.5, 8.6 | R Oct 11 | Test 1 | everything covered so far | T Oct 16 | no class (Fall break) | R Oct 18 | Relations and equivalence relations-1 | 8.1-8.3 | T Oct 23 | Relations and equivalence relations-2 | 8.4 | hw6 | R Oct 25 | functions-1 | 9.1, 9.3 | T Oct 30 | functions-2 | 9.4, 9.5 | hw7 | R Nov 1 | functions-3 | 9.6 | T Nov 6 | function-4 | 9.2, 9.7 | hw8 | R Nov 8 | finite sets and permutations | 9.2, 9.7 | hw9 | T Nov 13 | denumerable sets | 10.1-10.2 | hw10 | R Nov 15 | Uncountable sets | 10.3 | how to count infinity (video) | T Nov 20 | Test 2 | everything covered after Test 1 | R Nov 22 | thanksgiving break | no class | T Nov 27 | Cardinalities of sets | 10.4 | R Nov 29 | Cater-Schroder-Berstein Theorem | 10.5 | hw11 | T Dec 4 | limit of functions | R Dec 6 | final review | Wednesday Dec 12 | Final Exam: 2pm--5pm Location: TBD |