← Big Ideas of Mathematics
An interactive field guide

The big ideas of mathematics

Mathematics is the art of finding patterns and then proving they can't fail. Here are twelve ideas that shaped it, from zero to the different sizes of infinity. Each one comes with a small experiment you can run in your browser.

Join point k to point m × k around a circle of 200 points. One rule, endless shapes.
Part I

Number

Counting is older than writing, but it took thousands of years to find good ways to write numbers down, to see which numbers are built from which, and to admit that some quantities aren't ratios of whole numbers at all.

01

Place value & zero

A digit's meaning depends on where it sits. That one trick, plus a symbol for "nothing here," made arithmetic something anyone could do.

In 2026 the 2 on the left means two thousand and the 2 in the tens place means twenty. Same symbol, different value, decided by position. This is place value, and it is why ten symbols are enough to write any whole number.

Position only works if you can mark an empty place. Without zero, 26, 206 and 2006 look alike. Once zero exists, the algorithms you learned in school for adding, multiplying and dividing are simple column-by-column rules. With Roman numerals they are a nightmare: try multiplying MCMXLIV by XXIX.

There is nothing special about ten. Each place is worth the base times the place to its right. Computers use base 2, the Babylonians used base 60 (which survives in 60 minutes and 360 degrees), and the Maya used base 20.

2026 = 2·10³ + 0·10² + 2·10¹ + 6·10⁰ In base b, each place is worth b times the place to its right

History

Babylonian scribes wrote place-value numbers in base 60 around 2000 BCE, though for centuries they left an empty place as a gap. The Indian mathematician Brahmagupta gave rules for computing with zero as a number in 628 CE. The decimal system reached the Arab world, where al-Khwarizmi wrote about it around 825, and then Europe through Fibonacci's Liber Abaci in 1202.

Watch out

Zero is a number you can add and multiply, but you can't divide by it. "6 ÷ 0" has no answer, because no number times 0 gives 6.

Try it · Write a number in any base
Share of the number contributed by each place
Written in this base Digits Roman numerals
02

Prime numbers

Every whole number is built from primes in exactly one way, and there is no largest prime.

A prime is a whole number greater than 1 whose only divisors are 1 and itself: 2, 3, 5, 7, 11, 13, … Every other number breaks into primes, like 60 = 2 × 2 × 3 × 5. The fundamental theorem of arithmetic says that this breakdown is always possible and always unique, apart from the order of the factors. Primes are the atoms of multiplication.

Do they run out? Euclid's proof that they don't is one of the most famous arguments ever written. Suppose you had a complete list of primes. Multiply them all together and add 1. The result leaves remainder 1 when divided by any prime on your list. So its prime factors are missing from the list, and the list wasn't complete.

The primes thin out as numbers grow, but slowly and with a definite pattern. Near a number N, roughly one number in ln N is prime. This is the prime number theorem, proved in 1896.

π(N) ≈ Nln N π(N) counts the primes up to N

History

Euclid's proof is Proposition 20 of Book IX of the Elements, written around 300 BCE. Eratosthenes, who also measured the Earth's circumference, described the sieve in the lab around 240 BCE. Gauss guessed the N/ln N pattern as a teenager by studying tables of primes. Hadamard and de la Vallée Poussin proved it independently a century later.

Watch out

Euclid's number "product plus one" is not always prime itself. 2·3·5·7·11·13 + 1 = 30,031 = 59 × 509. The proof only needs it to have a prime factor that isn't on the list.

Try it · The sieve of Eratosthenes
Prime (confirmed) Multiples being crossed out Not yet decided
Sieving with — Primes up to N — N / ln N —
You only need to sieve with primes up to √N. Any composite number up to N has a factor no bigger than √N, so it has already been crossed out.
03

Irrational numbers

The diagonal of a unit square has a length no fraction can name. Fractions can get as close as you like, but never land on it.

The Pythagoreans believed everything was ratios of whole numbers. Then someone found that the diagonal of a square with side 1, which has length √2, is not one.

The proof is short. Suppose √2 = p/q with the fraction in lowest terms. Squaring gives p² = 2q², so p² is even, so p is even. Write p = 2k. Then 4k² = 2q², so q² = 2k², and q is even too. Both are even, so the fraction wasn't in lowest terms after all. That is a contradiction, so no such fraction exists.

