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