letx=

Sequences and series

Sum of the first n whole numbers

Adds 1 + 2 + … + n instantly; the answers 1, 3, 6, 10, 15, … are the triangular numbers.

1+2+3+⋯+n=n(n+1)2
Sigma notation∑k=1nk=n(n+1)2

Calculator

The live calculator needs JavaScript. The worked example below shows the same steps it would.

See it move

n + 1 = 7
  • Dark dots: 1 + 2 + … + 6. Light dots: the same staircase turned round. Together: 6 × 7 = 42, so the sum is half of that: 21.

What the symbols mean

S
the sum 1+2+⋯+n
n
the last (and largest) number added

When to use it

Use it for handshakes in a group (each of n people shakes hands with everyone else: n(n−1)2, the sum up to n−1), the number of pins or cans in a triangular stack, or any running total of 1, 2, 3, … . Solving for n tells you whether a number is triangular.

Worked example

What is 1 + 2 + 3 + … + 100? (n = 100)

  1. Start from the formula.

    S=n⁢(n+1)2
  2. Substitute n = 100 and work it out.

    S=100·(100+1)2
    =100·1012
    =101002
    =5050

Answer S = 5050

Why it works

Write the sum twice, once forwards and once backwards, and add column by column: every column is n+1, and there are n columns, so twice the sum is n(n+1). The picture shows the same idea with dots.

Common mistakes

  • Forgetting to halve: n(n+1) counts every number twice.
  • Using it for sums that do not start at 1. For 51 + … + 100, subtract the sum up to 50 from the sum up to 100.