This site is a work in progress. New lessons are added regularly. Contact us
Chapter Review · a rapid pre-test review (speedrun)

Sequences and Series: Chapter Review

A rapid review before the test: the chapter's vocabulary and notation, every formula with the conditions to use it, the standard problem types step by step, and the traps that cost points.

Vocabulary and notation

Sequence
An ordered list of numbers, each one a term. Order matters: reversing the list gives a different sequence.
Position and the subscript ana_n
ana_n is the term in position nn. The subscript counts position, never a multiplication; nn is always a counting number.
Series
The sum of the terms of a sequence, a single number rather than a list. SnS_n sums the first nn terms.
Arithmetic sequence, common difference dd
Each term is the one before it plus a fixed dd, which may be positive, negative, fractional, or zero (a constant sequence).
Geometric sequence, common ratio rr
Each term is the one before it times a fixed rr. Every rr but 00 is allowed, and with a10a_1 \neq 0 no term is ever 00.
Explicit form and recursive form
Explicit (closed) form gives a term straight from its position; recursive form builds each term from the one before it.
Summation (sigma) notation
In k=1nak\sum_{k=1}^{n} a_k, kk is the index, 11 and nn the lower and upper limits, aka_k the summand. The index is a dummy variable: the letter never changes the value.
Telescoping sum
A sum whose every term is a difference of consecutive values of one sequence bkb_k, so the interior cancels in pairs and only the ends survive.

