Can a formal system prove every arithmetic truth while also certifying its own consistency? Gödel showed that, under precise conditions, the answer is no. This chapter explores the incompleteness theorems, the encoding of formulas and proofs as numbers, and the construction of a statement that essentially asserts its own unprovability. The result does not mean mathematics is uncertain or that anything can be true. It says something far more precise: any effective, consistent formal system powerful enough to express arithmetic will contain internal limits that cannot be eliminated using only its own rules.

See omnystudio.com/listener for privacy information.

Can a program analyze any other program and always determine whether it will eventually stop or run forever? Alan Turing proved that no such universal algorithm can exist. This chapter explores the Turing machine, universal computation and the halting problem, one of the fundamental boundaries of theoretical computer science. Through a self-referential construction, Turing showed that some problems are not merely too difficult for today’s computers: no general algorithm can solve every instance. The same theory that helped define what computation means also revealed that computation has limits no increase in speed or memory can overcome.

See omnystudio.com/listener for privacy information.

One plus two plus three plus four and so on forever grows without bound. So why is this series so often associated with −1/12? This chapter explores the difference between a divergent series and a regularized value, moving from Cesàro summation to the analytic continuation of the Riemann zeta function. The famous −1/12 is not the ordinary sum of the positive integers, but the result of carefully extending a different mathematical structure. The apparent paradox disappears once the right question is asked. The problem was never arithmetic itself, but using the word “sum” without specifying exactly what operation we mean.

See omnystudio.com/listener for privacy information.

There are just as many even numbers as natural numbers, even though the evens appear to be only half of them. And that is only the beginning. This chapter explores how Georg Cantor turned infinity into a mathematical object that could be compared, ordered and separated into different sizes. Natural numbers, integers and rational numbers share one cardinality, while the real numbers form a strictly larger infinity. Through one-to-one correspondences and Cantor’s diagonal argument, an even stranger conclusion emerges: there is not one infinity, and there is no largest one. A bigger infinity can always be constructed.

See omnystudio.com/listener for privacy information.

A barber shaves every man who does not shave himself, and only those men. So who shaves the barber? Behind this simple puzzle lies a contradiction that shook the foundations of mathematics. This chapter explores Russell’s paradox, the danger of unrestricted set formation and its impact on Frege’s logical program. The response was not to abandon set theory, but to rebuild it with far stricter rules. Sometimes a mathematical crisis does not begin with an impossible equation, but with a perfectly clear definition that turns out to be too dangerous to exist.

See omnystudio.com/listener for privacy information.

A continuous curve should look almost straight if we zoom in far enough. At least, that once seemed reasonable. In the nineteenth century, functions such as Weierstrass’s showed otherwise: they could be continuous everywhere and differentiable nowhere. This chapter explores how these apparently monstrous objects forced mathematicians to separate continuity from smoothness and rebuild parts of analysis around far more rigorous definitions. What first looked like a pathological exception revealed a deeper problem: intuition had quietly assigned properties to continuity that continuity itself had never promised.

See omnystudio.com/listener for privacy information.

A sentence written in the margin of a book kept mathematicians busy for more than three centuries. Fermat claimed to possess a remarkable proof of a surprisingly simple equation, but never wrote it down. This chapter follows the attempts of Euler, Sophie Germain and Kummer, the failed proofs that exposed new mathematical problems, and the unexpected path through elliptic curves, modular forms and Andrew Wiles. Even the proof announced in 1993 contained a gap that had to be repaired. The final argument settled the problem in 1995, while leaving one mystery untouched: what Fermat actually believed he could have written if only the margin had been larger.

See omnystudio.com/listener for privacy information.