Series

Figurate numbers — the series

6 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. Odd numbers as square shells. Nested L-shaped shells of 1, 3, 5 … 11 cells stack into a 6 by 6 square.

    Every square is a stack of odd numbers

    Add up the odd numbers in order and the running totals are 1, 4, 9, 16, 25. This is not a coincidence, and the reason fits in a single picture.

    part 1 · geometry
  2. The sum of the first 6 squares, as a staircase over a curve. Bars of height k^2 for k from 1 to 6, totalling 91, drawn over the curve y = x^2, whose area up to 6 is 72.00. The slivers between staircase and curve hold 19.00, close to half the last bar.

    Sums of powers, read off a staircase

    Add the first n squares, or cubes, or seventh powers, and the answer is always a polynomial in n. Its first term is the area under a curve, its second is half of the last step, and every term after that is a correction for the corners of a staircase — which is where the Bernoulli numbers come from, and why they eventually grow without bound.

    part 2 · geometry
  3. 100 as three triangular numbers. 100 drawn as three triangles of dots with 36, 36 and 28 dots. There are 6 such decompositions.

    Three triangular numbers, and no fewer

    On 10 July 1796 Gauss wrote in his diary: ΕΥΡΗΚΑ — num = Δ + Δ + Δ. Every whole number is a sum of three triangular numbers. Two are not enough, and not by a little: the numbers that are sums of two thin out to a share of nought. Both facts are statements about squares in disguise, and one picture translates them.

    part 3 · geometry
  4. The fewest pentagonal numbers adding to each number up to 120. Fewest pentagonal numbers summing to 1..120; the most ever needed up to 20000 is 5, by 9, 21, 31, 43, 55, 89.

    Six numbers that need five pentagons

    In 1638 Fermat wrote that every whole number is a sum of three triangular numbers, four squares, five pentagonal numbers, six hexagonal numbers, and so on for every polygon — and that he had a proof he would not write down. The claim is true; Cauchy proved it in 1813. What the claim hides is how unequal the cases are. Triangles and squares need their full count infinitely often. For pentagons, only six numbers ever need all five — 9, 21, 31, 43, 55 and 89 — and from hexagons on, two apiece.

    part 4 · geometry
  5. The fifty-four sums of four weighted squares that reach every number. The 54 universal diagonal quaternary forms, as coefficient lists: 1,1,1,1; 1,1,1,2; 1,1,1,3; 1,1,1,4; 1,1,1,5; 1,1,1,6; 1,1,1,7; 1,1,2,2; 1,1,2,3; 1,1,2,4; 1,1,2,5; 1,1,2,6; 1,1,2,7; 1,1,2,8; 1,1,2,9; 1,1,2,10; 1,1,2,11; 1,1,2,12; 1,1,2,13; 1,1,2,14; 1,1,3,3; 1,1,3,4; 1,1,3,5; 1,1,3,6; 1,2,2,2; 1,2,2,3; 1,2,2,4; 1,2,2,5; 1,2,2,6; 1,2,2,7; 1,2,3,3; 1,2,3,4; 1,2,3,5; 1,2,3,6; 1,2,3,7; 1,2,3,8; 1,2,3,9; 1,2,3,10; 1,2,4,4; 1,2,4,5; 1,2,4,6; 1,2,4,7; 1,2,4,8; 1,2,4,9; 1,2,4,10; 1,2,4,11; 1,2,4,12; 1,2,4,13; 1,2,4,14; 1,2,5,6; 1,2,5,7; 1,2,5,8; 1,2,5,9; 1,2,5,10.

    Fifteen numbers decide every number

    Lagrange proved that x² + y² + z² + w² takes every whole value. Ramanujan asked which other sums of four weighted squares do, and in 1917 listed fifty-five. One of them is wrong: x² + 2y² + 5z² + 5w² misses 15. The mistake points at a theorem found eighty years later — to know whether such a form reaches every number, it is enough to check that it reaches 1, 2, 3, 5, 6, 7, 10, 14 and 15. Nine checks decide infinitely many cases, and the nine numbers come out of an escalation any one can run.

    part 5 · geometry
  6. Numbers made of pyramids. below 1000000: 241 need five; first 17, 27, 33, 52, 73, 82, 83, 103, 107, 137, 153, 162; last 343867 = 341376+1771+680+20+20.

    Five pyramids for every number

    Stack balls in triangular pyramids and the piles hold 1, 4, 10, 20, 35, … balls. Frederick Pollock guessed in 1850 that every whole number is a sum of at most five such piles. Seventeen needs five — 10 + 4 + 1 + 1 + 1 — and so do 240 other numbers, the largest 343,867; past that, every number up to ten million needs four or fewer. Eight is proved to be enough. Five is not, and the reason is the same one that makes the three-dimensional cousins of the classical theorems hard.

    part 6 · geometry

All series