Ps1 - Standard summation formulae

Ps1 - Standard summation formulae

Sum expressions involving integers, squares and cubes without adding every term. You will combine the standard formulae, handle a changed starting index, and prove the square and cube formulae when a question requires justification.

Combining the standard sums

What is 12+32+52+⋯+19921^2+3^2+5^2+\cdots+199^2, without a hundred separate squarings?

The odd numbers are 2r−12r-1, for r=1,2,…,100r=1, 2,\ldots,100. Squaring gives (2r−1)2=4r2−4r+1(2r-1)^2=4r^2-4r+1. That turns the puzzle into three familiar types of sum. We will finish it after practising that conversion.

You already know

∑r=1nur\sum_{r=1}^{n}u_r adds the terms for integer indices 11 through nn, inclusive. Split a sum across addition and take constant factors outside it. The sum of nn copies of cc is cncn, not cc.

The three formulae below all start at 11. Match both the expression and the limits before substituting.

Integers, squares and cubes

For every positive integer nn,

∑r=1nr=n(n+1)2∑r=1nr2=n(n+1)(2n+1)6∑r=1nr3=n2(n+1)24\begin{aligned} \sum_{r=1}^{n}r&=\frac{n(n+1)}2 \\ \sum_{r=1}^{n}r^2&=\frac{n(n+1)(2n+1)}6 \\ \sum_{r=1}^{n}r^3&=\frac{n^2(n+1)^2}4 \end{aligned}

The integer sum follows from the arithmetic-series formula in the booklet. The square and cube formulae are printed explicitly.

In the formula booklet.

The cube formula has a lovely consequence: the sum of the first nn cubes is the square of the sum of the first nn integers. For n=4n=4, 1+8+27+64=100=(1+2+3+4)21+8+27+64=100=(1+2+3+4)^2. The nested-square picture makes the identity less mysterious.

[DIAGRAM: asset_name: Cubes inside a triangular-number square; asset_slug: cubes_triangular_square; caption: Successive square bands have areas 1 cubed, 2 cubed, 3 cubed and 4 cubed; description: Nested squares with side lengths 1, 3, 6 and 10 occupy a ten by ten square. The successive L-shaped bands have areas 1, 8, 27 and 64, labelled in a colour-matched legend. The full side is labelled 1+2+3+4=10 and the total area is 100.]
Successive square bands have areas 1 cubed, 2 cubed, 3 cubed and 4 cubed

Worked example 1: expanding before summing

Question. Find ∑r=1nr(r+1)\sum_{r=1}^{n}r(r+1) in factorised form.

Plan. Expand, apply the integer and square formulae, then factorise.

∑r=1nr(r+1)=∑r=1nr2+∑r=1nrexpand first=n(n+1)(2n+1)6+n(n+1)2standard sums=n(n+1)6(2n+1+3)common factor=n(n+1)(n+2)3simplify\begin{aligned} \sum_{r=1}^{n}r(r+1)&=\sum_{r=1}^{n}r^2+\sum_{r=1}^{n}r && \text{expand first} \\ &=\frac{n(n+1)(2n+1)}6+\frac{n(n+1)}2 && \text{standard sums} \\ &=\frac{n(n+1)}6(2n+1+3) && \text{common factor} \\ &=\frac{n(n+1)(n+2)}3 && \text{simplify} \end{aligned}

Why this step? Expansion exposes the two formulae already available, so there is no separate product-sum formula to memorise.

Answer. 13n(n+1)(n+2)\frac13n(n+1)(n+2).

Check. At n=2n=2, the sum is 2+6=82+6=8, and the formula gives 2(3)(4)/3=82(3)(4)/3=8.

Change only the second factor from r+1r+1 to r+3r+3. The coefficient of the integer sum changes.

Worked example 2: a changed linear factor

Question. Show that ∑r=1nr(r+3)=13n(n+1)(n+5)\sum_{r=1}^{n}r(r+3)=\frac13n(n+1)(n+5).

Plan. Expand the product, separate the sums and simplify to the given expression.

