Discrete Mathematics: Counting, Proof, Graphs, and Congruence

The mathematics of finite structures sits under most of computing, and it is usually absorbed in fragments rather than learned. This path builds four working tools: counting arrangements you could never enumerate, proving a claim for every input instead of the ones you tested, modelling relationships as graphs and reading what the structure permits, and doing arithmetic on a circle. Every result is tied to something engineers actually hit.