Skip to content

Limited Fall 2026 availability

Complete web edition · Precalculus

Sequences and series

The hardest part of a mixed sequences-and-series review is tool selection. Classify the prompt first, then use the matching arithmetic, geometric, convergence, repeating-decimal, or Taylor-series tool.

Print edition
8 pages
Last reviewed
Cover of the Precalculus guide on Sequences and series

The complete public packet

The instructional text, order, mathematics, worked problem, answer, warnings, and diagrams below match the published PDF excerpt. Only the cover, repeating page furniture, page breaks, and responsive layout differ on the web.

Print / save PDF

BEFORE YOU COMPUTE

About this review. The review packet has 21 problems in flashcard format — each page shows the previous answer above the next problem, so the topics jump around. That’s great for studying, because it forces you to do the hardest step first — tool selection — on every problem.

This guide presents the 21 problems in the same order as the printed review packet, so you can work alongside it. Each header names the concept the problem tests. The next two pages are your concept reference: a diagnostic decision tree and a Master Toolbox. Read those first, then work through the problems and refer back as needed.

Diagnostic Decision Tree

HOW TO READ THE PROMPT

When you sit down with a problem, run through these questions in order. Stop at the first “yes.”

1. Is it a sequence? (one term, or the formula for an)

  • Look at numerators, denominators, and signs separately.
  • Test your formula by plugging in n = 1,2,3 and matching given terms.
  • Tools: arithmetic (an = a1 + (n 1)d), geometric (an = a1rn1), or alternating signs via (1)n or (1)n+1.

2. Is it a finite sum (something like 1 + 4 + 7 + + 295, or n=18)?

  • Constant difference between terms? Arithmetic. Use Sn = n 2 (a1 + an).
  • Constant ratio between terms? Geometric. Use Sn = a1 1 rn 1 r .

3. Is it an infinite sum (upper limit is )? Run the convergence pipeline:

(a)
Geometric with |r| < 1? Use S = a1 1 r.
(b)
Test for Divergence: compute limnan. If it isn’t 0, write diverges and stop.
(c)
Direct Comparison: bound your terms above by a known convergent series, or below by a known divergent one (often the harmonic 1n).

4. Is it a repeating decimal? Express the repeating tail as an infinite geometric series. First repeated block at its actual decimal location = a1; ratio = 10k where k is the block length. Apply S = a1 1r, then add the non-repeating prefix.

5. Is there an x inside the series? (“Find the interval of convergence.”) Treat the bracketed x-expression as the ratio of a geometric series. Set |bracket| < 1 and solve for x.

6. Does the series have factorials in the denominator? Probably a Taylor series. Match against the three you should have memorized:

  • ex = n=0xn n!
  • sinx = n=0(1)n x2n+1 (2n + 1)!
  • cosx = n=0(1)n x2n (2n)!

Master Toolbox — All the Formulas You Need

SEQUENCES

Arithmetic: common difference d.

  • nth term: an = a1 + (n 1)d
  • Recursive form: an = an1 + d

Geometric: common ratio r.

  • nth term: an = a1 rn1
  • Recursive form: an = r an1

Identifying which one: subtract consecutive terms (constant arithmetic) or divide consecutive terms (constant geometric).

SERIES SUMS

Arithmetic: Sn = n 2(a1 + an) = n 2[2a1 + (n 1)d]

Geometric (finite): Sn = a1 1 rn 1 r (use whenever r1)

Geometric (infinite): S = a1 1 r (only if |r| < 1 — otherwise the sum diverges)

Sigma-notation arithmetic: n=1Nc = 𝑐𝑁, n=1Nn = N(N + 1) 2

CONVERGENCE TESTS FOR n=1an

1.
Geometric series test. If an = a1rn1, the series converges iff |r| < 1.
2.
Test for Divergence (TfD). If limnan0 (including doesn’t exist), the series diverges. If the limit is 0, the test is inconclusive — it does not prove convergence.
3.
Direct Comparison. Suppose 0 an bn for all n past some point.
  • If bn converges, then an converges (smaller than something finite).
  • If an (the smaller one) diverges, then bn also diverges.

The harmonic series n=11 n diverges — this is your reference for “terms going to 0 but the sum still blowing up.”

LIMIT-OF-an SHORTCUTS

You’ll use these inside the Test for Divergence and inside Taylor recognition:

  • Rational an = P(n) Q(n): compare degrees of top and bottom.

    • Top deg < bottom deg limit = 0.
    • Top deg = bottom deg limit = ratio of leading coefficients.
    • Top deg > bottom deg limit = ±.
  • Geometric rn: 0 if |r| < 1; + if r > 1; no limit (oscillates with growing magnitude) if r < 1; oscillates if r = 1; 1 if r = 1.
  • “Drop the small terms.” For limits at infinity, only the dominant term in numerator and denominator matters. The + 5 in 4n + 5, the + 21 in 73n + 21, and the (1)n in 37n + (1)n are all bounded ignore them when computing the limit.

TAYLOR SERIES — MEMORIZE THESE THREE

For all real x:

ex = n=0xn n! ,sinx = n=0(1)n x2n+1 (2n + 1)!,cosx = n=0(1)n x2n (2n)!.

