The four color theorem states that any flat map needs no more than four colors so neighboring regions always differ.

The longer version

Colouring a flat map means assigning shades so that regions sharing a border, not merely a corner, never match. Five shades are easy to guarantee by a short argument about average region size. Cutting that to four resisted every attempt for more than a century, because the awkward arrangements multiply.

The eventual proof, completed in the nineteen seventies, reduced the problem to a finite list of special arrangements and then had a machine verify each one, nearly two thousand in the first version. Philosophers objected that no person could check it by hand, though later work trimmed the list and tightened the argument. Maps drawn on other surfaces need more shades.

Where this entry sits

This section collects odd corners of mathematics, from stubborn prime numbers to counting systems older than modern schools. Expect famous constants, probability puzzles, shapes that break everyday intuition, and numbers far too large to picture. The full list sits on the Numbers and Math page, where every entry is listed in order.