What an arithmetic series is
An arithmetic series is the SUM of the terms of an arithmetic sequence. The sequence 2, 4, 6, 8 has terms; the series 2 + 4 + 6 + 8 is what you get when you add them. We write Sₙ for the sum of the first n terms, read 'S sub n'. So for 2 + 4 + 6 + 8 + ..., S₄ = 20.
Sn=t1+t2+t3+⋯+tn Why it works
A sequence is a list; a series is a total. The whole point of this section is that because the terms grow by a fixed step d, their total has hidden structure you can exploit, instead of grinding through the addition term by term.
Gauss's pairing trick
Write the series forwards, then write it again backwards underneath, and add the two rows column by column. Every column gives the SAME total, t₁ + tₙ. There are n columns, so the doubled sum is n(t₁ + tₙ), and the real sum is half of that.
2Sn=n(t1+tn) Why it works
As you move right along the top row each term goes UP by d, and the bottom row goes DOWN by d, so every column is balanced and constant. For 1 to 100, each of the 100 columns sums to 101, giving 2S = 10100, so S = 5050. That is exactly how 10-year-old Gauss beat his teacher.
The sum formula (last-term version)
Because every paired column equals t₁ + tₙ and there are n of them, dividing by 2 gives the clean formula. Read it as 'number of terms times the average of the first and last term.' Use this version when you already know the last term tₙ.
Sn=2n(t1+tn) Why it works
In an arithmetic sequence the average of all the terms equals the average of just the first and last, because the terms are evenly spaced and symmetric about the middle. So total = count times average = n times (t₁ + tₙ)/2. This is why the formula feels like the area of a rectangle of disks: two triangles joined make an n by (t₁ + tₙ) rectangle.
The sum formula (common-difference version)
If you do NOT know the last term but you know the common difference d, substitute tₙ = t₁ + (n-1)d into the last-term formula. This packages everything in terms of t₁, d, and n so you never need a separate step to find tₙ.
Sn=2n[2t1+(n−1)d] Why it works
It is the SAME formula in disguise. Replace tₙ with what it must equal, t₁ + (n-1)d, and t₁ + tₙ becomes 2t₁ + (n-1)d. Both formulas always give the same answer; you just pick whichever matches the information you were handed.
Working backward to a missing quantity
The sum formula links t₁, d, n, and Sₙ. Given any three of these (or two sums), you can solve for the fourth. Often this means plugging in and solving a linear equation, or, when two different sums are given, solving a system of two equations.
Sn=2n[2t1+(n−1)d] Why it works
The formula is a single equation with four slots. Algebra does not care which slot is the unknown. When a problem gives you S₂ and S₄, each becomes one equation in t₁ and d, and subtracting them eliminates t₁ so d pops right out, just like solving any linear system.
From real situation to series
Many counting problems hide an arithmetic series: a clock chiming 1, 2, 3, ... times each hour; cans stacked 1, 2, 3, ... per row; a falling object covering 5, 15, 25, ... metres each second. Identify t₁ and d from the pattern, decide n, then apply a sum formula.
Why it works
The skill is translation, not new math. Ask: what is the first count, by how much does each step change, and how many steps are there? Once you name t₁, d, and n, the abstract formula does the heavy lifting and turns a tedious tally into one calculation.