Skip to content
Vamshi Jandhyala

Books · Number Puzzles

Chapter 8

Dots in Triangles and Pyramids

  1. The triangular numbers count dots in a triangular array, 1,3,6,10,1, 3, 6, 10, \dots, the nnth being 1+2++n1 + 2 + \dots + n. If a triangle is built from 27012701 dots, how many more dots are needed for the next larger triangle?

  2. The numbers 11 and 3636 are each at once a triangular number and a perfect square. What are the next four numbers that are both?

  3. Stacking triangles gives the tetrahedral numbers 1,4,10,20,1, 4, 10, 20, \dots, the nnth being the sum of the first nn triangular numbers. Show that two consecutive tetrahedral numbers add to a square pyramidal number (the count of cannonballs in a square-based pyramid, 12+22++n21^2 + 2^2 + \dots + n^2). Then find every square pyramidal number, other than 11, that is also a perfect square.

Solution

Part 1. The nnth triangular number is n(n+1)/2n(n+1)/2. Setting this to 27012701 gives n(n+1)=5402n(n+1) = 5402, so n=73n = 73 (since 73×74=540273 \times 74 = 5402). The next triangle simply adds one more row, of 7474 dots. So 7474 more are needed.

Part 2. The next four square-triangular numbers after 11 and 3636 are 1225=352,41616=2042,1413721=11892,48024900=69302,\begin{gathered} 1225 = 35^2, \quad 41616 = 204^2,\\ 1413721 = 1189^2, \quad 48024900 = 6930^2, \end{gathered} and each is also triangular (T49T_{49}, T288T_{288}, T1681T_{1681}, T9800T_{9800}). They obey the tidy rule an+1=34anan1+2a_{n+1} = 34 a_n - a_{n-1} + 2: for instance 34×361+2=122534 \times 36 - 1 + 2 = 1225 and 34×122536+2=4161634 \times 1225 - 36 + 2 = 41616.

Part 3. Writing the tetrahedral number as T ⁣en=n(n+1)(n+2)/6T\!e_n = n(n+1)(n+2)/6, T ⁣en+T ⁣en1=n(n+1)(n+2)6+(n1)n(n+1)6=n(n+1)[(n+2)+(n1)]6=n(n+1)(2n+1)6,\begin{aligned} T\!e_n + T\!e_{n-1} &= \frac{n(n+1)(n+2)}{6} + \frac{(n-1)n(n+1)}{6}\\ &= \frac{n(n+1)\bigl[(n+2)+(n-1)\bigr]}{6} = \frac{n(n+1)(2n+1)}{6}, \end{aligned} which is exactly 12+22++n21^2 + 2^2 + \dots + n^2, the square pyramidal number. As for which of these are perfect squares: apart from the trivial 11, the only one is 4900=702=12+22++242.4900 = 70^2 = 1^2 + 2^2 + \dots + 24^2. This is the famous cannonball problem, that a square layer of 70×7070 \times 70 holds exactly as many as a square pyramid 2424 high. That 49004900 is the sole non-trivial solution was proved by G. N. Watson in 19181918, so we take it as settled rather than reprove it here.