Irrational numbers are everywhere: √2, π, e, the golden ratio φ. Most real numbers are irrational, in a sense idea 12 makes precise. What fractions can do is approximate them. The lab finds the best fraction for every denominator. Some numbers, like π, have unusually good approximations (355/113 is correct to six decimal places). The golden ratio has the worst ones of any number, so in a precise sense it is the "most irrational."

√2 = 1.41421356…    π = 3.14159265…    φ = 1 + √52 = 1.6180339… The decimals never end and never repeat

History

The discovery is traditionally credited to Hippasus, a Pythagorean of the 5th century BCE. Legend says he was drowned at sea for revealing it, though there's no good evidence for this. Lambert proved π irrational in 1761. Lindemann proved in 1882 that π is not even the root of any polynomial with whole-number coefficients, which finally showed that "squaring the circle" with ruler and compass is impossible.

Watch out

"Irrational" means not a ratio. It doesn't mean random or unknowable. We can compute √2 to a trillion digits, and every one is determined.

Try it · Chase an irrational number with fractions
Best fraction with denominator q New record (a better fraction than any smaller q) 1/q² guide
Best fraction Its value Error
Part II

Proof and space

The Greeks made mathematics deductive: start from a few plain assumptions and derive everything else. Later mathematicians connected geometry to algebra and found a language for symmetry itself.

04

Proof

A proof makes a claim true for every case at once, including the infinitely many you will never check.

Science believes things because evidence piles up. Mathematics asks for more: a chain of steps, each one following from the last, that starts from agreed assumptions and ends at the claim. Once a theorem is proved it stays proved. Euclid's theorems are as true today as in 300 BCE.

The Pythagorean theorem says that in a right triangle with legs a and b and hypotenuse c, a² + b² = c². Measuring a thousand triangles would make you confident. The proof in the lab makes you certain. Put four copies of the triangle in a square of side a + b. Arranged one way, they leave a hole of area c². Slide them around and they leave two holes of areas a² and b². The big square and the four triangles didn't change, so neither did the total area of the holes.

a² + b² = c² True for every right triangle, of every size and shape

History

Babylonian scribes knew the relationship around 1800 BCE. The clay tablet Plimpton 322 lists triples like (119, 120, 169). The Greek achievement was the proof, which appears as Proposition 47 of Book I of Euclid's Elements. Hundreds of different proofs are known, including one by US President James Garfield in 1876.

Watch out — examples aren't proof

The formula n² + n + 41 gives a prime for n = 0, 1, 2, …, 39. Forty successes in a row! But at n = 40 it gives 1681 = 41 × 41. A pattern that holds for many cases can still fail.

Try it · A proof you can slide
Four copies of the triangle Uncovered area
a² b² a² + b² c²
05

Coordinates

Give every point an address, and geometry becomes algebra. Questions about curves turn into equations you can solve.

Draw two perpendicular number lines. Every point in the plane now has an address (x, y). A curve is just the set of points whose addresses satisfy an equation. The equation y = x² is a parabola, and x² + y² = 1 is a circle.

Geometric questions become algebra. Where does the parabola cross the x-axis? Set y = 0 and solve. How many crossings are there? The discriminant b² − 4ac tells you: positive means two, zero means the curve just touches, negative means it misses entirely. You can see the answer and compute it, and the two always agree.

This bridge works in both directions. Algebra gives geometry its calculating power, and pictures give algebra its intuition. Calculus, physics and every graph in this guide are built on it.

x = −b ± √(b² − 4ac)2a Where y = ax² + bx + c crosses the x-axis

History

René Descartes published La Géométrie in 1637 as an appendix to his Discourse on Method. Pierre de Fermat developed the same idea independently at about the same time, but didn't publish it. That's why we say "Cartesian" coordinates and not "Fermatian" ones.

Watch out

A picture can suggest a false answer. A curve that seems to touch the axis may miss it by 0.001. The algebra settles what the eye can't.

Try it · Shape a parabola
y = ax² + bx + c Roots (where y = 0) Vertex
Discriminant b² − 4ac Roots Vertex
06

Symmetry & groups

To understand an object, study the moves that leave it looking the same. Those moves form a group.

