All section numbers are from Richmond and Richmond, A Discrete Transition to Advanced Mathematics, 2nd ed.
This table will grow as the semester progresses and more problem sets are assigned.
Click here for more homework rules.
| Reading, Videos, and Problem Sets | |||||
|---|---|---|---|---|---|
| Set Number |
Due | Sections to Read |
Videos to Watch |
Problem Sheet |
Solutions |
| 0 | Thu, Sep 4 | -- | -- | Homework 0 | N/A |
| 1 | Mon, Sep 8 | 1.1 |
Video 1: Combining more than two sets | Homework 1 | Solutions to Homework 1 |
| 2 | Wed, Sep 10 | 1.1, 1.2 |
Video 2: A Union Proof | Homework 2 | Solutions to Homework 2 |
| 3 | Fri, Sep 12 | 1.2, 1.3 |
Video 3: A Partition Proof | Homework 3 | Solutions to Homework 3 |
| 4 | Tue, Sep 16 | 1.4, 1.5 | -- | Homework 4 | Solutions to Homework 4 |
| 5 | Fri, Sep 19 | 1.6 |
Video 4: A Negated Quantifier Proof | Homework 5 | Solutions to Homework 5 |
| 6 | Tue, Sep 23 | 2.1 | -- | Homework 6 | Solutions to Homework 6 |
| 7 | Fri, Sep 26 | 2.1, 2.2 |
Video 5: Odds and Evens | Homework 7 | Solutions to Homework 7 |
| 8 | Wed, Oct 1 | 2.3, 3.1 |
Video 6: Bad Induction
Video 7: The Strong Pigeonhole Principle | Homework 8 | Solutions to Homework 8 |
| 9 | Fri, Oct 10 | 3.2, 3.3 |
Video 8: A GCD Theorem
Video 9: The Euclidean Algorithm | Homework 9 | |
| 10 | Fri, Oct 17 | 6.1 | Video 10: Exam 1 Proof Review | Homework 10 | |