Formulas and theorems

  • Testing arithmetic against geometric

    Arithmetic when every ak+1aka_{k+1} - a_k gives the same dd; geometric when every ak+1ak\frac{a_{k+1}}{a_k} gives the same rr.

    Use when One mismatched pair disqualifies it. Subtract or divide a term by the one BEFORE it; the ratio test needs nonzero terms.

    e.g. 2,4,8,162, 4, 8, 16: differences 2,4,82, 4, 8 vary, but every ratio is 22, so geometric.

  • nnth term of an arithmetic sequence

    an=a1+(n1)da_n = a_1 + (n-1)d

    Use when Any arithmetic sequence, any n1n \ge 1. The step count is n1n - 1, not nn, because the first term takes no step; at n=1n = 1 it returns a1a_1.

  • nnth term of a geometric sequence

    an=a1rn1a_n = a_1 r^{\,n-1}

    Use when Any geometric sequence, any n1n \ge 1, with r0r \neq 0. The exponent is n1n - 1, not nn, and r0=1r^0 = 1 returns a1a_1.

    e.g. a1=7a_1 = 7, r=3r = 3: a4=733=189a_4 = 7 \cdot 3^3 = 189.

  • What the common ratio does

    r>1r > 1: the terms grow in size without bound. 0<r<10 < r < 1: they shrink toward 00, never reaching it. r<0r < 0: they alternate in sign. r=1r = 1: every term equals a1a_1.

    Use when Any geometric sequence with a10a_1 \neq 0; r=0r = 0 is excluded outright. Size follows the powers of r|r|, so a negative rr with r>1|r| > 1 alternates AND grows.

  • Moving between any two terms

    ak=am+(km)dak=amrkm\begin{gathered} a_k = a_m + (k-m)d \\ a_k = a_m\,r^{\,k-m} \end{gathered}

    Use when Any positions mm and kk, arithmetic above and geometric below; a negative kmk - m steps backward. An EVEN gap leaves an even power of rr, hiding a sign: r2=4r^2 = 4 allows both 22 and 2-2.

    e.g. a3=20a_3 = 20 and a7=44a_7 = 44: 44=20+4d44 = 20 + 4d, so d=6d = 6.

  • Recursive rules

    an=an1+d,an=ran1a_n = a_{n-1} + d, \qquad a_n = r\,a_{n-1}

    Use when Both for n2n \ge 2, each needing a stated a1a_1.

  • Expanding summation notation

    k=1nak=a1+a2++an\sum_{k=1}^{n} a_k = a_1 + a_2 + \cdots + a_n

    Use when The index steps by one from the lower limit through the upper, both included.

    e.g. k=14(2k+1)=3+5+7+9=24\sum_{k=1}^{4} (2k + 1) = 3 + 5 + 7 + 9 = 24.

  • Finite arithmetic series

    Sn=n(a1+an)2=n2(2a1+(n1)d)\begin{gathered} S_n = \frac{n(a_1 + a_n)}{2} \\ = \frac{n}{2}\big(2a_1 + (n-1)d\big) \end{gathered}

    Use when nn a positive whole number of arithmetic terms; the two forms give the same total.

    e.g. a1=1a_1 = 1, an=na_n = n gives 1+2++n=n(n+1)21 + 2 + \cdots + n = \frac{n(n+1)}{2}, so 1+2++100=50501 + 2 + \cdots + 100 = 5050.

  • Counting and summing a range of terms

    The terms from position mm to position nn number nm+1n - m + 1, and their total is SnSm1S_n - S_{m-1}.

    Use when 1mn1 \le m \le n, reading S0=0S_0 = 0 when m=1m = 1. Both endpoints count, hence the +1+1.

    e.g. Rows 77 through 1919 number 197+1=1319 - 7 + 1 = 13.

  • Finite geometric series

    Sn=a1(1rn)1r=a1(rn1)r1S_n = \frac{a_1(1 - r^{\,n})}{1 - r} = \frac{a_1(r^{\,n} - 1)}{r - 1}

    Use when r1r \neq 1: there the denominator is zero, and since every term equals a1a_1 the sum is simply na1n\,a_1. The two forms agree everywhere, the first tidier when 0<r<10 < r < 1, the second when r>1r > 1.

  • Infinite geometric series

    S=a11rS = \frac{a_1}{1 - r}

    Use when r<1|r| < 1 ONLY, a condition on size, so it covers negative ratios like r=12r = -\tfrac{1}{2}. When r1|r| \ge 1 there is no finite sum: r=1r = 1 runs off, r=1r = -1 flips between a1a_1 and 00 forever, and r>1|r| > 1 grows in size past every bound.

  • Telescoping collapse

    k=1n(bkbk+1)=b1bn+1k=1n(bk+1bk)=bn+1b1\begin{gathered} \sum_{k=1}^{n} (b_k - b_{k+1}) = b_1 - b_{n+1} \\ \sum_{k=1}^{n} (b_{k+1} - b_k) = b_{n+1} - b_1 \end{gathered}
    The interior terms cancel in pairs, leaving only the two endsFour rows, each shifted one column right of the row above: b sub 1 minus b sub 2, then plus b sub 2 minus b sub 3, then plus b sub 3 minus b sub 4, then plus b sub 4 minus b sub 5. Every subtracted term sits directly above the identical added term below it, and both are struck through. The highlighted survivors are b sub 1 at the top left and minus b sub 5 at the bottom right, and the result line reads b sub 1 minus b sub 5.b2+b2b3+b3b4+b4b1b5b1b5=
    Text description

    The four brackets of a telescoping sum are stacked in a staircase so that each subtracted term sits directly above the identical added term in the row below; every one of those interior pairs is struck through, leaving only the first term and the last subtracted term, whose difference is the whole sum.

    Use when Every term must be a difference of CONSECUTIVE values of one bkb_k. The back survivor is bn+1b_{n+1}, not bnb_n. The infinite version is finite exactly when that tail settles instead of running off.

  • The two standard fraction telescopes

    1k(k+1)=1k1k+11k(k+2)=12(1k1k+2)\begin{gathered} \frac{1}{k(k+1)} = \frac{1}{k} - \frac{1}{k+1} \\ \frac{1}{k(k+2)} = \frac{1}{2}\left(\frac{1}{k} - \frac{1}{k+2}\right) \end{gathered}

    Use when Verify a split by recombining over a common denominator; the gap-22 split needs the 12\tfrac{1}{2}, since 1k1k+2=2k(k+2)\frac{1}{k} - \frac{1}{k+2} = \frac{2}{k(k+2)}. Collapsed they total 11n+1=nn+11 - \frac{1}{n+1} = \frac{n}{n+1} (infinite value 11) and 3412(1n+1+1n+2)\frac{3}{4} - \frac{1}{2}\left(\frac{1}{n+1} + \frac{1}{n+2}\right) (two survivors each end; infinite value 34\tfrac{3}{4}).

  • Square-root and consecutive-square telescopes

    k=1n(k+1k)=n+11k=1n(2k+1)=(n+1)21\begin{gathered} \sum_{k=1}^{n} \left(\sqrt{k+1} - \sqrt{k}\right) = \sqrt{n+1} - 1 \\ \sum_{k=1}^{n} (2k+1) = (n+1)^2 - 1 \end{gathered}

    Use when Mirror-direction telescopes, bk=kb_k = \sqrt{k} and bk=k2b_k = k^2, the second from (k+1)2k2=2k+1(k+1)^2 - k^2 = 2k+1. Rationalizing turns 1k+k+1\frac{1}{\sqrt{k} + \sqrt{k+1}} into k+1k\sqrt{k+1} - \sqrt{k}, and log ⁣(k+1k)\log\!\left(\frac{k+1}{k}\right) telescopes to log(n+1)\log(n+1). The square-root sum has NO finite infinite value: n+1\sqrt{n+1} runs off.