∑r=1nr(r+3)=∑r=1nr2+3∑r=1nrexpand=n(n+1)(2n+1)6+3n(n+1)2substitute=n(n+1)6(2n+1+9)common denominator=n(n+1)(n+5)3factorise\begin{aligned} \sum_{r=1}^{n}r(r+3)&=\sum_{r=1}^{n}r^2+3\sum_{r=1}^{n}r && \text{expand} \\ &=\frac{n(n+1)(2n+1)}6+\frac{3n(n+1)}2 && \text{substitute} \\ &=\frac{n(n+1)}6(2n+1+9) && \text{common denominator} \\ &=\frac{n(n+1)(n+5)}3 && \text{factorise} \end{aligned}

Why this step? The factor 33 multiplies the whole integer sum, since it occurs at every index.

Answer. The required expression follows.

Check. For n=1n=1, both sides equal 44.

A “show that” answer needs the expansion and formula substitutions. Quoting the given expression does not establish it.

Watch out

Wrong: ∑(r2+3r)=∑r2+3\sum(r^2+3r)=\sum r^2+3. Right: ∑r2+3∑r\sum r^2+3\sum r. The 3r3r contribution occurs at every index.

Change the second factor once more and choose the same route.

Changed limits and shifted terms

A sum starting after 11 is the full sum minus the unwanted beginning; a shifted expression is expanded before the standard formulae are used.

For example, summing from r=4r=4 through r=10r=10 includes seven terms, and removes the terms indexed 1,2,31, 2, 3. It does not remove the term indexed 44.

Subtracting an initial section

If 1≤m≤n1\le m\le n are integers,

∑r=mnur=∑r=1nur−∑r=1m−1ur\sum_{r=m}^{n}u_r=\sum_{r=1}^{n}u_r-\sum_{r=1}^{m-1}u_r

When m=1m=1, the second sum is empty and equals zero.

Not in the formula booklet: learn it.

Write the last removed index explicitly to prevent an off-by-one error.

Worked example 3: a tail of squares

Question. Find ∑r=612r2\sum_{r=6}^{12}r^2.

Plan. Subtract the first five squares from the first twelve squares.

∑r=612r2=∑r=112r2−∑r=15r2remove indices 1 to 5=12(13)(25)6−5(6)(11)6square formula=650−55=595evaluate\begin{aligned} \sum_{r=6}^{12}r^2&=\sum_{r=1}^{12}r^2-\sum_{r=1}^{5}r^2 && \text{remove indices }1\text{ to }5 \\ &=\frac{12(13)(25)}6-\frac{5(6)(11)}6 && \text{square formula} \\ &=650-55=595 && \text{evaluate} \end{aligned}

Why this step? Subtracting through 66 would remove the first term you want to keep.

Answer. 595595.

Check. 36+49+64+81+100+121+144=59536+49+64+81+100+121+144=595.

Now change the starting index to n+1n+1, with the upper index 2n2n. The subtraction becomes symbolic.

Worked example 4: the second block of squares

Question. Show that ∑r=n+12nr2=16n(2n+1)(7n+1)\sum_{r=n+1}^{2n}r^2=\frac16n(2n+1)(7n+1), for positive integers nn.

Plan. Subtract the first nn squares from the first 2n2n squares.

∑r=n+12nr2=2n(2n+1)(4n+1)6−n(n+1)(2n+1)6initial block removed=n(2n+1)6(2(4n+1)−(n+1))factorise=n(2n+1)(7n+1)6collect terms\begin{aligned} \sum_{r=n+1}^{2n}r^2&=\frac{2n(2n+1)(4n+1)}6-\frac{n(n+1)(2n+1)}6 && \text{initial block removed} \\ &=\frac{n(2n+1)}6\bigl(2(4n+1)-(n+1)\bigr) && \text{factorise} \\ &=\frac{n(2n+1)(7n+1)}6 && \text{collect terms} \end{aligned}

Why this step? The square formula uses its upper index everywhere: replacing nn by 2n2n changes 2n+12n+1 to 4n+14n+1 too.

Answer. The given formula is established.

Check. At n=2n=2, 32+42=25=2(5)(15)/63^2+4^2=25=2(5)(15)/6.

For the opening odd squares, expansion now gives

∑r=1n(2r−1)2=4n(n+1)(2n+1)6−4n(n+1)2+n=n(4n2−1)3\begin{aligned} \sum_{r=1}^{n}(2r-1)^2 &=4\frac{n(n+1)(2n+1)}6-4\frac{n(n+1)}2+n \\ &=\frac{n(4n^2-1)}3 \end{aligned}

