Where the Consecutive Sum Formula Comes From

Most students meet the formula for 1 + 2 + ... + n as a rule to memorise. The argument behind it is short, entirely visual, and explains why the 2 sits underneath.

--

Most students meet as a rule to memorise. It is worth seeing where it comes from, because the argument is short, entirely visual, and explains why the sits underneath.

Concept Pair the first with the last

To add through , do not work left to right. Pair the smallest with the largest, then work inward:

Every pair totals the same , and there are of them:

The pairs match because as one number climbs by , its partner falls by . Their total cannot change.

Example What if one is left over?

Add through . There is now an odd count of numbers, so the middle one has no partner.

Pairs: , , , , — five pairs of
The middle number is left over
The sum is

The method still works, but it now has two cases and a leftover to remember. The next idea removes that awkwardness completely.

Theorem Write the sum twice

Writing the sum forwards and backwards, then adding the two lines column by column, gives .

Call the sum and write it out twice, the second time in reverse:

Add the two lines. Each column pairs a number with its mirror, and every column totals :

There are columns, so
Divide both sides by :

Doubling the sum is what makes the leftover problem vanish. With two copies there is always an even number of terms, so nothing is ever stranded — and the in the denominator is simply undoing that doubling.

Example Checking against both cases

A derivation is only convincing if it reproduces the answers found by hand.

: — matches the pairing result
: — matches the leftover result
Both cases agree, even and odd alike

Notice that one of and is always even, so the division by never leaves a fraction. The formula always returns a whole number, as a count of this kind must.

Summary
  1. Pairing the first term with the last gives pairs of equal total.
  2. Pairs match because one number rises exactly as the other falls.
  3. With an odd count of numbers the middle term is left unpaired and must be added separately.
  4. Writing the sum forwards and backwards avoids that problem entirely.
  5. Every column then totals , and there are columns, so .
  6. Halving gives , which works for every .