🌉 Discrete Math Without the Misery

🌉 Discrete Math Without the Misery

Calculus is the math of a ramp. Discrete math is the math of a staircase: things you can count one by one, with nothing in between. It's behind password strength, the route your package took, and why nobody could ever walk the seven bridges of Königsberg once each. This book shows how the pieces fit together.

WHAT'S INSIDE:

🗂️ Sets — collections with no repeats, and why a set of n things has 2ⁿ subsets

🚦 Logic basics — AND, OR, NOT and if-then, laid out in truth tables

🔑 Counting — the multiplication rule, and why a longer password beats a stranger one

🥇 Permutations vs. combinations — does order matter? Gold, silver and bronze vs. pizza toppings

🐦 The pigeonhole principle — why two people in London must have exactly the same number of hairs

🪆 Recursion — problems built from smaller copies, from Fibonacci to climbing stairs

🔗 Graphs — only the connections matter, and the seven bridges of Königsberg

🌳 Trees — graphs with no loops, and the cheapest way to link n places

⚠️ A "5 Common Mistakes" chapter — including reading if-then backwards

🧮 A Formulas & Quick Reference appendix, with a worked example

✏️ 10 fully worked examples with every step shown

✅ 11 practice problems with complete answers at the back

WHO THIS IS FOR:

Anyone who took discrete math and found a bag of puzzles with nothing holding them together. Anyone curious about the math behind passwords, networks and computer science.

No prior knowledge of discrete math required. 21 pages.