Mastering Unit 6 Progress Check MCQ Part A: A Student’s Guide to Series and Sequences in AP Calculus BC
The AP Calculus BC exam tests a wide range of advanced calculus concepts, with Unit 6—Series and Sequences—being one of the most critical and challenging topics. The Unit 6 Progress Check MCQ Part A, designed by College Board, helps students gauge their understanding of sequences, series convergence, and Taylor/Maclaurin expansions. This guide breaks down the key concepts, question types, and strategies to help you excel in this essential section.
Key Topics Covered in Unit 6 Progress Check MCQ Part A
Unit 6 focuses on infinite sequences and series, including their convergence and applications. The Progress Check MCQ Part A typically includes questions on:
1. Sequences and Their Limits
- Understanding the behavior of sequences as n approaches infinity
- Determining whether a sequence converges or diverges
- Using algebraic manipulation and L’Hôpital’s Rule for limit evaluation
2. Series Convergence Tests
- Divergence Test: A series ∑aₙ diverges if lim(n→∞) aₙ ≠ 0
- Integral Test: For positive, decreasing functions, the series ∑f(n) and integral ∫f(x)dx either both converge or both diverge
- p-Series Test: ∑1/nᵖ converges if p > 1
- Comparison Test: Comparing a series to a known convergent/divergent series
- Ratio Test: Useful for series with factorials or exponentials; converges if lim |aₙ₊₁/aₙ| < 1
- Root Test: Similar to the ratio test, but uses the nth root of |aₙ|
3. Alternating Series and Absolute Convergence
- Alternating Series Test: For ∑(-1)ⁿaₙ, if aₙ is decreasing and lim aₙ = 0, the series converges
- Distinguishing between conditional and absolute convergence
4. Power Series and Interval of Convergence
- Finding the radius and interval of convergence using the ratio test
- Checking endpoints for convergence
- Representing functions as power series
5. Taylor and Maclaurin Series
- Constructing Taylor polynomials and series for functions like eˣ, sin(x), cos(x), and ln(1+x)
- Approximating function values using Taylor polynomials
- Understanding the relationship between Taylor series and function convergence
Common Question Types and Strategies
Type 1: Convergence/Divergence Determination
These questions ask you to identify whether a given series converges or diverges. Start by applying the divergence test—if the limit of the terms isn’t zero, the series diverges immediately. For remaining cases, choose the most appropriate test based on the series’ structure:
- Use the ratio test for factorials or exponentials
- Use the comparison test for rational functions or known series
- Use the integral test for positive, decreasing functions
Type 2: Interval of Convergence
Power series questions often require finding the interval of convergence. Use the ratio test to determine the radius of convergence, then substitute the endpoints into the original series to check for convergence at those points Easy to understand, harder to ignore..
Type 3: Taylor/Maclaurin Series Representation
Memorize the standard series for common functions:
- eˣ = ∑xⁿ/n!
- sin(x) = ∑(-1)ⁿx²ⁿ⁺¹/(2n+1)!
- cos(x) = ∑(-1)ⁿx²ⁿ/(2n)!
- ln(1+x) = ∑(-1)ⁿ⁺¹xⁿ/n for |x| < 1
Use these expansions to approximate functions or solve related problems.
Type 4: Error Bounds and Approximation
Questions may ask for the error in a Taylor polynomial approximation. Use the Lagrange remainder formula: Rₙ(x) = f⁽ⁿ⁺¹⁾(c)xⁿ⁺¹/(n+1)!, where c is between 0 and x Small thing, real impact..
Example Problems with Solutions
Example 1: Convergence Test Application
Question: Determine whether the series ∑(n=1 to ∞) [n/(n² + 5)] converges or diverges.
Solution: Apply the limit comparison test with the harmonic series ∑1/n. Compute:
lim(n→∞) [n/(n² + 5)] / (1/n) = lim(n→∞) n²/(n² + 5) = 1. Since ∑1/n diverges, the given series also diverges That's the part that actually makes a difference..
Example 2: Interval of Convergence
Question: Find the interval of convergence for ∑(n=1 to ∞) [(x-2)ⁿ]/n².
Solution: Use the ratio test:
lim(n→∞) |(x-2)ⁿ⁺¹/(n+1)²| / |(x-2)ⁿ/n²| = |x-2| * lim(n→∞) n²/(n+1)² = |x-2|.
The series converges if |x-2| < 1 → 1 < x < 3. Check endpoints:
At x = 1: ∑1
Continuing the Interval‑of‑Convergence Example
At (x = 1) the series becomes
[ \sum_{n=1}^{\infty}\frac{(1-2)^{n}}{n^{2}}=\sum_{n=1}^{\infty}\frac{(-1)^{n}}{n^{2}} . ]
Because (\displaystyle\lim_{n\to\infty}\frac{1}{n^{2}}=0) and the terms decrease monotonically, the Alternating Series Test guarantees convergence. In fact the series converges absolutely, since
[ \sum_{n=1}^{\infty}\frac{1}{n^{2}} ]
is a (p)-series with (p=2>1) Less friction, more output..
At (x = 3) we obtain
[ \sum_{n=1}^{\infty}\frac{(3-2)^{n}}{n^{2}}=\sum_{n=1}^{\infty}\frac{1}{n^{2}}, ]
which is the familiar Basel series; it also converges absolutely Surprisingly effective..
Hence the interval of convergence for
[ \sum_{n=1}^{\infty}\frac{(x-2)^{n}}{n^{2}} ]
is
[ \boxed{[,1,;3,]} . ]
5. Taylor and Maclaurin Series
5.1 Constructing Taylor Polynomials
For a function (f) that is ((n+1))‑times differentiable at a point (a), the (n)‑th degree Taylor polynomial is
[ P_n(x)=\sum_{k=0}^{n}\frac{f^{(k)}(a)}{k!}(x-a)^{k}. ]
When (a=0) the polynomial is called a Maclaurin polynomial.
5.2 Standard Maclaurin Series
Memorizing the first few Maclaurin expansions is invaluable:
[ \begin{aligned} e^{x} &= \sum_{n=0}^{\infty}\frac{x^{n}}{n!In real terms, }, &&\text{(converges for all }x\text{)}\[4pt] \sin x &= \sum_{n=0}^{\infty}(-1)^{n}\frac{x^{2n+1}}{(2n+1)! Because of that, }, &&|x|<\infty\[4pt] \cos x &= \sum_{n=0}^{\infty}(-1)^{n}\frac{x^{2n}}{(2n)! }, &&\text{(converges for all }x\text{)}\[4pt] \ln(1+x) &= \sum_{n=1}^{\infty}(-1)^{,n+1}\frac{x^{n}}{n}, &&|x|<1 Practical, not theoretical..
These series are the building blocks for approximating function values and for solving problems that involve differential equations, integrals, or asymptotic analysis Less friction, more output..
5.3 Approximating Function Values
To approximate (f(x)) near (a) using its Taylor polynomial (P_n(x)), evaluate the polynomial at the desired point. The error (remainder) after (n) terms is given by the Lagrange form:
[ R_n(x)=\frac{f^{(n+1)}(c)}{(n+1)!}(x-a)^{,n+1}, \qquad c \text{ between } a \text{ and } x. ]
If a bound (M) for (|f^{(n+1)}(c)|) on the interval is known, then
[ |R_n(x)|\le \frac{M}{(n+1)!},|x-a|^{,n+1}. ]
This inequality lets us determine how many terms are needed to achieve a prescribed accuracy.
5.4 Example: Approximating (e^{x})
Suppose we want (e^{0.5}) accurate to three decimal places, using the Maclaurin series centered at (0) Not complicated — just consistent..
Take (n=4):
[ P_4(0.5)=\sum_{k=0}^{4}\frac{0.5^{k}}{k!} =1+0.5+\frac{0.5^{2}}{2!}+\frac{0.5
To approximate ( e^{0.On the flip side, 5} ) using the Maclaurin series for ( e^x ), we evaluate the polynomial ( P_4(0. 5) ) and compute the error bound.
The Maclaurin series for ( e^x ) is: [ e^x = \sum_{n=0}^{\infty} \frac{x^n}{n!} = 1 + 0.5)| \leq \frac{1.5} \approx 1.On top of that, thus, [ |R_4(0. } ] For ( x = 0.5) = \sum_{k=0}^{4} \frac{0.Worth adding: 125}{6} + \frac{0. So naturally, this error is less than ( 0. } |0.648721 ) and the approximation ( 1.5)| \leq \frac{M}{(5)!6484375 ] The error bound is given by the Lagrange remainder: [ |R_4(0.Practically speaking, 25}{2} + \frac{0. Here's the thing — 0208333 + 0. Which means 0026041667 \approx 1. 5 + \frac{0.Which means 03125 \approx 0. Now, 5 ), the fourth-degree polynomial is: [ P_4(0. 6487 ). 125 + 0.5^k}{k!On top of that, 5|^5 ] Since ( f^{(5)}(c) = e^c ) and ( c ) is between 0 and 0. 6484375 ), which is approximately ( 0.So 0002835 ). 6487}{120} \cdot 0.On the flip side, 5, the maximum value of ( e^c ) is ( e^{0. Plus, 5} \approx 1. 5 + 0.Still, 0625}{24} ] Calculating each term: [ 1 + 0. 000426 ] The actual error is the difference between the true value ( e^{0.0005 ), ensuring the approximation is accurate to three decimal places.
Which means, the approximation of ( e^{0.5} ) using the fourth-degree Maclaurin polynomial is: [ \boxed{1.648} ]
Having observed how theLagrange remainder quantifies the discrepancy between the true function and its polynomial truncation, we can now address the practical question of how many terms are required to meet a prescribed accuracy. In practice one first fixes a tolerance ε (e.g., 0.
[ \frac{M}{(n+1)!},|x-a|^{,n+1}\le \varepsilon, ]
where M is a bound for the ((n+1)^{\text{st}}) derivative on the interval joining a and x. Because the factorial in the denominator grows faster than any power of |x‑a|, the inequality is always solvable for sufficiently large n; the challenge lies in locating a tight bound for M and in evaluating the factorial efficiently.
To illustrate, consider the Maclaurin expansion of (\sin x). Since every odd‑order derivative of (\sin) is either (\pm\sin) or (\pm\cos), we have
[ |,\sin^{(n+1)}(c),|\le 1\qquad\text{for all }c. ]
Thus the remainder after n terms satisfies
[ |R_n(x)|\le\frac{|x|^{,n+1}}{(n+1)!}. ]
If we desire (\sin(0.Practically speaking, 7)) accurate to four decimal places (ε = 0. 00005), we test successive n until the bound drops below the tolerance Nothing fancy..
[ \frac{0.7^{6}}{6!}\approx\frac{0.1176}{720}\approx0.000163, ]
which is still too large, while for n = 6 the bound becomes
[ \frac{0.7^{7}}{7!}\approx\frac{0.0823}{5040}\approx0.0000163, ]
well within the required precision. Because of this, a seventh‑degree Taylor polynomial yields the desired accuracy for (\sin(0.7)).
The same principle applies to logarithmic and trigonometric series. Still, /(1+x)^{k+1}), giving a simple bound (|f^{(n+1)}(c)|\le (n+1)! For (\ln(1+x)) centered at 0, the derivatives alternate between ((-1)^{k}k!) on ((-1,1]).
[ |R_n(x)|\le\frac{|x|^{,n+1}}{n+1}, ]
so the convergence radius (|x|<1) is reflected directly in the error estimate. In contrast, the exponential series enjoys an unbounded radius of convergence because its derivatives are identical to the original function, yielding the very compact bound
[ |R_n(x)|\le\frac{e^{|x|},|x|^{,n+1}}{(n+1)!}. ]
These examples demonstrate that the Lagrange form of the remainder is not merely theoretical; it provides a concrete pathway to decide how many terms are needed, how accurate the approximation will be, and which interval of x remains safe for a given degree.
Worth pausing on this one.
The short version: Taylor series transform the often‑intractable task of evaluating a function into a finite‑sum computation whose error can be rigorously bounded. By estimating the size of higher‑order derivatives and leveraging factorial growth, one can systematically construct approximations that meet any prescribed tolerance, thereby uniting theoretical analysis with practical computation. This synergy underpins countless applications ranging from numerical algorithms and computer graphics to asymptotic expansions in physics and engineering.