Thus the hundred odd squares total 100(39999)/3=1 333 300100(39999)/3=1\,333\,300. This derived identity is not printed separately in the booklet.

Watch out

Wrong: ∑r=1n(r+1)2\sum_{r=1}^{n}(r+1)^2 is the first nn squares. Right: either expand (r+1)2(r+1)^2, or sum the squares from 22 to n+1n+1. The shift changes the terms.

Apply block subtraction with cubes instead of squares.

Proving a summation formula

A supplied formula can still need a proof: induction verifies the first sum and shows that adding the next term preserves the claimed form.

You already know

An induction proof needs a base case, an assumption for an arbitrary integer kk, an implication proving the case k+1k+1, and a conclusion. The next sum is the previous sum plus its next term.

Use the assumed expression for the first kk terms. Substituting k+1k+1 into the target formula alone would just restate what you must prove.

Worked example 5: proving the square formula

Question. Prove by induction that ∑r=1nr2=16n(n+1)(2n+1)\sum_{r=1}^{n}r^2=\frac16n(n+1)(2n+1) for all positive integers nn.

Plan. Check n=1n=1, assume the sum through kk, then add (k+1)2(k+1)^2.

For n=1n=1, both sides equal 11. Assume the result for an arbitrary integer k≥1k\ge1. Then

∑r=1k+1r2=k(k+1)(2k+1)6+(k+1)2use the assumption=k+16(k(2k+1)+6(k+1))common factor=(k+1)(2k2+7k+6)6expand=(k+1)(k+2)(2k+3)6factorise\begin{aligned} \sum_{r=1}^{k+1}r^2&=\frac{k(k+1)(2k+1)}6+(k+1)^2 && \text{use the assumption} \\ &=\frac{k+1}{6}\bigl(k(2k+1)+6(k+1)\bigr) && \text{common factor} \\ &=\frac{(k+1)(2k^2+7k+6)}6 && \text{expand} \\ &=\frac{(k+1)(k+2)(2k+3)}6 && \text{factorise} \end{aligned}

Why this step? The last line is the proposed formula at n=k+1n=k+1, because 2(k+1)+1=2k+32(k+1)+1=2k+3.

Answer. The result holds for 11, and truth for kk implies truth for k+1k+1; hence it holds for every positive integer nn, by induction.

Check. At k=2k=2, 5+9=14=3(4)(7)/65+9=14=3(4)(7)/6.

Change only the power from squares to cubes. The added term becomes (k+1)3(k+1)^3.

Worked example 6: proving the cube formula

Question. Prove by induction that ∑r=1nr3=14n2(n+1)2\sum_{r=1}^{n}r^3=\frac14n^2(n+1)^2 for positive integers nn.

Plan. Verify n=1n=1, assume the sum through kk, and add the next cube.

At n=1n=1, both sides equal 11. Assume the result for an arbitrary integer k≥1k\ge1. Then

∑r=1k+1r3=k2(k+1)24+(k+1)3use the assumption=(k+1)24(k2+4k+4)common factor=(k+1)2(k+2)24perfect square\begin{aligned} \sum_{r=1}^{k+1}r^3&=\frac{k^2(k+1)^2}{4}+(k+1)^3 && \text{use the assumption} \\ &=\frac{(k+1)^2}{4}\bigl(k^2+4k+4\bigr) && \text{common factor} \\ &=\frac{(k+1)^2(k+2)^2}{4} && \text{perfect square} \end{aligned}

Why this step? Factoring out (k+1)2(k+1)^2 leaves the exact square needed for the next case.

Answer. The result holds for 11, and truth for kk implies truth for k+1k+1; therefore it holds for all positive integers, by induction.

Check. At k=2k=2, 9+27=36=32(42)/49+27=36=3^2(4^2)/4.

These proofs explain the formulae printed in the booklet; the induction arguments themselves are not provided.

Watch out

Wrong: add k3k^3 to the sum through kk. Right: add (k+1)3(k+1)^3. The term indexed kk is already included.

Keep the cube method but multiply each input by 22. The added term and the claimed total both change.

Quick Recap

  • Expand polynomial summands before applying the standard sums.
  • A constant is added once for each index.
  • For changed limits, subtract through the index immediately before the desired start.
  • Proving a supplied formula still needs an actual induction step and conclusion.

The hundred odd squares add to 1 333 3001\,333\,300.