Skip to content
LearnMathora

Topic · full course live

Discrete mathematics

The mathematics of steps, networks, and code.

Medium

Calculus studies smooth, continuous change. Discrete math studies things that come in whole pieces: yes/no decisions, network connections, countable arrangements. It's the native mathematics of computers — which can only ever count.

Your progress

4 lessons

Start course →

The big ideas

Logic is algebra on true and false

AND, OR, NOT follow laws as exact as arithmetic. Every circuit and every if-statement is built from them.

Graphs model relationships

Dots and connections — friendships, road maps, the internet. A shocking number of hard problems become walks on a graph.

Counting without listing

How many possible passwords? Poker hands? Routes? Combinatorics counts astronomically large sets with a few clean principles.

Induction climbs infinite ladders

Prove a fact for step one, prove each step hands you the next, and you've proven it for all infinity of them — recursion's mathematical twin.

The course — start at lesson one

  1. 01Logic & truthAND, OR, NOT — the algebra of yes and no.
  2. 02The art of countingPermutations, combinations, and numbers too big to list.
  3. 03Graphs & networksThe bridges of Königsberg and the math of connection.
  4. 04Recursion & inductionInfinity, climbed one ladder rung at a time.

Out in the world

Route finding

Maps apps run shortest-path algorithms on road graphs — discrete math, billions of times daily.

Cryptography

Online security rests on number theory: primes, modular arithmetic, and problems that are easy one way, hard backwards.

Databases & scheduling

Query planning, deadlock detection, and exam timetabling are all graph problems.

This topic connects to