Problem types, step by step

Find a chosen term of a sequence

  1. Read a1a_1, then get dd by subtracting consecutive terms or rr by dividing them.
  2. Substitute into an=a1+(n1)da_n = a_1 + (n-1)d or an=a1rn1a_n = a_1 r^{\,n-1}, writing the count as n1n - 1, and evaluate the product or power first.

e.g. 2,9,16,2, 9, 16, \ldots has d=7d = 7, so a20=2+19×7=135a_{20} = 2 + 19 \times 7 = 135.

Recover dd or rr, and a1a_1, from two known terms

  1. Count the positions apart, kmk - m, and substitute into ak=am+(km)da_k = a_m + (k-m)d or ak=amrkma_k = a_m r^{\,k-m}.
  2. Solve: divide out the coefficient for dd, or isolate the power and take the root for rr.
  3. An even number of positions apart fits both signs of rr; pin it with another fact.
  4. Step back to a1a_1 by subtracting dd or dividing by rr the right number of times.

e.g. a2=6a_2 = 6 and a5=48a_5 = 48 give 6r3=486r^3 = 48, so r=2r = 2 and a1=3a_1 = 3.

Decide whether a value is a term, and which one

  1. Set the explicit formula equal to the target value and solve for nn: linear for arithmetic; geometric needs the power isolated, then matching powers of rr or a logarithm when r>0r > 0, r1r \neq 1.
  2. Accept only a positive whole nn; a fraction or a non-whole exponent means the value is not a term at all.

e.g. For 5,8,11,5, 8, 11, \ldots: 5+3(n1)=985 + 3(n-1) = 98 gives n=32n = 32, while 100100 gives n1=953n - 1 = \tfrac{95}{3}, so 100100 never appears.

Total the first nn terms of an arithmetic series

  1. Read a1a_1, dd, and how many terms the question wants.
  2. Knowing the last term, use Sn=n(a1+an)2S_n = \frac{n(a_1 + a_n)}{2}; knowing only a1a_1 and dd, use Sn=n2(2a1+(n1)d)S_n = \frac{n}{2}\big(2a_1 + (n-1)d\big).
  3. Simplify inside the bracket, then divide by 22.

e.g. 3,7,11,3, 7, 11, \ldots with n=25n = 25: S25=252(6+96)=1275S_{25} = \tfrac{25}{2}(6 + 96) = 1275.

Total a range of terms, the mmth through the nnth

  1. Compute the end terms ama_m and ana_n, and count nm+1n - m + 1 terms, both ends included.
  2. Apply the series formula to that run with its own first term, last term, and count.
  3. Check with SnSm1S_n - S_{m-1}, which strips everything before position mm.

e.g. With a1=4a_1 = 4, d=3d = 3, terms 1010 to 3030 run 3131 to 9191 over 2121 terms: 21(31+91)2=1281\frac{21(31 + 91)}{2} = 1281.

Total a geometric series, finite or infinite

  1. Read a1a_1 as the first term written, rr by dividing consecutive terms.
  2. Finite: confirm r1r \neq 1 (if r=1r = 1 the total is na1n\,a_1), then substitute a1a_1, rr, and nn, evaluating rnr^{\,n} first.
  3. Infinite: test r<1|r| < 1 first and report no finite sum if it fails; otherwise substitute into S=a11rS = \frac{a_1}{1 - r}.

e.g. 8+4+2+=8112=168 + 4 + 2 + \cdots = \frac{8}{1 - \tfrac{1}{2}} = 16, while the 6464-square chessboard totals 26412^{64} - 1.

Turn a repeating decimal into an exact fraction

  1. Identify the repeating block and its length bb in digits, with the block starting right after the decimal point.
  2. Write the decimal as place-value copies of that block, so a1a_1 is the block over 10b10^{\,b} and r=110br = \frac{1}{10^{\,b}}.
  3. Apply S=a11rS = \frac{a_1}{1 - r}, then reduce to lowest terms.

e.g. 0.48=48/10011/100=4899=16330.\overline{48} = \frac{48/100}{1 - 1/100} = \frac{48}{99} = \frac{16}{33}.

Collapse a telescoping sum

  1. Rewrite each term as a difference of consecutive values, splitting the fraction or rationalizing the radical denominator.
  2. Confirm the split by recombining it, inserting any correcting constant it reveals.
  3. Write out enough brackets to see which pieces fail to cancel; a wider gap leaves more survivors per end.
  4. Read the total as b1bn+1b_1 - b_{n+1}, or bn+1b1b_{n+1} - b_1 in mirror direction; for the infinite version drop the tail only if it shrinks to nothing.

