Triangle-Stacking Proof That 1 + 2 + ... + n = n(n+1)/2, Synced With Induction

The formula 1 + 2 + 3 + \dots + n = \frac{n(n+1)}{2} is the first result every student proves by induction, and the first result every student believes without induction because it has a beautiful geometric picture. Stack the numbers 1, 2, 3, \dots, n as rows of dots:

Row 1: one dot.
Row 2: two dots.
Row 3: three dots.
...
Row n: n dots.

You get a triangular pile of 1 + 2 + \dots + n dots. Now pair this triangle with a mirror-image triangle flipped upside-down. The two triangles together form a rectangle that is n dots wide and n + 1 dots tall — area n(n+1). The original triangle is exactly half that. So 1 + 2 + \dots + n = \frac{n(n+1)}{2}.

That is the geometric proof. This article's animation lets you drag n from 1 up to 10, watching the triangle build row by row. At each step, the algebraic inductive step and the geometric picture move in lock-step: every new row on the picture is exactly the quantity added on the algebra side.

Build the triangle row by row

n = 1: show mirror triangle

Drag $n$ from $1$ to $12$. The blue triangle grows row by row (row $k$ has $k$ dots). The orange mirror triangle (toggle on/off) completes an $n \times (n+1)$ rectangle. Both the partial sum computed directly and the formula $n(n+1)/2$ are shown — they always agree.

The algebra and the picture, side by side

The standard induction proof of 1 + 2 + \dots + n = \frac{n(n+1)}{2} has two steps:

Base case (n = 1). The sum on the left is 1. The formula on the right is \frac{1 \cdot 2}{2} = 1. Match. One dot; one row.

Inductive step. Assume the formula holds at n = k:

1 + 2 + \dots + k = \frac{k(k+1)}{2}.

To show it holds at n = k + 1, add k + 1 to both sides:

1 + 2 + \dots + k + (k+1) = \frac{k(k+1)}{2} + (k+1).

Factor the right side:

\frac{k(k+1)}{2} + (k+1) = \frac{k(k+1) + 2(k+1)}{2} = \frac{(k+1)(k+2)}{2}.

This is exactly the formula at n = k + 1. Why the algebraic move mirrors the picture: adding k+1 to the partial sum is the algebraic version of pushing one more row of k+1 dots onto the bottom of the existing triangle. The factor (k+1)(k+2)/2 is the new triangle's count, because the new triangle has k+1 rows and the standard counting formula applies. The geometry and the algebra are not two proofs — they are the same proof, spoken in two languages.

The picture that makes the formula obvious

Here is the famous geometric picture, drawn once for n = 5 so you can see all the dots.

The blue triangle is $1 + 2 + 3 + 4 + 5 = 15$ dots. The orange upside-down triangle is also $15$ dots. Together they perfectly tile a $5 \times 6 = 30$-dot rectangle. So twice the original sum is $n(n+1)$, giving $1 + 2 + \dots + n = \frac{n(n+1)}{2}$.

What this teaches about induction

The triangle-stacking picture is not a replacement for the induction proof — it is a companion. Induction verifies the formula at every n from a base case and a mechanism. The triangle makes the formula visible at every n by giving you a physical object whose count is the partial sum.

When both exist for a statement, you should internalise both. The geometric picture is a memory aid: if you ever forget the formula, you can reconstruct it by mentally stacking rows of dots. The inductive proof is a verification: it certifies that the pattern you see extends to every n, even n = 10^9 where you would not actually stack 10^{18} dots.

Why a picture alone is not a rigorous proof: a picture shows the pattern for whatever n you drew. It does not, on its own, argue that the pattern continues for all n. The argument that the pattern continues is exactly the inductive step: adding one more row to the triangle of size k produces the triangle of size k+1. The geometric induction is as rigorous as the algebraic induction — in fact, it is the algebraic induction, told in pictures. But the picture for a specific n is evidence, not proof.

Three other induction formulas that have the same picture-algebra pairing

The formula 1 + 2 + \dots + n = \frac{n(n+1)}{2} is one of a family. Each member has a similar geometric companion and a similar inductive proof:

Odd numbers add to a square. 1 + 3 + 5 + \dots + (2n-1) = n^2. Geometrically: each new odd number is an L-shape around the previous square. Inductively: assume the formula at n = k, add 2(k+1) - 1 = 2k+1 to both sides, and verify the right side becomes (k+1)^2.
Sum of squares. 1^2 + 2^2 + \dots + n^2 = \frac{n(n+1)(2n+1)}{6}. Less visual than the triangle, but still provable by the same inductive mechanism. The geometric picture here involves stacking square layers; it is harder to draw on paper but the algebra is tidy.
Sum of cubes is a square. 1^3 + 2^3 + \dots + n^3 = \left(\frac{n(n+1)}{2}\right)^2. A beautiful coincidence: the sum of cubes is the square of the sum of the first n integers. The induction proof is straightforward; the picture involves a three-dimensional stacking argument.

Every one of these is provable by the same machinery you see in the triangle example: verify the base case, do the algebra for the inductive step, note that the right side at k + 1 equals what the formula predicts. The pictures are different but the rhythm is identical.

The one-line takeaway

The triangle-stacking picture and the inductive proof are two renderings of the same proof. Each new row on the picture is the +(k+1) in the algebra. If you can build the triangle row by row, you can write the induction proof — they are the same thought.