Readings are from the textbook.

This schedule is only tentative. We may need to make adjustments as we move through the term.

Week	Topics	Readings	Lecture Notes	Tutorial Problems	Study Problems	Notes and Extras
Week 1 Aug 24-28	Logic	1.1-1.7, 1.10 chapter 2	Week 1	No Tutorial	math prerequisites logic	No tutorial on Monday and Thursday is a lecture
Week 2 Aug 31-Sep 4	Proofs	Chapter 3	Week 2	Week 2 Problems	proofs	first tutorial Monday and lecture Thursday
Week 3 Sep 7-11	Number Theory	Chapter 4.1-4.11	Week 3	Labor Day	number theory	No tutorial Monday for labor day first examlet Thursday
Week 4 Sep 14-18	Modular Arithmetic Sets	4.12-4.14 chapter 5	Week 3	Week 4 Problems	modular arithmetic set theory
Week 5 Sep 21-25	Functions	chapters 7 and 8				Exam 2 Thursday
Week 6 Sep 28-Oct 2	Collections of sets Graphs	chapter 9 chapter 10 (except 10.3)
Week 7 Oct 5-9	2-way bounding Contradiction	chapter 11, 18				Exam 3
Week 8 Oct 12-16	Induction	1.8-1.9; chapter 12
Week 9 Oct 19-23	Recursive Definition	chapter 13				Exam 4
Week 10 Oct 26-30	Trees Grammars	chapter 14 (not 14.6)
Week 11 Nov 2-6	Big-O Inequality proofs	chapter 15				Exam 5
Week 12 Nov 9-13	Algorithms	14.6, chapter 16
Week 13 Nove 16-20	NP State Diagrams Regular Expressions	1.9, chapters 17, 19				Exam 6
Fall break Nov 21-29	Break!			Break!
Week 14 Nov 30-Dec 4	Countability	chapter 20
Week 15 Dec 7-9	Applications of Uncountability Wrap-up	---			---	Reading Day is Thursday
Finals Week Dec 11-17	Our final date TBD