Pattern recognition cues:

  • Factorial n! in denominator and xn on top ex.
  • Alternating sign, factorial odd (2n + 1)!, odd power x2n+1 sinx.
  • Alternating sign, factorial even (2n)!, even power x2n cosx.

Bonus geometric: for |x| < 1, 1 1 x = n=0xn. (This is just the infinite-geometric-series formula written as a function of x.)

The 21 Problems — In Review-Packet Order

The problems appear below in the same order they’re given in the printed review packet. Each header notes the concept the problem tests — the Master Toolbox on the previous pages is your concept reference. Work the problem first, then read the scaffolding.

PROBLEM 1

repeating decimal with non-repeating prefix

Use a geometric series to write 5.867¯ as a ratio of integers.

BEFORE YOU COMPUTE

Reading the decimal. The bar is over “67” only, so 5.867¯ = 5.86767676. The “8” is part of a fixed (non-repeating) prefix; the “67” is the repeating block.

The question explicitly says “use a geometric series.” So our job is to express the repeating tail as n=0a 1rn and apply the infinite-geometric-sum formula S = a1 1 r.

Strategy.

1.
Pull the negative sign out front; deal with 5.867¯ as a positive number, then re-apply the sign at the end.
2.
Split into non-repeating + repeating: 5.867¯ = 5.8 + 0.067¯.
3.
Write the repeating tail 0.067¯ as an infinite geometric series in sigma notation.
4.
Identify a1 and r, check |r| < 1, apply S = a1 1 r.
5.
Add to 5.8, re-apply the negative.

WORKING

Step 1: Split the decimal. The non-repeating part is 5.8 = 58 10, and the repeating tail is 0.067¯ = 0.0676767:

5.867¯ = 5.8 + 0.067¯.

Step 2: Write the repeating tail as a sum of fractions. The first “67” lives in positions 102 and 103:

0.067 = 67 1000 = 67 103.

The next “67” is shifted two more decimal places to the right (since the block has length 2), so it contributes 67 105. Then 67 107, then 67 109, and so on:

0.067¯ = 67 103 + 67 105 + 67 107 + 67 109 +

Step 3: Put in sigma notation and identify the geometric pieces. Pull out the common factor 67 103:

0.067¯ = 67 103 (1 + 1 102 + 1 104 + 1 106 + ) = 67 1000 n=0( 1 100 )n.

This is an infinite geometric series with

a1 = 67 1000,r = 1 100.

Convergence check: |r| = 1 100 < 1 ✓, so the sum exists.

Step 4: Apply S = a1 1 r.

0.067¯ = 671000 1 1100 = 671000 99100 = 67 1000 100 99 = 67 990.

Step 5: Combine with the non-repeating part. Use the common denominator 990:

5.8 = 58 10 = 58 99 990 = 5742 990 .
5.867¯ = 5742 990 + 67 990 = 5809 990 .

Step 6: Re-apply the negative sign.

5.867¯ = 5809 990 .

Sanity check (decimals): 5809990 5.867676

ANSWER

5809 990

WATCH OUT

Three places to slip:

  • Finding a1. It’s the value of the first repeated piece in its actual decimal location, not just the digits “67.” Here that first piece is 0.067 = 671000, not 67 on its own.
  • Finding r. It’s the multiplier that takes you from one block to the next. A block of length k shifts you k decimal places to the right each time, so r = 10k. Here the block “67” has length 2, so r = 1100.
  • Handling the non-repeating prefix. Don’t try to bake 5.8 into the geometric series. Just compute the repeating tail as a series, then add the non-repeating part at the end. (Common denominator 990 makes the final fraction clean.)

CONNECTION

Faster alternative (the shift-and-subtract trick). Once you trust the geometric-series result, here’s a quicker mechanical method for future repeating-decimal problems. Set x = 5.867¯, then:

10x = 58.67¯,1000x = 5867.67¯.

Subtracting: 1000x 10x = 5867 (58) = 5809, so 990x = 5809 and x = 5809 990 .

The two methods give the same answer because they’re the same math: 990 = 10j+k 10j where j is the number of non-repeating decimal digits between the decimal point and the repeating block (here j = 1, the “8”) and k is the block length. The shift-and-subtract trick is just a streamlined way to compute the geometric sum without writing the series.

On the test: since the wording says “use a geometric series,” show the series setup explicitly — a1 = 671000, r = 1100, S = a1(1 r) = 67990 — and then combine with the non-repeating part. Don’t lead with shift-and-subtract on this one.

ABOUT THIS EXCERPT

The guide continues for another twenty-seven pages — every remaining problem worked the same way, through the final Taylor-series questions.

Every family receives the complete guide, after every session.

engineeringconfidence.one

Source and review notes

What this resource is

Complete browser edition of a sanitized real-session solution-guide excerpt. Names, dates, and student work were removed; unlike the AP packet series, this page does not make an all-original-problem claim.

Published
Last reviewed
Printable edition
8 pages

Read the complete packet above in the browser, or use the PDF for its fixed-page print layout and offline reading.

Download the 8-page PDF excerpt

When a guide is not enough

The next step is making the method fit the student.

Explore the tutoring specialties, or tell Matt about the student and the work that is difficult right now.