Discrete Math
|
There is no official textbook. Homework and exams are based on the course notes posted below.
Office Hours: TuWTh 3-4pm, via Zoom Here is the syllabus. | ||
| Here are the Course Notes | ||
|---|---|---|
| Item | Date | Information |
|
Homework 1 Solutions |
Thurs, Sept 8 |
Steiner's Problem Sums of Powers Induction Pascal's Triangle Binomial Theorem |
|
Homework 2 Solutions |
Thurs, Sept 22 |
Set Theory Logic Functions Binary Arithmetic Boolean Algebra |
|
Exam 1: Tues, Sept 27 Solutions | ||
|
Homework 3 Solutions |
Tues, Oct 18 |
The Well-Ordering Principle Division With Remainder Base b Arithmetic Euclidean Algorithm RSA Cryptosystem |
|
Homework 4 Solutions |
Tues, Nov 1 |
Choosing k Things from n Things Counting Arguments The Multinomial Theorem Newton's Binomial Theorem |
|
Exam 2: Thurs, Nov 3 Practice Exam Problems Harder Practice Problems Solutions | ||
|
Homework 5 Solutions |
Tues, Nov 22 |
Graph Definitions The Handshaking Lemma Connected Graphs Planar Graphs Bipartite Graphs Trees and Forests |
|
Exam 3: Tues, Dec 6 Practice Problems and Review More Practice Problems Solutions | ||