Skip to content
The Continuum

Discrete Mathematics
— and why it matters.

Computers work in 0s and 1s. Discrete mathematics is the 0s and 1s of mathematics itself.

Mathematics Branch4 real-world applications · 5 connected topics
§01 · WHAT IT IS

A precise definition

Discrete mathematics studies mathematical structures that are fundamentally countable or finite — as opposed to continuous mathematics (calculus, analysis) which deals with the uncountably infinite real line. Its sub-fields include: combinatorics (counting), graph theory (networks), number theory (integers), logic (formal reasoning), coding theory (error correction), and combinatorial game theory.

§02 · WHY IT EXISTS

The problem it was invented to solve

The advent of digital computers in the 1940s demanded a mathematics of discrete, finite operations. Boolean algebra (Boole, 1854), graph theory (Euler, 1736), and combinatorics (centuries old) were unified into a coherent subject. Turing's work on computability (1936) and Shannon's information theory (1948) established the theoretical foundations — and discrete mathematics became the mathematical basis of computer science.

§03 · REAL APPLICATIONS

Where you find it in the world — including South Africa

These are not contrived textbook examples. Each application below is currently in use, driven by real institutions, and producing real outcomes.

Application 01

Network design: SA telecommunications infrastructure

Vodacom, MTN, Rain, and Telkom design their network topology using graph theory — modelling their infrastructure as a graph where nodes are base stations and edges are connections. Shortest-path algorithms (Dijkstra, Bellman-Ford) optimise routing. Network reliability under node failures is a graph theory result.

Application 02

Cryptography: RSA and elliptic curve encryption

All modern cryptography is discrete mathematics. RSA rests on the integer factorisation problem; elliptic curve cryptography rests on the discrete logarithm problem over finite fields. Every secure SA financial transaction is protected by a discrete mathematics result.

Application 03

P vs NP: the most important open problem in computer science

Does every problem whose solution can be quickly verified also have a quickly computable solution? If P = NP, every cryptographic system currently protecting SA banking would be breakable. If P ≠ NP (as most expect), it is a profound statement about the limits of efficient computation. Millennium Prize: $1,000,000.

Application 04

Scheduling and logistics: Transnet, SA airlines

Assigning trains to tracks, planes to gates, nurses to shifts — these are combinatorial optimisation problems (NP-hard in general). SA Airways and Transnet use heuristic algorithms from discrete mathematics to solve these problems approximately.

§04 · THE PRACTICAL REALITY

You've already encountered this

Every time your WhatsApp message arrives uncorrupted despite transmission errors, it's because a Reed-Solomon or similar error-correcting code (built on finite field arithmetic — discrete mathematics) detected and corrected the errors.

§05 · CONNECTIONS

Where it connects in the map of mathematics

§06 · EXPLORE FURTHER

Related topics and institutions

Discrete mathematics is the mathematics of the digital world.

The Continuum builds the combinatorial and number-theoretic thinking that makes discrete mathematics accessible — starting from the patterns and sequences in your CAPS curriculum.

No card required. South African curriculum. Grade 8–12.