Discrete Math Essentials

A high-speed tour of proof, sets, counting, induction, relations, and the graph language that underlies discrete math and CS.

Topics on this path

1. Logical Connectives
2. Quantifiers
3. Set Operations
4. Direct Proof
5. Proof by Contrapositive
6. Counting Principles
7. Permutations & Combinations
8. Pigeonhole Principle
9. Induction
10. Relations
11. Graph Terminology & Representations
12. Trees