DAY  TOPIC  READING (Do before class) 
Assign. Out  Assign. In 
M1  Intros, Syllabus, Intro to Proof  HW
A Start HW #1 

W1  Proof Methods  1.1  1.9 (It's a lot, but try to do as much as you can) 
HW #1  HWA 
F1  WellOrdering Principle  2.12.4  
M2  Logic and Propositions  3.13.5  HW1  
W2  Propositions and
Equivalences Inclass exercises 
3.3  Start on HW 2 (Chapter 2, Section 3.1) 

F2  Quantifiers and Predicates  3.6  HW 2  
M3 
(More with) Proofs with Propositions and Predicates
Inclass exercises 
3.4  
W3  Work on
problems/Review for exam See Moodle for a practice exam 
4.1 


F3  EXAM 1 (During class time)  
M4  Sets  4.1  HW 3  
W4  Sequences, Functions  Sections 4.2, 4.3  
F4  Binary Relations, Equivalence Relations  Section 4.4, and additional readings from Rosen, found on Moodle  HW #4  HW 3 
M5  Induction  Sections 5.1, 5.2 
Work on Problems 5.3 and 5.5 from the text to go over in class on Wednesday  
W5  Strong Induction  Sections 5.2, 5.3,  
F5  No Class  Midquarter Break  HW 4  
M6  Recurrence Relations  Reading on Moodle

HW #5  
W6  Divisibility, GCDs, Prime Factorization  9.19.4 (skim over 9.3)  
F6  Modular Arithmetic  9.5  9.7  
HW 5 
M7  Inverses, Euler, RSA  9.89.11  
W7  Graphs, Walks, Paths Graph Theory Definitions 
10.110.2, 10.5  
F7  EXAM 2 (During class time)  
M8  Simple Graphs  12.112.3  
W8  Isomorphims, Bipartite graphs, Walks  12.4, 12.5, 12.7, 12.9  
F8  Coloring and Connectivity  12.6, 12.8, 12.10  
M9  Counting  15.115.3  
W9  Subsets, Repetition, Binomial Theorem  15.415.6  
F9  Poker, Pigeonhole, InclusionExclusion  15.715.10  
M10  Probability  17.117.5  
W10  Conditional Probability  18.118.3  
F10  Course Wrapup and review  
M11  Final Exam: MWF 1:20, Monday, 11/19, 6:30pm  9:00 pm  All
work due 