Chapter 8
Dots in Triangles and Pyramids
The triangular numbers count dots in a triangular array, , the th being . If a triangle is built from dots, how many more dots are needed for the next larger triangle?
The numbers and are each at once a triangular number and a perfect square. What are the next four numbers that are both?
Stacking triangles gives the tetrahedral numbers , the th being the sum of the first triangular numbers. Show that two consecutive tetrahedral numbers add to a square pyramidal number (the count of cannonballs in a square-based pyramid, ). Then find every square pyramidal number, other than , that is also a perfect square.
Solution
Part 1. The th triangular number is . Setting this to gives , so (since ). The next triangle simply adds one more row, of dots. So more are needed.
Part 2. The next four square-triangular numbers after and are and each is also triangular (, , , ). They obey the tidy rule : for instance and .
Part 3. Writing the tetrahedral number as , which is exactly , the square pyramidal number. As for which of these are perfect squares: apart from the trivial , the only one is This is the famous cannonball problem, that a square layer of holds exactly as many as a square pyramid high. That is the sole non-trivial solution was proved by G. N. Watson in , so we take it as settled rather than reprove it here.