A square has eight symmetries: four rotations (by 0°, 90°, 180°, 270°) and four flips. Do one symmetry and then another, and the result is again one of the eight. Every move can be undone, and "do nothing" counts as a move. Any collection of moves with these properties is called a group.

The surprise is that order matters. Rotate then flip, and you usually get a different result from flip then rotate. Group theory is the algebra of things that don't commute, and it shows up wherever there is symmetry: crystals, molecules, the Rubik's cube, particle physics, and the question of which equations can be solved by a formula (see the graduate edition).

The lab lets you apply moves to a labelled shape. Whatever sequence you try, the result is always one of the 2n symmetries shown below the shape.

symmetries of a regular n-gon = n rotations + n flips = 2n This group is called the dihedral group

History

Évariste Galois invented groups around 1830 to explain why some polynomial equations have no formula for their roots. He died in a duel at age 20. In 1872 Felix Klein proposed defining each kind of geometry by its symmetry group. In 1918 Emmy Noether proved that every continuous symmetry of a physical law gives a conserved quantity: symmetry in time gives conservation of energy.

Watch out

Don't assume order doesn't matter. Putting on socks then shoes is not the same as shoes then socks. Most groups that matter are like this.

Try it · Move a polygon
All the symmetries. The current one is highlighted.
Moves made 0 Same as doing nothing
Hundreds of moves always end at one of the 2n pictures. Try the two tests to see that order matters.
Part III

Change

Static geometry can't describe a falling stone or a growing population. These four ideas give mathematics a way to talk about change, ending with calculus, the tool that launched modern science.

07

Exponential growth & logarithms

Growing by a fixed percentage eventually beats growing by any fixed amount. Logarithms turn that explosion back into a straight line.

Linear growth adds the same amount each step: 100, 110, 120, 130. Exponential growth multiplies by the same factor: 100, 110, 121, 133.1. At first they look alike. Then the exponential pulls away and never comes back. Compound interest, unchecked epidemics, bacteria and computer chips have all grown this way for a while.

Something growing at r% per step doubles roughly every 72/r steps, whatever its starting size. That steady doubling is the signature of exponential growth.

The logarithm is the inverse: it asks "how many doublings (or tenfoldings) does it take to get here?" Plot exponential growth on a logarithmic scale and it becomes a straight line whose slope is the growth rate. Logarithms turn multiplication into addition, which is why scientists used them to do arithmetic for 350 years before calculators.

A(t) = A₀ (1 + r)t     doubling time = ln 2ln(1 + r) ≈ 72r in %

History

John Napier published logarithms in 1614 to speed up astronomers' calculations, and Henry Briggs soon switched them to base 10. Jacob Bernoulli, studying compound interest in 1683, asked what happens if interest is added more and more often. The answer led to the number e = 2.71828…, which Euler later named and put at the center of calculus.

Watch out

Real growth can't stay exponential forever, because something runs out. Epidemics and populations usually bend into an S-curve. Early on, an S-curve and an exponential look the same.

Try it · Adding vs. multiplying
Exponential: × (1 + r) each step Linear: + r × start each step
Exact doubling time Rule of 72 Exponential ÷ linear at the end
08

Limits & infinite sums

Infinitely many positive pieces can add up to a finite total. Whether they do depends on how fast the pieces shrink.

Walk halfway to a wall, then half the remaining distance, then half again. You take infinitely many steps, yet the total distance is exactly 1. In symbols, ½ + ¼ + ⅛ + … = 1. The sum converges: its running totals get as close to 1 as you want and stay there. That target is called the limit.

Shrinking pieces aren't enough. The harmonic series 1 + ½ + ⅓ + ¼ + … has pieces that shrink to zero, but its running total grows without bound. It grows very slowly: you need about 12,000 terms to pass 10, and more terms than there are atoms in the universe to pass 200.

Some infinite sums land on surprising targets. The squares of the reciprocals add up to π²/6. The alternating odd fractions give π/4. Circles appear in sums that have nothing to do with circles.

1 + 14 + 19 + 116 + … = π²6 Euler's solution to the Basel problem (1734)

History

Zeno of Elea (about 450 BCE) used the halving walk to argue that motion is impossible. Nicole Oresme proved the harmonic series diverges around 1350, by grouping its terms into blocks that each add to more than ½. Limits were only made rigorous in the 1800s by Cauchy and Weierstrass, who defined them using ε ("epsilon") and δ ("delta").

