Tetrahedral Numbers – Stacking Cannonballs
This is one of those deceptively simple topics which actually contains a lot of mathematics – and it involves how spheres can be stacked, and how they can be stacked most efficiently. Starting off with the basics we can explore the sequence:
1, 4, 10, 20, 35, 56….
These are the total number of cannons in a stack as the stack gets higher. From the diagram we can see that this sequence is in fact a sum of the triangular numbers:
S1 = 1
So we can sum the first n triangular numbers to get the general term of the tetrahedral numbers. Now, the general term of the triangular numbers is 0.5n2 + 0.5n therefore we can think of tetrahedral numbers as the summation:
But we have known results for the 2 summations on the right hand side:
and when we add these two together (with a bit of algebraic manipulation!) we get:
This is the general formula for the total number of cannonballs in a stack n rows high. We can notice that this is also the same as the binomial coefficient:
Therefore we also can find the tetrahedral numbers in Pascals’ triangle (4th diagonal column above).
The classic maths puzzle (called the cannonball problem), which asks which tetrahedral number is also a square number was proved in 1878. It turns out there are only 3 possible answers. The first square number (1) is also a tetrahedral number, as is the second square number (4), as is the 140th square number (19,600).
We can also look at something called the generating function of the sequence. This is a polynomial whose coefficients give the sequence terms. In this case the generating function is:
Having looked at some of the basic ideas behind the maths of stacking spheres we can look at a much more complicated mathematical problem. This is called Kepler’s Conjecture – and was posed 400 years ago. Kepler was a 17th century mathematician who in 1611 conjectured that there was no way to pack spheres to make better use of the given space than the stack above. The spheres pictured above fill about 74% of the given space. This was thought to be intuitively true – but unproven. It was chosen by Hilbert in the 18th century as one of his famous 23 unsolved problems. Despite much mathematical efforts it was only finally proved in 1998.
If you like this post you might also like:
The Poincare Conjecture – the search for a solution to one of mathematics greatest problems.