Maths Research Through Time – A Timeline of Significant Mathematical Advances
This timeline traces 48 major ideas across nearly 4,000 years of mathematical history, grouped into five eras. Each entry explains roughly when the idea first appeared, the people behind it, why it still matters today, and a concrete example — and a few of the most important ones include a deeper “Advanced Detail” box for readers who want to go further.
Ancient World
Before 500 CEPythagorean Theorem
The theorem states that in a right triangle, the square of the hypotenuse equals the sum of the squares of the other two sides: a² + b² = c². It is traditionally credited to Pythagoras of Samos and the religious brotherhood he founded around 500 BCE, although Babylonian clay tablets show the relationship was already known and used in practical surveying more than a thousand years earlier. Euclid later gave the theorem a rigorous geometric proof in Book I of the Elements, cementing it as one of the first results in mathematics established by formal deduction rather than measurement alone. Today it remains the foundation of trigonometry, navigation, and countless engineering calculations that depend on right-angled triangles.
Why it matters: It helps you find a missing side of a right triangle.
For example, a 6-8-10 triangle works too: 6² + 8² = 36 + 64 = 100 = 10².
The Rearrangement Proof
A full visual, interactive proof of why a² + b² = c² — including a drag-and-drop demonstration you can try yourself — is available on our Fun Maths Facts page.
Babylonian Base-60 System
The Babylonians of ancient Mesopotamia developed a sophisticated positional numeral system based on 60 rather than 10, recorded in wedge-shaped cuneiform marks pressed into wet clay tablets. Sixty was likely chosen because it divides evenly by 2, 3, 4, 5, 6, 10, 12, 15, 20, and 30 — far more divisors than 10 — which made fractions, trade calculations, and land division much easier to handle without a written decimal point. Scribes used this system for everything from astronomical record-keeping to tracking loans, wages, and harvests, and some of the oldest surviving multiplication and reciprocal tables in existence come from this civilisation. Its influence never disappeared: it survives directly in how we still divide an hour into 60 minutes and a minute into 60 seconds, and a circle into 360 degrees.
Why it matters: It is why we still use 60 seconds in a minute today.
It’s also why a full circle has 360 degrees — 360 is 6×60, a number the Babylonians found easy to divide many ways.
Euclid’s Elements
Written in Alexandria around 300 BCE, the Elements is a thirteen-book compilation that organised almost all Greek geometric and number-theoretic knowledge into a single, rigorous logical structure. Euclid began from just five postulates and a handful of common notions, then built hundreds of theorems from them alone using strict step-by-step deduction, setting the template for mathematical proof that is still used today. It covers plane geometry, the theory of proportions, number theory (including a proof that there are infinitely many primes), and the construction of the five Platonic solids. For over two thousand years it was the standard textbook for teaching geometry, and it remains one of the most widely printed and studied books in history, shaping how mathematics is taught to this day.
Why it matters: It set the rules for how we prove ideas in maths.
It starts from just five simple assumptions, called axioms, and builds hundreds of theorems from them alone.
Chinese Remainder Theorem
First recorded in the Chinese mathematical text Sunzi Suanjing (Master Sun’s Mathematical Manual), thought to date from around the 3rd to 5th century CE, the theorem shows how to reconstruct a number uniquely from its remainders when divided by several smaller numbers that share no common factors. Ancient Chinese military commanders are said to have used a version of this trick to count soldiers quickly, having them line up in rows of different sizes and reading off the leftover remainders each time. Beyond its origins as a puzzle-solving technique, the theorem became a cornerstone of modern number theory and underpins fast algorithms in computer science, including methods used to speed up certain RSA encryption calculations. Crucially, it guarantees not just that a solution exists, but exactly how far apart every repeated solution will be.
Why it matters: It helps solve number puzzles with several clues at once.
For example, if a number leaves remainder 2 when divided by 3 and remainder 3 when divided by 5, the smallest such number is 8 — and the theorem guarantees the next one is exactly 15 higher, at 23.
Solving It Step by Step
List numbers that satisfy the second clue (remainder 3 when divided by 5): 3, 8, 13, 18, 23…
Now check each one against the first clue (remainder 2 when divided by 3): 3 ÷ 3 leaves remainder 0 (no). 8 ÷ 3 leaves remainder 2 (yes!).
So x = 8 is the smallest solution. Because 3 and 5 share no common factors, the theorem guarantees solutions repeat every 3 × 5 = 15 numbers — so 8, 23, 38, 53… are all valid, and no other whole number is.
Aryabhata’s Approximation of Pi
In his 499 CE treatise the Aryabhatiya, the Indian astronomer-mathematician Aryabhata gave the value of pi as approximately 62,832/20,000, which simplifies to 3.1416 — accurate to four decimal places. He arrived at this by inscribing polygons inside a circle and calculating their perimeters, the same core geometric idea the Greek mathematician Archimedes had used roughly seven centuries earlier on the other side of the world. Aryabhata explicitly noted that his value was an approximation rather than an exact ratio, showing an unusually modern awareness that pi cannot be written as a simple fraction, centuries before this was formally proven. His work on trigonometry, place-value notation, and astronomy also laid groundwork that later spread through the Islamic world into medieval Europe.
Why it matters: It gave an early, very accurate value for pi.
His method used the perimeter of an inscribed polygon, the same core idea Archimedes used centuries earlier in Greece.
Medieval & Islamic Golden Age
500 – 1500 CEIslamic Golden Age Algebra
Working in the House of Wisdom in Baghdad around 820 CE, the Persian scholar Muhammad ibn Musa al-Khwarizmi wrote a treatise usually known by its shortened title, al-Jabr, which systematically classified and solved linear and quadratic equations using words rather than symbols. His method of “al-jabr” (restoring, or moving a term across to the other side of an equation) gave algebra both its name and its first genuinely general, step-by-step technique, rather than the case-by-case recipes earlier civilisations had relied on. The Latin form of his own name, Algoritmi, is also the direct root of the modern word “algorithm.” His work was translated into Latin in the 12th century and went on to become the standard European algebra textbook for several hundred years.
Why it matters: It gave us step-by-step ways to solve equations.
The word “algebra” comes directly from the Arabic “al-jabr” in the title of his book.
Fibonacci Sequence
The Italian mathematician Leonardo of Pisa, better known as Fibonacci, introduced the sequence to European readers in his 1202 book Liber Abaci, using it to model an admittedly unrealistic growing population of rabbits. Each number in the sequence is the sum of the two before it — 1, 1, 2, 3, 5, 8, 13, 21… — and the pattern turns up repeatedly in nature, from the spiral arrangement of sunflower seeds to the branching of trees and the segments of a pineapple. Liber Abaci mattered for another reason too: it was one of the first European texts to introduce Hindu-Arabic numerals, the familiar 0–9 digits with place value, to a continent still wrestling with cumbersome Roman numerals for everyday calculation. As the sequence grows, the ratio between consecutive terms converges towards the golden ratio, approximately 1.618, a proportion long associated with pleasing visual design.
Why it matters: This pattern shows up in flowers, shells, and even pinecones.
The ratio between consecutive terms (like 21/13 or 34/21) gets closer and closer to the golden ratio, about 1.618.
Renaissance & Scientific Revolution
1500 – 1700 CEDescartes’ Cartesian Geometry
In an appendix to his 1637 philosophical work Discourse on the Method, titled La Géométrie, René Descartes introduced the idea of describing geometric shapes using pairs of numbers plotted against two perpendicular axes. This fused two previously separate branches of mathematics: algebra, which manipulates symbols and equations, and geometry, which studies shapes and space. Suddenly a curve like a circle or a parabola could be written as an equation, and any equation could be visualised as a shape on a graph — a two-way translation that underpins calculus, physics, computer graphics, and data visualisation ever since. The coordinate grid is still called the Cartesian plane in his honour, and every x-axis and y-axis on every graph traces its ancestry back to this single idea.
Why it matters: It lets us draw equations as lines on a graph.
It’s why we still say “x-axis” and “y-axis” today, and why every point on a graph gets an (x, y) address.
Complex Numbers
Complex numbers first appeared not from abstract curiosity but from a very practical problem: 16th-century Italian mathematicians such as Gerolamo Cardano and Rafael Bombelli found that the standard formula for solving cubic equations sometimes required taking the square root of a negative number, even when the final answer was a perfectly ordinary real one. Rather than discard the method, they pressed on and treated these “imaginary” square roots as legitimate intermediate steps, discovering that the troublesome terms cancelled out neatly by the end of the calculation. A complex number combines a real part and an imaginary part built from i, defined as the square root of −1, and is usually written in the form a + bi. Long dismissed as a mere mathematical trick, complex numbers turned out to be essential for describing alternating electrical current, quantum mechanics, and modern signal processing.
Why it matters: They let us solve equations that have no ordinary answer.
They combine a real part and an “imaginary” part built from i, the square root of −1.
Pascal’s Triangle
Although named after the French mathematician Blaise Pascal, who published a systematic treatise on it in 1654, the triangular arrangement of numbers was already known centuries earlier to Chinese, Persian, and Indian mathematicians, including Yang Hui in China around 1261. Each number in the triangle is formed by adding the two numbers diagonally above it, with every row starting and ending in a 1, and the resulting values are exactly the coefficients that appear when a binomial expression like (x + y)⁴ is expanded. Pascal used the triangle to build a rigorous foundation for probability theory, corresponding with Pierre de Fermat to work out the odds of different outcomes in games of chance. Beyond probability, the triangle also encodes combinations — how many ways a smaller group can be chosen from a larger set — and connects to fractal patterns such as Sierpiński’s triangle when its odd and even numbers are shaded differently.
Why it matters: It makes it easy to work out chances and combinations.
Each row also sums to a power of 2 — row 4 (1, 4, 6, 4, 1) adds up to 16, which is 2⁴.
Why Each Number Is What It Is
Every entry in Pascal’s Triangle is a binomial coefficient, and there’s a clean combinatorial proof for why each one equals the sum of the two above it. We walk through the full proof on our Fun Maths Facts page.
Probability Theory
Probability theory as a formal mathematical discipline began with a real gambling dispute: the French nobleman Antoine Gombaud, known as the Chevalier de Méré, asked how to fairly divide the stake of a game of dice that had to be abandoned partway through. In 1654, Pascal and Fermat exchanged a series of letters working out the correct answer, effectively inventing the mathematics of expected outcomes and equally likely events along the way. Their approach showed that probability could be treated as precise, calculable numbers rather than vague guesswork, laying the groundwork for insurance, actuarial science, and modern statistics. The field was later placed on fully rigorous mathematical footing in the 20th century by the Russian mathematician Andrey Kolmogorov, using set theory and axioms in much the same spirit as Euclid had used for geometry two thousand years earlier.
Why it matters: It measures how likely something is to happen.
It began with a very practical question: how should two gamblers fairly split the stake if their game is interrupted early?
Newton’s Laws of Motion
Isaac Newton published his three laws of motion in 1687 in Philosophiæ Naturalis Principia Mathematica (Mathematical Principles of Natural Philosophy), widely regarded as one of the most important scientific works ever written. The first law states that an object stays at rest or in constant motion unless a force acts on it; the second, F = ma, relates force, mass, and acceleration in a single precise equation; and the third states that every action has an equal and opposite reaction. Together with the law of universal gravitation, published in the same book, these laws explained everyday motion on Earth and the orbits of the planets using one unified mathematical framework for the first time in history. Newton also developed calculus, independently of the German mathematician Gottfried Leibniz, specifically because the mathematics of his day was not yet powerful enough to describe continuously changing motion.
Why it matters: It explains why and how things move the way they do.
His second law, F = ma, is still the standard tool engineers use to calculate forces today.
Calculus
Calculus was developed independently in the 1660s and 1670s by Isaac Newton in England and Gottfried Wilhelm Leibniz in Germany, sparking a bitter priority dispute between their respective supporters that lasted for decades afterwards. It provides two complementary tools: differentiation, which finds the instantaneous rate at which something is changing (such as the exact speed of a car at one moment), and integration, which adds up infinitely many tiny pieces to find a total (such as the total distance travelled from a changing speed). The two operations turn out to be inverses of one another, a connection now known as the Fundamental Theorem of Calculus. Calculus became the mathematical language of physics and engineering, describing everything from planetary orbits and the flow of heat to the smooth curves used in modern computer-aided design.
Why it matters: It measures how things change, from speed to growth.
It gives us two key tools: differentiation (finding rates of change, like speed) and integration (finding totals, like distance travelled).
Enlightenment & the 19th Century
1700 – 1900 CEBernoulli’s Principle
The Swiss mathematician Daniel Bernoulli published the principle in his 1738 book Hydrodynamica, showing that within a steadily flowing fluid, an increase in the speed of the fluid occurs together with a decrease in its pressure. The result follows from applying the conservation of energy to a moving fluid: as the fluid speeds up, more of its energy is tied up in motion and correspondingly less is available as pressure. It explains why aeroplane wings are shaped so that air travels faster over the curved top surface than the flatter bottom, creating a pressure difference that generates lift. The same principle explains why a shower curtain gets pulled inward when the water is running, and why a spinning ball can curve unexpectedly through the air.
Why it matters: It explains why aeroplane wings create lift.
It’s the same principle that helps a shower curtain get sucked inward when the water is running.
Euler’s Identity
Named after the prolific Swiss mathematician Leonhard Euler, who explored the relationship in his 1748 work Introductio in analysin infinitorum, the identity eiπ + 1 = 0 links five of the most fundamental constants in all of mathematics: 0, 1, e (the base of natural logarithms), i (the imaginary unit), and π. It emerges as a special case of Euler’s formula, eiθ = cos(θ) + i·sin(θ), which connects exponential growth to circular motion through the complex plane — one of the deepest and most unexpected bridges in all of mathematics. The physicist Richard Feynman famously called it “the most remarkable formula in mathematics,” and it is regularly voted the most beautiful equation ever discovered in polls of professional mathematicians. Despite its elegance, it has genuine practical uses in electrical engineering and signal processing, wherever oscillating quantities are described using complex exponentials.
Why it matters: It links five of the most important numbers in maths.
It connects 0, 1, e, i, and π — five of the most important numbers in all of mathematics — in one short equation.
Where the Identity Comes From
Euler’s formula states that for any real number θ, eiθ = cos(θ) + i·sin(θ) — linking exponentials to circular motion via the complex plane.
Now plug in θ = π (a half-turn): cos(π) = −1 and sin(π) = 0, so eiπ = −1 + i(0) = −1.
Rearranging gives eiπ + 1 = 0 — Euler’s identity, connecting five fundamental constants in a single equation.
Gaussian Elimination
Although it takes its modern name from the German mathematician Carl Friedrich Gauss, who used and refined the method around the turn of the 19th century, the underlying technique for systematically solving simultaneous linear equations was already described in the Chinese mathematical text Jiuzhang Suanshu (The Nine Chapters on the Mathematical Art) roughly two thousand years earlier. The method works by combining rows of a system of equations — adding, subtracting, or scaling them — to eliminate one unknown variable at a time until only a single equation with a single unknown remains, which can then be solved and substituted back through the rest. It became especially important with the rise of computing, since it can be turned into a precise, repeatable sequence of steps that a computer can execute even for systems involving hundreds or thousands of equations at once. Today it underpins structural engineering calculations, economic modelling, and the way computer graphics software solves for how light reflects off multiple surfaces in a scene.
Why it matters: It is a simple step-by-step way to solve many equations at once.
It works by combining rows of a system of equations to eliminate variables one at a time, until only one unknown is left.
A Worked Example
Take two equations: 2x + y = 5, and x − y = 1.
Add them together, and y cancels out completely: 3x = 6, so x = 2.
Substitute back into the second equation: 2 − y = 1, so y = 1. Gaussian elimination formalises this same idea — combine rows to cancel variables one at a time — so it works cleanly even with dozens of equations at once.
Non-Euclidean Geometry
For over two thousand years after Euclid, mathematicians tried and failed to prove his fifth postulate (that through a point not on a line, exactly one parallel line can be drawn) from his other four, simpler axioms. In the 1820s and 1830s, working independently, the Hungarian János Bolyai, the Russian Nikolai Lobachevsky, and Gauss himself all realised that assuming the postulate was false led not to contradictions but to entirely new, internally consistent geometries. On the curved surface of a sphere, for instance, every “straight line” is a great circle, no two of which are ever parallel, and the angles of a triangle drawn on the surface add up to more than 180°. What began as a purely abstract exercise in questioning a single axiom became, decades later, exactly the mathematical toolkit Einstein needed to describe gravity as curved spacetime in general relativity.
Why it matters: It describes shapes on curved surfaces, not just flat ones.
On the curved surface of a sphere, for example, the angles of a triangle can add up to more than 180°.
Breaking One Rule
Euclid’s fifth postulate (the “parallel postulate”) says that through a point not on a line, exactly one line can be drawn parallel to it.
Non-Euclidean geometry asks: what if that isn’t true? On a sphere, every “straight line” is a great circle (like the equator), and any two great circles always eventually cross — so no parallel lines exist at all.
This isn’t just an abstract game: general relativity uses exactly this kind of curved geometry to describe gravity.
Prime Number Theorem
First conjectured independently by Gauss and Adrien-Marie Legendre in the late 18th century, based on tables of primes they compiled largely by hand, the Prime Number Theorem was not proven rigorously until 1896, when Jacques Hadamard and Charles Jean de la Vallée Poussin independently found proofs using complex analysis. It states that the number of primes less than some value x is approximately x divided by the natural logarithm of x, and that this approximation becomes proportionally more accurate as x grows larger. The theorem formalised the intuitive but hard-to-prove observation that prime numbers, while never stopping, become steadily rarer among larger numbers. It remains central to modern cryptography, since algorithms that search for large prime numbers, used to generate encryption keys, rely on knowing roughly how many primes to expect within a given range.
Why it matters: It shows how prime numbers spread out as numbers get bigger.
It shows that primes become rarer as numbers grow, roughly matching the pattern x divided by the natural logarithm of x.
Checking the Pattern
The Prime Number Theorem says the number of primes up to some number x is approximately x ÷ ln(x).
Check it for x = 1,000,000: there are exactly 78,498 primes below a million, and the formula predicts about 72,000 — already within about 8%.
The bigger x gets, the closer the approximation becomes, even though it’s never exact.
Group Theory
Group theory grew out of the tragically short career of the French mathematician Évariste Galois, who, before dying in a duel at the age of 20 in 1832, showed that whether a polynomial equation could be solved using a general formula depended entirely on the symmetry properties of its solutions. A group is a set of objects together with a way of combining them — such as the rotations and reflections of a square — that obeys a small number of rules: combining two elements gives another element in the set, an identity element exists that changes nothing, and every element can be undone. Because the same abstract structure shows up in contexts as different as the shuffling of a Rubik’s Cube, the symmetries of a molecule in chemistry, and the classification of particles in quantum physics, group theory became one of the great unifying ideas of 19th- and 20th-century mathematics. It now sits at the heart of modern algebra, cryptography, and particle physics.
Why it matters: It studies patterns of symmetry hidden inside mathematics.
A group is just a set of things you can combine, like the rotations of a square, that always follow a few simple rules.
Boolean Algebra
The English mathematician George Boole introduced his system of logic in his 1854 book An Investigation of the Laws of Thought, aiming to express reasoning itself using algebraic symbols rather than words. Boolean algebra reduces logical statements to just two values, true and false (or 1 and 0), and combines them using three basic operations: AND, OR, and NOT. Boole had no way of knowing that, nearly a century later, the American engineer Claude Shannon would show in his 1937 master’s thesis that these same true/false operations could be built directly out of electrical switching circuits. That insight became the founding principle of digital electronics: every calculation a modern computer chip performs, however complex, is ultimately built from vast networks of simple AND, OR, and NOT gates.
Why it matters: It is the true-or-false logic that powers every computer chip.
It reduces logic to just two values, true and false, combined with AND, OR, and NOT.
A Simple Truth Table
For two inputs A and B, AND is only true when both are true, while OR is true when at least one is:
Every circuit in a modern computer chip — however complex — is built by combining millions of these simple AND / OR / NOT decisions.
Bayesian Inference
The underlying theorem is named after the English clergyman and mathematician Thomas Bayes, whose work on inverse probability was published posthumously in 1763, although it was the French mathematician Pierre-Simon Laplace who later developed it into a fully general method. Bayesian inference provides a precise mathematical rule for updating the probability of a belief as new evidence arrives, rather than treating each new piece of data in isolation. It distinguishes between the probability of evidence given a cause, and the probability of a cause given the evidence — two very different quantities that are easy to confuse in everyday reasoning, including in medical testing and courtroom evidence. Long controversial among statisticians for allowing subjective starting beliefs, Bayesian methods are now central to modern machine learning, spam filtering, and medical diagnosis.
Why it matters: It updates what we believe as new evidence arrives.
A doctor using a positive test result to update how likely you are to have a disease is a real-world use of Bayes’ theorem.
Why a “Positive” Test Isn’t Always Bad News
Suppose a disease affects 1% of people, and a test correctly detects it 95% of the time, but also gives a false positive 10% of the time in healthy people.
Out of 10,000 people, about 100 have the disease (95 test positive). The other 9,900 don’t have it, but 990 of them still test positive by mistake.
So out of the 1,085 people who test positive overall, only 95 actually have the disease — under 9%. This is exactly why doctors always follow up a single positive result with further tests.
Set Theory
Set theory was developed almost single-handedly by the German mathematician Georg Cantor in a series of papers published between 1874 and the early 1880s, in which he studied collections of objects, called sets, and the operations that could be performed on them. His most startling discovery was that infinity is not a single, uniform concept: using a technique now called the diagonal argument, Cantor proved that the infinite set of real numbers is strictly “larger” than the infinite set of whole numbers, even though both go on forever. This idea was so radical that it was fiercely attacked by some of Cantor’s contemporaries, yet it went on to become the bedrock on which essentially all of modern mathematics is formally built, from the definition of a function to the structure of the real number line. Cantor himself suffered from severe depression, in part due to the hostile reception his ideas received, and it was only after his death in 1918 that set theory was fully accepted as foundational.
Why it matters: It studies collections of things and underpins all of modern maths.
It even led to the discovery that there are different sizes of infinity — some infinities are provably larger than others.
Different Sizes of Infinity
Georg Cantor, working in set theory, proved that the infinite set of real numbers is strictly bigger than the infinite set of whole numbers — even though both are infinite. We walk through his famous diagonal argument on our Fun Maths Facts page.
Algebraic Structures
Through the 19th century, mathematicians including Galois, Gauss, Richard Dedekind, and Emmy Noether gradually realised that many different mathematical systems — ordinary numbers, matrices, polynomials, symmetries — shared the same handful of underlying rules, and that studying those rules directly, in the abstract, was more powerful than studying each system separately. This led to a hierarchy of structures: a group has one operation and a small set of rules; a ring adds a second operation, such as addition and multiplication together, with rules connecting the two; and a field goes further still, guaranteeing that division always works too, just as it does with ordinary fractions. Emmy Noether, working in the early 20th century, was particularly influential in developing this abstract approach and is now considered one of the most important mathematicians in history, despite facing significant discrimination as a woman in academia during her lifetime. These structures now form the shared vocabulary of modern algebra, and appear throughout physics, coding theory, and cryptography.
Why it matters: These are the basic rules and patterns behind all of algebra.
Groups, rings, and fields are like different levels of a video game — each one adds more rules on top of the last.
Topology
Topology grew out of a famous puzzle solved by Euler in 1736 — whether it was possible to walk through the city of Königsberg crossing each of its seven bridges exactly once — but only became a fully-fledged branch of mathematics in the late 19th century through the work of Henri Poincaré and others. Unlike ordinary geometry, topology ignores exact distances and angles and studies only the properties of a shape that survive continuous stretching, bending, and squishing, without any cutting or gluing. This is why, to a topologist, a coffee cup and a doughnut are considered exactly “the same” shape: each has precisely one hole, and one can be smoothly reshaped into the other without tearing. Despite sounding abstract, topology has very concrete modern applications, from the shape-based analysis used in data science to the design of efficient wireless sensor networks and even the study of how DNA strands become knotted.
Why it matters: It studies shape without caring about exact size or distance.
To a topologist, a coffee cup and a donut are “the same shape,” because one can be smoothly reshaped into the other.
What Makes Two Shapes “The Same”
Topologists only care about properties that survive smooth stretching, bending, and squishing — but not cutting or gluing.
A coffee cup and a donut are considered “the same” shape in topology because each has exactly one hole (the donut’s centre, the cup’s handle), and one can be smoothly deformed into the other.
A sphere, with no holes at all, can never be turned into either — no amount of stretching can create or remove a hole.
Modern Era
1900 – PresentMatrix Algebra
The formal theory of matrices — rectangular grids of numbers that can be added, multiplied, and manipulated as single objects — was developed chiefly by the British mathematicians Arthur Cayley and James Joseph Sylvester in the 1850s, building on earlier work involving systems of linear equations. A matrix can represent a rotation, a scaling, a reflection, or almost any other transformation of space, and multiplying matrices together combines those transformations into one. This makes matrix algebra the natural mathematical language for computer graphics, where a single matrix multiplication can rotate, resize, or reposition thousands of points in a 3D scene simultaneously. It is equally central to modern data science and machine learning, where huge grids of numbers representing images, text, or sensor data are processed using exactly the same matrix operations.
Why it matters: It lets computers handle huge grids of numbers at once.
A single matrix multiplication can rotate, scale, or transform thousands of points in a video game all at once.
Game Theory
Game theory was founded as a rigorous mathematical discipline by the Hungarian-American mathematician John von Neumann and the economist Oskar Morgenstern, who published their landmark book Theory of Games and Economic Behavior in 1944. It studies how rational participants should make decisions when the outcome depends not only on their own choices but on the choices of others, whether those others are cooperating or competing. Its most famous scenario is the Prisoner’s Dilemma, in which two suspects, questioned separately, must each decide whether to stay silent or betray the other — a simple setup that reveals why purely self-interested choices can leave both players worse off than if they had cooperated. The mathematician John Nash later extended the theory with the concept of equilibrium, work that won him a Nobel Prize in Economics and is now applied to auctions, evolutionary biology, and international diplomacy.
Why it matters: It studies how people make the best choices when competing.
It’s famous for the “Prisoner’s Dilemma,” a puzzle about when cooperation beats self-interest.
Functional Analysis
Functional analysis emerged in the early 20th century from the work of mathematicians including David Hilbert and Stefan Banach, who extended the familiar geometry of points and distances to spaces where the “points” are entire functions rather than numbers. In these infinite-dimensional spaces, a function can be treated much like a vector in ordinary 3D space, with a notion of length, angle, and distance between two functions. This framework turned out to be exactly what was needed to put the newly discovered laws of quantum mechanics on a firm mathematical footing, since quantum states are naturally described as vectors in a special kind of function space called a Hilbert space. Beyond physics, functional analysis underlies modern signal processing, differential equations, and the mathematics behind image and audio compression.
Why it matters: It studies how whole functions, not just numbers, can change.
It treats whole functions as points in space, the same way ordinary geometry treats numbers as points on a line.
Turing Machine
In a landmark 1936 paper, the British mathematician Alan Turing described a theoretical device consisting of an infinite tape divided into cells, a read/write head, and a small table of simple rules governing how the head moves and what it writes based on the current cell and machine state. Despite its extreme simplicity, Turing proved that this abstract machine could, in principle, carry out any calculation that any computing device ever could — a result now known as Turing completeness, and the theoretical foundation of computer science. The same paper also proved the existence of problems no computer could ever solve, such as the halting problem: there is no general algorithm that can always correctly predict whether another program will finish running or loop forever. Turing later put these ideas into practice during the Second World War, helping to break the German Enigma cipher at Bletchley Park, work now credited with significantly shortening the war.
Why it matters: It is the simple idea that every computer is built on.
It’s just a simple tape, a pointer, and a small set of rules — yet it can, in principle, compute anything any computer ever built can compute.
RSA Cryptography
RSA takes its name from the initials of its three inventors, Ron Rivest, Adi Shamir, and Leonard Adleman, who published the algorithm in 1977 at MIT, although it later emerged that the British mathematician Clifford Cocks had discovered an equivalent method in secret in 1973 while working for UK intelligence. The system relies on a beautifully simple asymmetry: multiplying two very large prime numbers together is computationally easy, but taking that large product and working out which two primes were multiplied to make it is, for sufficiently large primes, practically impossible with current computers. This lets anyone encrypt a message using a publicly known key, while only the holder of the matching private key, built from the original primes, can decrypt it. RSA became the first practical public-key cryptosystem and still secures a huge share of internet traffic today, though real implementations use primes hundreds of digits long rather than the tiny example below.
Why it matters: It keeps your online messages and payments private.
It relies on the fact that multiplying two huge prime numbers is easy, but splitting the result back into those primes is incredibly hard.
A Tiny (Insecure!) Example
Real RSA uses primes hundreds of digits long, but the idea works the same with tiny ones. Pick two primes, p=3 and q=11, so n = p×q = 33. Choose a public exponent e=7.
To encrypt the number 4: compute 4⁷ mod 33 = 16 — that’s the encrypted message.
To decrypt, we use a private key d=3 (found so that e×d leaves remainder 1 when divided by (p−1)(q−1)=20): compute 16³ mod 33 = 4 — exactly the original number. Real RSA uses the same maths with 300-digit primes, far too large to reverse without the private key.
Chaos Theory
Chaos theory traces back to the American meteorologist Edward Lorenz, who in 1961 discovered by accident that rounding a variable in his weather simulation from six decimal places to three produced a wildly different forecast, revealing that some systems are extraordinarily sensitive to their starting conditions. He later popularised the idea in a 1972 talk titled “Does the Flap of a Butterfly’s Wings in Brazil Set Off a Tornado in Texas?”, giving the phenomenon its enduring nickname, the butterfly effect. Chaotic systems are not random — they follow precise, deterministic mathematical rules — but their extreme sensitivity to tiny differences in starting conditions makes their long-term behaviour practically unpredictable. This is exactly why weather forecasts remain reliable only a week or so ahead even with immense computing power, and chaos theory now also informs the study of heart rhythms, population ecology, and financial markets.
Why it matters: It shows how tiny changes can lead to huge, unpredictable effects.
It’s often summed up by the “butterfly effect” — the idea that a butterfly flapping its wings could, in theory, alter a distant storm.
Quantum Mechanics
Quantum mechanics developed in the first three decades of the 20th century through the work of physicists including Max Planck, Albert Einstein, Niels Bohr, Werner Heisenberg, and Erwin Schrödinger, who found that classical physics broke down completely when describing atoms and subatomic particles. At this scale, particles such as electrons can behave like both particles and waves depending on how they are observed, and quantities like energy and angular momentum come only in discrete, indivisible steps rather than smooth, continuous ranges. Heisenberg’s uncertainty principle showed that some pairs of properties, such as position and momentum, can never both be known with perfect precision at the same time, no matter how good the measuring equipment. The mathematics developed to describe this strange behaviour — built on complex numbers and functional analysis — now underlies technologies from lasers and MRI scanners to the transistors inside every computer chip.
Why it matters: It explains the strange rules that atoms and particles follow.
At this scale, particles can behave like waves, and simply observing something can change its outcome.
Fractal Geometry
The mathematician Benoît Mandelbrot coined the term “fractal” in 1975, drawing together decades of earlier mathematical curiosities — including work by Georg Cantor, Helge von Koch, and Waclaw Sierpiński — into a single coherent field. A fractal is a pattern that displays self-similarity: zoom into a small piece of it, and you see a shape that looks similar to the whole, often repeating this at every scale. Mandelbrot’s famous 1967 paper, “How Long Is the Coast of Britain?”, showed that a coastline’s measured length keeps increasing the more finely you measure it, because ever-smaller inlets and headlands keep appearing — a real-world example of fractal-like behaviour. Fractal mathematics is now used to compress digital images, model the branching of blood vessels and trees, and generate the realistic-looking mountains and landscapes seen in films and video games.
Why it matters: These are patterns that look the same however far you zoom in.
A famous example is the coastline of Britain, which gets longer and longer the more closely you measure it.
Linear Programming
Linear programming was developed independently by the Soviet mathematician Leonid Kantorovich in 1939, working on resource allocation problems for the Soviet economy, and by the American mathematician George Dantzig, who invented the highly efficient simplex algorithm for solving such problems in 1947 while working for the US Air Force. The technique finds the best possible outcome — maximum profit, minimum cost, or similar — for a problem where the goal and all its constraints can be written as straight-line, or linear, relationships between variables. Airlines use it every day to work out the cheapest way to schedule crews and aircraft across an entire route network, and it is equally central to manufacturing, logistics, and telecommunications planning. Dantzig’s simplex method remains one of the most widely used algorithms in applied mathematics, routinely solving problems with millions of variables on modern computers.
Why it matters: It helps businesses get the best result while saving time and money.
Airlines use it every day to work out the cheapest way to schedule crews and aircraft across a whole network.
Category Theory
Category theory was introduced in 1945 by the mathematicians Samuel Eilenberg and Saunders Mac Lane, initially as a way to formalise and compare different constructions arising in algebraic topology. Rather than studying individual mathematical objects, category theory studies the relationships, called morphisms, between objects and, crucially, the relationships between entire mathematical fields themselves, treating a “category” such as all groups, or all topological spaces, as a single unit of study. Because it operates at this very high level of abstraction, it is sometimes nicknamed “abstract nonsense” by mathematicians, though usually affectionately, since it reveals deep structural patterns that recur across otherwise unrelated branches of mathematics. In recent decades it has found unexpected practical use in computer science, particularly in the design of functional programming languages such as Haskell.
Why it matters: It looks for the same patterns hiding across different parts of maths.
It’s sometimes nicknamed “the mathematics of mathematics” because it studies the patterns that connect entirely different fields.
Differential Geometry
Differential geometry combines the tools of calculus with the study of curves and surfaces, and was significantly advanced by the German mathematician Bernhard Riemann in his 1854 lecture on the foundations of geometry, which generalised geometric ideas to spaces of any number of dimensions and any degree of curvature. Riemann’s abstract mathematics sat largely unused for over half a century until Albert Einstein realised, while developing general relativity in the 1910s, that it was exactly the language he needed to describe gravity not as a force but as the curving of space and time itself around massive objects. In this framework, planets do not orbit the sun because of a pulling force, but because they are following the straightest possible path through a spacetime that the sun’s mass has warped, much as a ball rolls along the curved surface of a funnel. Differential geometry remains essential in modern physics, robotics, and computer vision, wherever curved shapes and spaces must be measured and manipulated precisely.
Why it matters: It studies curves and curved surfaces using calculus.
It’s the mathematical language Einstein used to describe gravity as the curving of space and time itself.
Cryptographic Hash Functions
A cryptographic hash function takes an input of any size — a single word or an entire film file — and produces a fixed-length string of characters, called a hash or digest, in such a way that even a tiny change to the input produces a completely different, unpredictable hash. Modern hash functions such as SHA-256, developed by the US National Security Agency and published in 2001, are designed so that it is computationally infeasible to find two different inputs that produce the same hash, or to work backwards from a hash to recover the original input. This makes them ideal for checking that a downloaded file has not been corrupted or tampered with, for securely storing passwords so that even a stolen database does not reveal the originals, and for linking blocks together in blockchain systems such as Bitcoin. Because changing even a single character anywhere in the input scrambles the output completely, hash functions provide a fast, reliable fingerprint for digital data of any size.
Why it matters: They check that digital data has not been changed or tampered with.
Changing even a single letter in a message produces a completely different hash, making tampering easy to detect.
Fourier Transform
The French mathematician Joseph Fourier introduced the core idea in 1822 while studying how heat spreads through a solid object, showing that remarkably complex, irregular patterns could be built by adding together simple sine and cosine waves of different frequencies. The Fourier transform formalises this by taking any signal — a sound wave, an image, an electrical signal — and breaking it down into the individual pure frequencies that combine to produce it, in effect asking “which notes make up this chord?” This is exactly how a phone or tuning app can identify a musical note as middle C: it performs a Fourier transform on the incoming sound wave and reads off the dominant frequency. The fast Fourier transform, a highly efficient algorithm for this calculation developed by James Cooley and John Tukey in 1965, is now used constantly in audio and video compression, medical imaging such as MRI scans, and mobile phone signal processing.
Why it matters: It breaks a sound or signal down into simple, pure tones.
It’s the reason your phone can tell a musical note is a middle C — by breaking a sound wave down into its pure frequencies.
Machine Learning
The term “machine learning” was coined in 1959 by the computer scientist Arthur Samuel, who built a checkers-playing program that improved its own performance by analysing games it had already played, rather than following a fixed set of instructions written by a programmer. Instead of being explicitly programmed with rules for every situation, a machine learning system is shown large amounts of example data and automatically adjusts its own internal parameters to find patterns that let it make accurate predictions on new, unseen data. A spam filter is a simple everyday example: rather than following a fixed list of banned words, it learns from thousands of examples of spam and legitimate email what distinguishes the two, and keeps improving as it sees more. Modern machine learning, built on decades of statistics, linear algebra, and optimisation theory, now powers everything from voice assistants and recommendation systems to medical diagnosis and self-driving cars.
Why it matters: It lets computers improve at a task just by seeing examples.
A spam filter is a simple example: it learns to spot junk email by studying thousands of examples, not by following fixed rules.
Homology Theory
Homology theory was developed in the early 20th century, building on foundational work by Poincaré, as a way to systematically count and classify the “holes” of different dimensions in a mathematical space using algebraic tools such as groups. Where topology tells us informally that a doughnut and a coffee cup are “the same shape” because each has one hole, homology theory makes this rigorous by assigning precise algebraic invariants to a shape that do not change under continuous deformation. A solid ball has no holes and trivial homology; a doughnut has one hole running through its middle; a double-holed pretzel shape has two, and homology theory can distinguish all of these cases with certainty using computable algebra rather than intuition alone. Beyond pure mathematics, homological ideas now appear in data analysis, in a field called topological data analysis, as well as in robotics motion planning and the study of complex networks.
Why it matters: It studies the holes and shape of an object, not its size.
It’s a formal way of counting the “holes” in a shape — a donut has one, a coffee cup has one too, but a ball has none.
Wavelet Theory
While the Fourier transform breaks a signal into pure frequencies that stretch on forever, it struggles to capture information that is localised in time, such as a sudden click in an audio recording or a sharp edge in an image. Wavelet theory, developed through the 1980s by mathematicians including Jean Morlet, Yves Meyer, and Ingrid Daubechies, solves this by using small, localised wave-like functions called wavelets that can be stretched or compressed and slid across a signal, capturing both frequency and precise timing or location information at once. This makes wavelets especially good at representing signals that change abruptly, such as edges in a photograph or sudden transients in sound. The JPEG2000 image format uses wavelet compression to shrink photo file sizes dramatically while preserving sharp detail far better than older compression methods, and wavelets are also widely used to remove noise from medical and seismic signals.
Why it matters: It helps compress images and clean up noisy signals.
JPEG2000 image compression uses wavelets to shrink photo file sizes while keeping the important details sharp.
Elliptic Curves in Cryptography
Elliptic curve cryptography was proposed independently in 1985 by the mathematicians Neal Koblitz and Victor Miller, building on decades of pure mathematical research into the geometry of elliptic curves — smooth curves defined by equations of the form y² = x³ + ax + b. Rather than relying on the difficulty of factoring large numbers, as RSA does, elliptic curve systems rely on a different problem: given a starting point on the curve and a point reached by repeatedly adding it to itself a secret number of times, it is extremely hard to work out how many times the addition was performed. This problem turns out to be so much harder to reverse-engineer, relative to its key size, that elliptic curve cryptography can offer the same level of security as RSA using keys that are roughly ten times shorter. That efficiency is why elliptic curve cryptography now secures the majority of everyday web browsing, messaging apps, and cryptocurrency wallets.
Why it matters: They make modern digital security both stronger and faster.
They give the same security as RSA using much shorter keys, which is why they secure most modern web browsing.
Automata Theory
Automata theory studies simple, idealised machines that move through a fixed set of internal states, reading input step by step and following strict, predetermined rules with no memory beyond their current state, in the simplest case called a finite automaton. It grew out of the work of Turing and, later, the linguist Noam Chomsky, who in the 1950s classified different types of formal grammars according to exactly which kind of automaton was needed to recognise them — connecting the study of machines directly to the study of language structure. Despite their simplicity, finite automata are powerful enough to underpin the “find and replace” and pattern-matching features, known as regular expressions, built into every modern text editor, programming language, and search engine. More complex automata form the theoretical basis for compilers, which translate human-written code into instructions a computer can execute, and for network protocol verification.
Why it matters: It studies simple machines that follow strict step-by-step rules.
The “find and replace” pattern matching used in every text editor is built on these simple rule-following machines.
Ergodic Theory
Ergodic theory grew out of 19th-century work in statistical mechanics by Ludwig Boltzmann, who needed to justify why measuring the average behaviour of a single gas particle over a long time should match the average behaviour across all the particles in a container at one instant. The mathematician George David Birkhoff proved the first rigorous version of this idea, now called the ergodic theorem, in 1931, showing precisely which systems have this property of “time averages equal space averages.” A well-known illustration involves shuffling a deck of cards: ergodic theory helped establish that watching one deck being shuffled for a very long time reveals statistically the same information as watching many different decks each shuffled once. The theory now has applications well beyond physics, including in number theory, the analysis of algorithms, and understanding the long-term behaviour of dynamical and chaotic systems.
Why it matters: It studies how a system behaves on average over a long time.
It helped prove that, in a well-shuffled deck of cards, watching one long shuffle is statistically like watching many separate shuffles.
Lie Groups
Lie groups are named after the Norwegian mathematician Sophus Lie, who in the 1870s and 1880s developed the theory to study continuous symmetries — smooth families of transformations, such as rotating an object by any angle at all, rather than the discrete symmetries, like the finite rotations of a square, studied in ordinary group theory. Because rotations, in particular, can be combined smoothly and continuously, Lie groups come equipped with both algebraic structure (they are groups) and geometric structure (they are smooth, curved spaces), a combination that makes them extraordinarily powerful. In 20th-century physics, Lie groups became the mathematical backbone of the Standard Model of particle physics, where different types of fundamental particles and forces are classified according to which Lie group symmetry they respect. They also underpin the mathematics of robotic motion, computer vision, and the equations describing rigid-body motion in mechanical engineering.
Why it matters: They describe smooth, continuous kinds of symmetry.
They describe the smooth rotations and symmetries physicists use to classify fundamental particles.
Representation Theory
Representation theory, developed extensively in the early 20th century by mathematicians including Ferdinand Georg Frobenius and Issai Schur, studies abstract algebraic structures such as groups by representing their elements as matrices acting on vectors, turning abstract symmetry operations into concrete grids of numbers that can be directly computed. This translation is powerful because matrices are far easier to manipulate, add, and multiply than abstract algebraic elements, letting mathematicians solve problems about symmetry using the well-developed toolkit of linear algebra instead. It plays a central role in quantum mechanics, where the possible states and transformations of a particle are described using representations of symmetry groups, and in chemistry, where it helps predict the vibrational and electronic properties of molecules based on their symmetry. Representation theory also underlies modern signal processing techniques and parts of machine learning that exploit symmetry hidden in data.
Why it matters: It turns abstract algebra into grids of numbers we can compute with.
It lets mathematicians study abstract algebra by turning it into ordinary grids of numbers (matrices) that are easier to compute with.
Mathematical Logic
Mathematical logic sought to place the entire foundation of mathematics on completely rigorous footing, a project led in the early 20th century by figures including Bertrand Russell, Alfred North Whitehead, and David Hilbert, who hoped to prove that all of mathematics could be derived from a small set of axioms without any hidden contradictions. That ambition was upended in 1931 by the Austrian logician Kurt Gödel, whose incompleteness theorems proved that in any sufficiently powerful and consistent mathematical system, there will always exist true statements that can never be proved within that system — a fundamental and permanent limitation, not just a temporary gap in knowledge. Alan Turing’s later work on computability, including the halting problem, is closely related, showing similar hard limits on what any computer could ever determine. Together, these results reshaped mathematicians’ understanding of proof, truth, and the ultimate limits of formal reasoning itself.
Why it matters: It studies what makes a mathematical argument valid.
It’s the field that produced Gödel’s incompleteness theorems, proving that some true statements can never be proved within their own system.
Number Theory Applications in Cryptography
For over two thousand years after Euclid proved there are infinitely many primes, number theory was considered one of the most beautifully useless branches of pure mathematics, studied for its own sake with no expectation of practical application. That changed dramatically in the 1970s with the invention of public-key cryptography, including RSA, which showed that the difficulty of factoring large numbers into their prime components could be turned into a practical tool for securing digital communication. Every time a padlock icon appears in a web browser, prime numbers many digits long are working behind the scenes, having been used to generate the keys that scramble and unscramble the data flowing between a device and a website. Number theory now sits at the very centre of digital security, protecting everything from online banking and shopping to private messaging and government communications.
Why it matters: Prime numbers are what keep our digital secrets safe.
Every time you see a padlock icon in your browser, prime numbers are quietly working behind the scenes.
Artificial Intelligence and Machine Learning Applications
The field of artificial intelligence was formally founded at a 1956 workshop at Dartmouth College, where researchers including John McCarthy and Marvin Minsky set out the ambitious goal of building machines that could reason, learn, and use language much as humans do. After decades of alternating progress and setbacks, periods now known as “AI winters,” when funding and interest dried up, the field was transformed from the 2010s onward by breakthroughs in a technique called deep learning, which uses many-layered artificial neural networks trained on enormous datasets using ideas from calculus, linear algebra, and probability. These statistical learning methods now power voice assistants that recognise speech, recommendation systems that predict what someone might want to watch or buy next, and self-driving cars that interpret camera and sensor data in real time. The mathematics underlying these systems — optimisation, matrix algebra, and probability — traces directly back to ideas developed decades or even centuries earlier for entirely different purposes.
Why it matters: These let machines learn from data and make their own decisions.
Voice assistants, recommendation systems, and self-driving cars all rely on the statistical learning ideas developed in this field.