Precalc
Section 11.2

Arithmetic Sequences

Arithmetic sequences are the most straightforward type on Exam 4, and they're great warm-up for the harder geometric and series problems. The sum formula also comes back when you do summation notation in section 9-3.

⚑ Quick Summary

An arithmetic sequence is the simplest kind of pattern: you pick a starting number and keep adding the same amount every time. Think of climbing stairs β€” each step takes you the same height higher. The number you add each time is called the common difference dd. If your sequence is 5, 8, 11, 14, ... then d=3d = 3 because you're adding 3 every step.

Explicit (nth term) formula
an=a1+(nβˆ’1)da_n = a_1 + (n - 1)d

Jumps directly to the nnth term without computing every term before it.

Recursive formula
an=anβˆ’1+da_n = a_{n-1} + d

Defines each term from the previous one; you also need the first term a1a_1.

πŸ“‹ Before You Start

Tap any item if you need a refresher:

Plain-English version

An arithmetic sequence is the simplest kind of pattern: you pick a starting number and keep adding the same amount every time. Think of climbing stairs β€” each step takes you the same height higher. The number you add each time is called the common difference dd. If your sequence is 5, 8, 11, 14, ... then d=3d = 3 because you're adding 3 every step.

The formula an=a1+(nβˆ’1)da_n = a_1 + (n-1)d is a shortcut to jump to any term without listing them all. Read it as: "start at a1a_1, then take (nβˆ’1)(n-1) jumps of size dd." Why (nβˆ’1)(n-1) and not nn? Because the first term is your starting point β€” you haven't jumped yet! So the 10th term means 9 jumps from the start.

When you add up all the terms in an arithmetic sequence, the trick is simple: the sum equals the average of the first and last term, multiplied by how many terms there are. That's Sn=n2(a1+an)S_n = \frac{n}{2}(a_1 + a_n). The legend goes that the mathematician Gauss figured this out as a child when his teacher told the class to add the numbers 1 through 100 β€” he paired 1+100, 2+99, 3+98, and so on, getting 50 pairs of 101 each, for a total of 5050.

If a problem gives you two terms (like the 4th and 10th), you can find dd by writing two equations from the formula and subtracting them. The a1a_1 terms cancel, and you're left with a simple equation for dd. Then plug dd back in to find a1a_1. Real-world examples of arithmetic sequences include seat counts in stadium rows, stacking patterns, and regular savings deposits.

Key Formulas

Explicit (nth term) formula
an=a1+(nβˆ’1)da_n = a_1 + (n - 1)d

Jumps directly to the nnth term without computing every term before it.

Recursive formula
an=anβˆ’1+da_n = a_{n-1} + d

Defines each term from the previous one; you also need the first term a1a_1.

Sum of an arithmetic series (version 1)
Sn=n2(a1+an)S_n = \frac{n}{2}(a_1 + a_n)

Use when you know both the first and last term.

Sum of an arithmetic series (version 2)
Sn=n2(2a1+(nβˆ’1)d)S_n = \frac{n}{2}\bigl(2a_1 + (n - 1)d\bigr)

Use when you know a1a_1, dd, and nn but not ana_n.

Key Takeaways

  • βœ“Explicit formula: an=a1+(nβˆ’1)da_n = a_1 + (n-1)d β€” note it's (nβˆ’1)(n-1), not nn, because a1a_1 gets dd added zero times
  • βœ“Sum formula: Sn=n2(a1+an)S_n = \frac{n}{2}(a_1 + a_n) β€” it's the average of first and last, times the count
  • βœ“Given two terms, subtract the equations to find dd β€” then back-substitute for a1a_1
  • βœ“If terms go down by a constant, dd is negative β€” the formulas still work the same way

⚠️ Common Mistakes

  • βœ—Using nn instead of (nβˆ’1)(n-1) in the explicit formula β€” an=a1+(nβˆ’1)da_n = a_1 + (n-1)d, not an=a1+nda_n = a_1 + nd; the first term gets dd added zero times
  • βœ—When given two terms like a4a_4 and a10a_{10}, trying to guess dd instead of setting up two equations and subtracting to solve for dd systematically
  • βœ—Mixing up the two sum formulas β€” use Sn=n2(a1+an)S_n = \frac{n}{2}(a_1 + a_n) when you know the last term; use Sn=n2(2a1+(nβˆ’1)d)S_n = \frac{n}{2}(2a_1 + (n-1)d) when you don't
  • βœ—Forgetting that dd can be negative β€” if terms decrease, d<0d < 0, but all the formulas still work exactly the same way