The whole numbers
, read "the sum of r from r = 1 to n", means 1 + 2 + 3 + … + n. Its closed formula is . For n = 4, 1 + 2 + 3 + 4 = 10, and 4 × 5 ÷ 2 = 10.
Write the sum forwards and backwards and add the two lines column by column: 1 + n, 2 + (n − 1), 3 + (n − 2), and so on. Every column adds to n + 1, and there are n columns, so twice the sum is n(n + 1).
1 + 2 + … + n is a staircase; a second copy turned upside down fills its gaps
Set n = 6 and slide the second staircase in
The staircase 1 + 2 + 3 + 4 and an upside-down copy. Slide the copy in: the two make a 4 by 5 rectangle of 20 blocks, so one staircase is 10.
The squares
has its own formula: . For n = 3, 1 + 4 + 9 = 14, and 3 × 4 × 7 ÷ 6 = 84 ÷ 6 = 14. For n = 4, 1 + 4 + 9 + 16 = 30, and 4 × 5 × 9 ÷ 6 = 30.
Induction proves it for every n. At n = 1 both sides are 1, since 1 × 2 × 3 ÷ 6 = 1. Suppose it holds for n, and add the next square, : . That is the formula with n + 1 in place of n.
For large n the formula is close to , the area under from 0 to n. Multiplied out, , so the sum is always a little more than that area.
The totals 1, 5, 14, 30, 55, 91 for n = 1 to 6, with the vertical scale squeezed. The gold curve passes through every one; the dashed curve runs just below them.
The cubes
The cubes add to the square of the plain sum: . For n = 3, 1 + 8 + 27 = 36, which is , and 1 + 2 + 3 = 6. For n = 4, .
Here is why. Write for the nth triangle number. Going from to adds n, so , and the two add to , since . So : each cube is the step from one squared triangle number to the next. For n = 3, .
Adding the steps from the start, , , , , … climb by 1, 8, 27, 64, …, so the sum of the first n cubes is the square of the nth triangle number.
Building other sums
A sum splits term by term, and a constant factor comes out in front: . Taking out gives . For n = 3 the terms are 3, 8 and 15, which add to 26, and 3 × 4 × 13 ÷ 6 = 26.
In the same way . For n = 4: 2 + 6 + 12 + 20 = 40, and 4 × 5 × 6 ÷ 3 = 40.
A constant adds n times: , so , not 3. That is how , the sum of the first n odd numbers.
A sum that does not start at 1 is a difference of two sums from 1. Write S(n) for the sum of the first n squares. The squares from to add to S(20) − S(10): 20 × 21 × 41 ÷ 6 − 10 × 11 × 21 ÷ 6 = 2870 − 385 = 2485.
The usual mistakes
Using for . For n = 4 that gives 10 instead of 30.
Squaring the sum for , or cubing it for . For n = 3, is 36, not 14, and is 216, not 36. The cubes add to the square of ; the squares do not.
Splitting a sum of products into a product of sums. is not : for n = 3 that is 14 against 36.
Writing as 3. Each of the n terms is 3, so the sum is 3n.
Subtracting the wrong sum for a range. The squares from 11 to 20 are S(20) − S(10); S(20) − S(11) leaves out .
A stack of square layers
In the application below, layer k of a stack holds pipes, so a stack of n layers holds pipes, and the formula replaces adding the layers one by one.
Worked example: A Pipe Yard's Square Layers: How Many Pipes a Stack Holds and How Tall It May Be
Question A pipe yard stacks pipes in square layers. The top layer is a single pipe, the layer below it is a 2 by 2 square of 4 pipes, and the kth layer from the top is a k by k square of k2 pipes. (a) How many pipes are in a stack of 12 layers? (b) The yard allows at most 1000 pipes in one stack. What is the greatest number of layers allowed, and how many of the 1000 does that stack leave unused?
1.Count the pipes layer by layer. Layer 1 holds 1 pipe, layer 2 holds 22 = 4, layer 3 holds 32 = 9, and layer k holds k2. A stack of n layers therefore holds ∑k=1n k2 pipes, the sum of the first n square numbers.
Layer k is a k by k square, so it holds k2 pipes. 2.Use the closed formula rather than adding twelve terms: ∑k=1n k2 = n(n+1)(2n+1)6. With n = 12 the top is 12 × 13 × 25.
A stack of 12 layers holds ∑k=112 k2 pipes. 3.(a) 12 × 13 × 256 = 39006 = 650 pipes. Check by adding the twelve layers one at a time: 1 + 4 + 9 + 16 + 25 + 36 + 49 + 64 + 81 + 100 + 121 + 144 = 650.
(a) 12 × 13 × 256 = 650 pipes. 4.For part (b) the formula is quicker than a table. With n = 13 the stack holds 13 × 14 × 276 = 819 pipes, which is inside the limit. With n = 14 it holds 14 × 15 × 296 = 1015 pipes, which is over it.
13 layers hold 819 pipes, and 14 layers would hold 1015, over the limit. 5.(b) The greatest stack allowed is 13 layers. It holds 819 pipes, so it leaves 1000 − 819 = 181 pipes of the allowance unused. A fourteenth layer would need 142 = 196 more pipes, and only 181 are allowed.
(b) 13 layers, leaving 1000 − 819 = 181 of the allowance unused.
Answer: (a) 650 pipes; (b) 13 layers, holding 819 pipes and leaving 181 of the 1000 unused
Common mistakes
- Reaching for n(n+1)2, the formula for the sum of the first n whole numbers, because it is the one most often met. That adds 1 + 2 + … + 12 = 78, the pipes along one edge of each layer, not the pipes in the layers themselves. The square numbers have a formula of their own, n(n+1)(2n+1)6.
- Turning the limit into a division, such as 1000 ÷ 12, and rounding the result to a number of layers. The limit is on the total, so the test is whether the whole sum for a given n stays under 1000. Here n = 13 gives 819 and n = 14 gives 1015, so the answer is 13 and no rounding came into it.