🔢 Discrete Mathematics
Based on Oscar Levin's Discrete Mathematics: An Open Introduction, licensed CC BY-SA 4.0.
Counting, sequences, logic, and graphs. The toolkit that sits underneath algorithms, combinatorics, and formal verification.
| Chapter | |||
|---|---|---|---|
| 1. | Counting | Additive and multiplicative principles, binomial coefficients, stars and bars, inclusion-exclusion | 🔢 |
| 2. | Sequences | Arithmetic and geometric sequences, recurrence relations, and proof by induction | 🔢 |
| 3. | Symbolic Logic | Propositional connectives, predicates, quantifiers, and the structure of proofs | 🔢 |
| 4. | Graph Theory | Graphs, trees, planarity, coloring, and Euler/Hamilton paths | 🔢 |
| 5. | Additional Topics | Matching, Ramsey theory, and generating functions | 🔢 |
📺 Video lectures: MIT 6.042J Mathematics for Computer Science
Neighbors
- 🔑 Logic — symbolic logic is one of the five chapters
- ✎ Proofs — induction and set theory appear in both
- ⚙ Algorithms — graph theory connects directly to graph algorithms
- 🔐 Cryptography — number theory and modular arithmetic underlie most crypto