Watch out

Infinite sums don't always behave like finite ones. Riemann proved that the terms of 1 − ½ + ⅓ − ¼ + … can be rearranged to add up to any number you like.

Try it · Add up infinitely many terms
Running total Limit (or ln n + 0.577 for the harmonic series)
Terms 0 Running total — Target — Gap —
09

The derivative

Speed over an interval is easy. Speed at an instant is the limit of speeds over shorter and shorter intervals.

A car's average speed is distance divided by time. But what does the speedometer mean when it says 60 km/h at one instant, when zero time has passed and the car has covered zero distance? 0/0 is meaningless.

The answer is a limit. Take the average rate of change over a short stretch h, then let h shrink toward zero. On a graph the average rate is the slope of a secant line through two points of the curve. As the points merge, the secant turns into the tangent, and its slope is the derivative.

The derivative turns "how fast is this changing?" into something you can calculate. For x² it is 2x, for sin x it is cos x, and for ex it is ex itself. Velocity, marginal cost, the rate of a reaction and the gradient a neural network follows during training are all derivatives.

f ′(x) = limh→0 f(x + h) − f(x)h

History

Isaac Newton and Gottfried Leibniz invented calculus independently, Newton in the 1660s and Leibniz in the 1670s. Leibniz published first, in 1684, and his notation dy/dx is the one we still use. The two camps fought bitterly over priority for decades.

Watch out

Not every function has a derivative everywhere. |x| has a sharp corner at 0, with slope −1 on one side and +1 on the other. And on a computer, making h too small backfires: try the smallest h in the lab.

Try it · Shrink the secant
f(x) Secant through x and x + h Tangent (true derivative)
Secant slope Derivative f ′(x) Error
10

The integral & the fundamental theorem

Area under a curve is the limit of sums of thin rectangles. Astonishingly, it is also the reverse of the derivative.

How much area lies under a curve? Chop it into thin vertical strips, approximate each by a rectangle, and add them up. More strips give a better answer, and the limit as the strips get infinitely thin is the integral. The same idea computes distance from speed, volume from cross-sections and total probability from a density.

The fundamental theorem of calculus connects this to idea 9. Let A(x) be the area from 0 up to x. Nudge x a little and the area grows by a thin strip of height f(x). So the rate at which the area grows is f(x) itself: A ′ = f. To find an area, you don't have to add infinitely many strips. You only need a function whose derivative is f.

∫ab f(x) dx = F(b) − F(a)   whenever   F ′ = f The fundamental theorem of calculus

History

Archimedes computed the area under a parabola around 250 BCE by filling it with ever-smaller triangles, his "method of exhaustion." Isaac Barrow, Newton's teacher, saw a geometric form of the fundamental theorem, and Newton and Leibniz made it into a working method. Bernhard Riemann gave the rectangle definition used in the lab in 1854.

Watch out

Area below the axis counts as negative. ∫ sin x from 0 to 2π is 0, even though the curve encloses plenty of area.

Try it · Fill the area with rectangles
Area so far, A(x). Its slope at each point equals the height of f there.
Sum of rectangles Exact area Error Slope of A at the end
Part IV

Structure and infinity

Modern mathematics strips problems down to their bare structure: which things connect to which, and which collections can be matched up with which. Two of its founding moments came from a puzzle about bridges and a question about the sizes of sets.

11

Graphs & networks

Many problems depend only on what connects to what. Throw away the rest and they often become easy.

The city of Königsberg had seven bridges joining two islands and two riverbanks. Residents wondered whether they could walk through the city crossing every bridge exactly once. Nobody could find a route, but nobody could prove there wasn't one.

Leonhard Euler saw that the map didn't matter. Shrink each land mass to a dot (a vertex) and each bridge to a line (an edge). The result is a graph. Now think about any vertex that is neither the start nor the end of the walk: every time you arrive you must leave, so its edges pair up and it needs an even number of them. A walk can therefore have at most two vertices with an odd number of edges. In Königsberg all four were odd, so no such walk exists.

Euler's argument began graph theory, and also topology, the study of properties that survive stretching. Graphs now model road maps, the internet, social networks, molecules and the links between web pages that search engines rank.