e.g. k=1991k+k+1=1001=9\sum_{k=1}^{99} \frac{1}{\sqrt{k} + \sqrt{k+1}} = \sqrt{100} - \sqrt{1} = 9.

Set up a word problem about a repeating pattern

  1. Decide what repeats: a fixed AMOUNT added makes it arithmetic with that dd, a fixed MULTIPLE makes it geometric with that rr.
  2. Name a1a_1 as the value at position 11, and decide whether the question wants one term or a total.
  3. Apply the matching formula and answer what was actually asked, with units.

e.g. 1212 rows from 1818 seats with d=2d = 2 end at a12=40a_{12} = 40, so S12=12(18+40)2=348S_{12} = \frac{12(18 + 40)}{2} = 348 seats.

Exam traps

  • Trap Reporting a term when the question asked for a sum, or the reverse: for 2,5,8,112, 5, 8, 11, answering "the sum of the first four terms" with 1111.

    Fix 1111 is a4a_4, the fourth TERM; the series is 2+5+8+11=262 + 5 + 8 + 11 = 26. Check for the word term or sum before picking a formula.

  • Trap Off-by-one on an index: writing an=a1+nda_n = a_1 + nd, counting the 1010th through the 3030th terms as 3010=2030 - 10 = 20 terms, or stopping a telescope at bnb_n.

    Fix Each is one item out. a1+nda_1 + nd is really an+1a_{n+1}, since the first term takes no step; the range holds 3010+1=2130 - 10 + 1 = 21 terms because both ends count; the last survivor is bn+1b_{n+1}.

  • Trap Reaching for n(a1+an)2\frac{n(a_1 + a_n)}{2} to total a geometric series.

    Fix That averages the first and last terms, exact only for evenly spaced ones. Geometric terms are scaled, not stepped, so use a1(1rn)1r\frac{a_1(1 - r^{\,n})}{1 - r}.

  • Trap Hunting for rr by subtracting consecutive terms, or by dividing a term by the one AFTER it.

    Fix The ratio is a term over the one before it, r=a2a1r = \frac{a_2}{a_1}; the other way gives the reciprocal. In 3,6,12,243, 6, 12, 24 every ratio is 22 while the differences never settle.

  • Trap Dropping the minus sign of a negative ratio inside a11r\frac{a_1}{1 - r}.

    Fix With a1=9a_1 = 9 and r=13r = -\tfrac{1}{3} the denominator is 1(13)=431 - \left(-\tfrac{1}{3}\right) = \tfrac{4}{3}, so the sum is 274\tfrac{27}{4}, not the 272\tfrac{27}{2} that 1131 - \tfrac{1}{3} would give.

  • Trap Dividing an inequality by logr\log r without flipping it: reading 3000.6n1<20300 \cdot 0.6^{\,n-1} < 20 as n1<log(1/15)log0.6n - 1 < \frac{\log(1/15)}{\log 0.6}, then rounding down.

    Fix For 0<r<10 < r < 1 that logarithm is negative, so dividing reverses the sign: n1>5.30n - 1 > 5.30, and a position rounds UP, giving n=7n = 7. The 66th rebound is 23.323.3 cm, still above 2020.

  • Trap Totalling a bouncing ball's travel as one series: dropped from 1212 m and rebounding to half, answering 12112=24\frac{12}{1 - \tfrac{1}{2}} = 24 m.

    Fix The drop is travelled once, every rebound twice, up and down: 12+2(6112)=12+24=3612 + 2\left(\frac{6}{1 - \tfrac{1}{2}}\right) = 12 + 24 = 36 m.

  • Trap Dropping a number into the wrong slot: reading "the 1212th term is 4040" as n=40n = 40, or putting the term count where rr belongs.

    Fix nn is only ever a position or a count, rr is the multiplier, ana_n and SnS_n are values. Here n=12n = 12 goes in and 4040 is what the formula must produce.

  • Trap Leaving one survivor at each end of a gap-22 telescope, so k=1n1k(k+2)\sum_{k=1}^{n} \frac{1}{k(k+2)} is read as 12(11n+2)\frac{1}{2}\left(1 - \frac{1}{n+2}\right).

    Fix With a gap of 22 each piece cancels two brackets later, so inside the 12\tfrac{1}{2} bracket the survivors are 11 and 12\tfrac{1}{2} in front, 1n+1\frac{1}{n+1} and 1n+2\frac{1}{n+2} at the back. At n=2n = 2 the correct 1124\tfrac{11}{24} beats the wrong 38\tfrac{3}{8}.

Chapter test Questions from across the chapter