DAY  TOPIC  READING  Assign. Out  Assign. In 
M1  Syllabus, Start Truth vs. Validity  1.1 to 1.3 

W1  Propositional Logic and its Applications  1.2  HW 1 (1.11.2)  
F1  Propositional Equivalences  1.3  
M2  Quantifiers  1.4, 1.5  HW1 (new date)  
W2  Rules of Inference  1.6  HW 2 (1.4 and 1.5)  
F2  Proofs and Proof Strategies  1.7, 1.8  
M3  Sets and Set Operations  2.1 and 2.2  HW 3  HW 2 
W3  Cartesian product, Relations, and Functions  2.3 


F3  EXAM 1 (During class time)  
M4  Set
Cardinality Counting Summation and Product notation 
Finish reading Chapter 2  
W4  Sequences  HW 4  HW3  
F4  Finish Chapter
2 Review for Exam 2 (Chapter 2) 

M5 
Algorithms from a mathematical
viewpoint Complexity of algorithms 
3.1, 3.2  HW 5  
W5  Divisibility and Modular Arithmetic  4.1  
F5  No Class  Midquarter Break  HW 4  
M6  Modular arithmetic and Security  slides on moodle


W6  RSA Security  
F6  Exam 2 (Chapters 2 and 3)  


M7  Introduction to Proof by Induction  5.1, 5.2  HW6 Practice 5.1  
W7  Proof by Induction Examples  
F7  Weak/Strong
Induction Wrap up Recursive Structure 
5.3, 5.4  HW 5 new due date  
M8  Counting (chapter 6)  6.1, 6.2  HW 7  HW5 
W8  Binomial Theorem  6.3, 6.4  HW 6  
F8  Finish Chapter
6 Exam 3 Security and Induction 
6.5  
M9  Corollaries to the Binomial Theorem  
W9  Probability Expected Values 
7.1, 7.2  Monty Hall  
F9  Graph Theory  Definitions Chapt. 11 
HW7  
M10  Weighted Graphs and Spanning Trees.  
W10  Class Topics and review  
F10  Course Wrapup and review  
M11  Final Exam: MWF 1:20, Sunday, 11/19, 3:30pm  6:00 pm  All
work due 