Series · Mathematics

Discrete Mathematics

The structures underneath the algorithms — counting, graphs, order and induction — built up from first principles for people who write code.

3 of 6 parts published · 3 still to come

Mathematics18 Jul 2026

Counting without listing

Combinatorics is the art of knowing how many things there are without producing them. Four rules do almost all of the work, and the fourth is the one people get wrong.

Editorial9 min read

Mathematics12 Jul 2026

Induction is recursion, read backwards

Every recursive function you have written is a proof by induction you did not know you were writing. Seeing the correspondence makes both halves easier.

Editorial8 min read

Mathematics6 Jul 2026

Graphs are the default shape of everything

Trees, orders, dependencies, state machines and schedules are all graphs wearing different vocabularies. Learning the general object once beats learning five special cases.

Editorial10 min read

In preparation

3 further parts are planned for this series. Subscribe for updates.