Definition · Arithmetic sequenceA sequence in which the difference between consecutive terms is the same throughout. That number is the common difference d, and the recursive definition is aₙ = aₙ₋₁ + d together with a first term a₁.
3, 7, 11, 15, … has d = 4. 20, 17, 14, 11, … has d = -3; a negative common difference is ordinary and the formulas do not change. 5, 5, 5, 5, … has d = 0 and is arithmetic, which is a useful edge case rather than a trick.
Reaching aₙ from a₁ means adding d a certain number of times, and the number of times is the number of steps between the two positions:
a₁ = a₁
a₂ = a₁ + d
a₃ = a₁ + 2d
a₄ = a₁ + 3d
…
aₙ = a₁ + (n - 1)d the coefficient is one less than
the index, every time
Theorem · The n-th term of an arithmetic sequenceIf a₁ is the first term and d the common difference, then aₙ = a₁ + (n - 1)d for every n ≥ 1. Rearranged, d = (aₙ - a₁)/(n - 1), which recovers the common difference from the first term and any one other term. From two terms in general positions it is d = (aₙ - aₘ)/(n - m).
Plotted, an arithmetic sequence is a row of dots lying on a straight line of slope d — Lines, Functions and Graphs's slope, sampled at the integers. aₙ = a₁ + (n - 1)d is y = mx + c with the letters renamed, which is why a sequence with a constant difference is called linear.
Definition · Series and partial sumA series is the sum of the terms of a sequence. The sum of the first n terms is the n-th partial sum Sₙ = a₁ + a₂ + … + aₙ, also written Sₙ = Σ aₖ with k running from 1 to n. It is a number, not a list.
Theorem · The sum of an arithmetic seriesSₙ = n(a₁ + aₙ)/2. Substituting aₙ = a₁ + (n - 1)d gives the equivalent form Sₙ = (n/2)[2a₁ + (n - 1)d]. The first is convenient when the last term is known, the second when only a₁ and d are.
Write the sum out, and then write it out again in the opposite order: Sₙ = a₁ + (a₁ + d) + … + (aₙ - d) + aₙ and Sₙ = aₙ + (aₙ - d) + … + (a₁ + d) + a₁.
Add the two lines column by column. The first column gives a₁ + aₙ. The second gives (a₁ + d) + (aₙ - d) = a₁ + aₙ. Every column gives the same total, because each step of +d down the first line is matched by a step of -d up the second.
There are n columns and each totals a₁ + aₙ, so 2Sₙ = n(a₁ + aₙ), and dividing by 2 gives the formula. Nothing here depends on n being even or on the terms being positive.
□
Example · Gauss's sum1 + 2 + 3 + … + 100 is arithmetic with a₁ = 1, d = 1, a₁₀₀ = 100. So S₁₀₀ = 100(1 + 100)/2 = 50(101) = 5050. The story is that Gauss found this at school by pairing 1 with 100, 2 with 99, and so on: fifty pairs, each totalling 101.
Example · The first n odd numbers1, 3, 5, 7, … is arithmetic with a₁ = 1 and d = 2, so the n-th odd number is 1 + 2(n - 1) = 2n - 1 and Sₙ = n(1 + 2n - 1)/2 = n². The first five partial sums are 1, 4, 9, 16, 25, which is the fact that the odd numbers add up to the squares.
One last check that costs nothing: Sₙ = n(a₁ + aₙ)/2 says the sum is n times the average of the first and last terms. If 20 terms run from 5 to 81, the average is 43 and the sum should be near 860 — and it is exactly 860, because for an arithmetic sequence that average is exact rather than approximate.