A connected graph has a walk using every edge once ⇔ it has 0 or 2 vertices of odd degree The degree of a vertex is its number of edges

History

Euler presented his solution to the St. Petersburg Academy in 1735, and it was published in 1741. He remarked that the problem seemed to belong to a "geometry of position," where only arrangement matters, not measurement. Carl Hierholzer proved the converse, that the degree condition is enough, in a paper published in 1873.

Watch out

Close variants can be far harder. Asking for a route that visits every vertex exactly once (a Hamiltonian path) sounds similar, but no efficient method for it is known, and it is one of the classic NP-complete problems.

Try it · Cross every bridge once
Unused edge Your walk Odd degree Even degree
Edges used Odd-degree vertices Euler's verdict
Click a vertex to start, then click a neighbour to cross an unused edge.
12

Sizes of infinity

Two sets are the same size if you can pair them up perfectly. By that test, some infinities are bigger than others.

How do you know two sets have the same size without counting? Pair them off. If every chair has exactly one person and every person has a chair, there are as many people as chairs. Georg Cantor applied this test to infinite sets, with strange results. The even numbers pair up with all whole numbers (2↔1, 4↔2, 6↔3, …), so there are "as many" of each. So do the fractions, using a clever zigzag listing.

Then Cantor showed that the real numbers can't be listed. His diagonal argument works on infinite sequences of 0s and 1s, which are essentially real numbers written in binary. Suppose someone hands you a list that supposedly contains every sequence. Build a new sequence by flipping the 1st digit of row 1, the 2nd digit of row 2, the 3rd digit of row 3, and so on. Your sequence differs from every row in at least one place, so it isn't on the list. Every list misses something.

So there are at least two sizes of infinity: countable (the size of the whole numbers) and the strictly larger size of the real numbers. The same diagonal trick shows there's no largest infinity at all, and in other forms it powers Gödel's incompleteness theorem and Turing's proof that some problems can't be solved by any computer.

|ℕ| = |ℤ| = |ℚ|  <  |ℝ| Whole numbers, integers and fractions are countable. The reals are not.

History

Cantor proved the reals are uncountable in 1874 and published the diagonal argument in 1891. Some leading mathematicians of the time rejected his work. A generation later David Hilbert declared that "no one shall expel us from the paradise that Cantor has created."

Watch out

Is there an infinity strictly between the whole numbers and the reals? This is the continuum hypothesis. Gödel (1940) and Cohen (1963) showed that the standard axioms of mathematics can neither prove nor disprove it.

Try it · Defeat any list

Here is the start of a list that claims to contain every infinite 0/1 sequence. Click any digit to change the list. The diagonal construction will always find a sequence that is missing.

New sequence
Putting it together

Three threads run through all twelve ideas

Abstraction

Place value forgets which base you use, coordinates forget pictures, groups forget what is being moved, and graphs forget distances (ideas 1, 5, 6, 11). Each time, throwing information away made a problem easier and the answer more widely useful.

Certainty by proof

Euclid on primes, the irrationality of √2, the Pythagorean theorem, Euler's bridges and Cantor's diagonal (ideas 2–4, 11, 12) settle questions about infinitely many cases with a finite argument. No amount of checking examples can do that.

Taming the infinite

Limits, derivatives and integrals (ideas 8–10) make "infinitely small" precise, and Cantor (idea 12) made "infinitely large" precise. Much of the history of mathematics is learning to reason about infinity without contradiction.

Further reading

  • Richard Courant & Herbert Robbins, What Is Mathematics? (1941; revised by Ian Stewart, 1996). The classic tour, still the best.
  • Timothy Gowers, Mathematics: A Very Short Introduction (2002). A Fields medallist on what abstraction and proof are really for.
  • Steven Strogatz, The Joy of x (2012) and Infinite Powers (2019). Short, friendly chapters from numbers to calculus.
  • William Dunham, Journey Through Genius (1990). Twelve great theorems with their full proofs and the stories behind them.
  • Ian Stewart, Why Beauty Is Truth (2007). The history of symmetry, from Babylon to group theory and physics.
  • 3Blue1Brown, Essence of Calculus (video series, 2017). The derivative and integral, animated.