Discrete and Combinatorial Mathematics

MATH 132 is your introduction to thinking discretely rather than continuously — instead of limits and derivatives, you learn to count carefully, reason about integers and divisibility, and prove things by induction. Expect weekly problem sets and two written midterms plus a final where you'll work through counting arguments, solve recurrences with generating functions, and analyze relations and graphs. It's the mathematical backbone for CS courses like algorithms, data structures, and cryptography, so the techniques you build here will keep resurfacing for years.