| Date | Sec (7th/8th Edition) | Topic | (6th Edition) | Homework/Webwork due |
|---|
| LOGIC, PROOF TECHNIQUES, SETS, FUNCTIONS (EXAM I) |
| 1/20/21 | 1.1 | Propositional Logic | (1.1) | |
| 1.3 | Propositional Equivalences | (1.2) | |
| 1/22/21 | 1.4 | Predicates and Quantifiers | (1.3) | |
| 1.5 | Nested Quantifiers | (1.4) | |
| 1/25/21 | 1.7 | Introduction to Proofs | (1.6) | |
| 1/27/21 | Webwork (1.1/1.3) |
| 1/29/21 | 1.8 | Proof Methods and Strategy | (1.7) | |
| 2/01/21 | 2.1 | Sets | (2.1) | |
| 2/03/21 | 2.2 | Set Operations | (2.2) | Webwork (1.4/1.5) |
| 2/05/21 | 2.3 | Functions | (2.3) | |
| 2/07/21 | |
| 2/10/21 | 2.4 | Sequences and Summations | (2.4) | Webwork (2.1/2.2), Homework 1 |
| 2/12/21 | EXAM I | |
| 2/20/21 | No class: President's Day | |
| INTEGERS, INDUCTION, SEQUENCES/SUMMATIONS (EXAM II) |
| 2/17/21 | 4.1 | The Integers and Division | (3.4) | |
| 2/19/21 | 4.2 | Integers and Algorithms | (3.6) | |
| 2/22/21 | 4.3 | Primes and Greatest Common Divisors | (3.5) | |
| 2/24/21 | 4.4 | Applications of Number Theory | (3.7) | Webwork (2.3/2.4), Webwork (4.1/4.2) |
| 2/26/21 | 5.1 | Mathematical Induction | (4.1) | |
| 3/01/21 | |
| 5.2 | Strong Induction and Well-Ordering | (4.2) | |
| 3/03/21 | 6.1 | The Basics of Counting | (5.1) | Webwork (4.3/4.4) |
| 3/05/21 | EXAM II | |
| COUNTING, BINOMIAL THEOREM, RECURRENCE RELATIONS (EXAM III) |
| 3/08/21 | 6.2 | The Pigeonhole Principle | (5.2) | |
| 3/10/21 | 6.3 | Permutations and Combinations | (5.3) | Homework 2 |
| 3/12/21 | No Class: Mid-semester Reading Day |
| 3/15/21 | 6.4 | Binomial Coefficients | (5.4) | |
| 3/17/21 | Webwork (6.1/6.2) |
| 3/19/21 | 6.5 | Generalized Permutations and Combinations | (5.5) | |
| 3/22/21 | 5.3 | Recursive Definitions and Structural Induction | (4.3) | |
| 3/24/21 | 8.1 | Recurrence Relations | (7.1) | Webwork (6.3/6.4), Webwork (6.5) |
| 3/26/21 | 8.2 | Solving Recurrence Relations | (7.2) | |
| 3/29/21 | 10.1 | Graphs and Graph Models | (9.1) | |
| 3/31/21 | EXAM III | Webwork (5.3/8.1/8.2), Homework 3 |
| GRAPH THEORY AND RELATIONS (EXAM IV) |
| 4/02/21 | No Class: Easter Break |
| 4/05/21 |
| 4/07/21 | 10.2 | Graph Terminology and Special Types of Graphs | (9.2) | |
| 4/09/21 | 10.3 | Representing Graphs and Graph Isomorphism | (9.3) | |
| 4/12/21 | 10.4 | Connectivity | (9.4) | |
| 4/14/21 | 10.5 | Euler and Hamilton Paths | (9.5) | Webwork (10) |
| 4/16/21 | 10.7 | Planar Graphs | (9.7) | |
| 4/19/21 | 10.8 | Graph Coloring | (9.8) | |
| 4/21/21 | 11.1 | Introduction to Trees | (10.1) | Webwork (10 B) |
| 11.4 | Spanning Trees | (10.4) | |
| 11.5 | Minimum Spanning Trees | (10.5) | |
| 4/23/21 | 9.1 | Relations and Their Properties | (8.1) | |
| 9.3 | Representing Relations (Graphically and with Adjacency Matrices) | (8.3) | |
| 4/26/21 | 9.5 | Equivalence Relations | (8.5) | |
| 4/28/21 | | | | Webwork (Ch 11/9), Homework 4 |
| 4/30/21 | EXAM IV | |
| 5/6/21 | FINAL EXAM | |