Calc III Study Set: Sequences and Series

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/34

flashcard set

Earn XP

Description and Tags

yo shut it up bro hahaha fpifgjniopdsfiopjiofewHJIOP'QEwfjio'pqedWF

Last updated 10:09 PM on 9/2/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

35 Terms

1
New cards
Sequence
A function whose domain is the set of positive integers. For example:
{5, 9, 13, 17, …} is an example of an Arithmetic Sequence (constant common difference between terms) with the formula a_n = 4n + 1 (nth term).
{1/2, 1/4, 1/8, 1/16, …} is an example of a Geometric Sequence (constant common ratio between terms) with the formula a_n = (1/2)^n (nth term).
2
New cards
Series
The sum of the terms in a sequence.
Examples:
Finite Series: n=13(15n)=15+152+153=31125\sum_{n=1}^{3} \left( \frac{1}{5^n} \right) = \frac{1}{5} + \frac{1}{5^2} + \frac{1}{5^3} = \frac{31}{125}
Infinite Series: n=1(2n3)=1+1+3+5+\sum_{n=1}^{\infty} (2n - 3) = -1 + 1 + 3 + 5 + \ldots
3
New cards
Partial Sums
Partial Sums - The partial sums of a series form a sequence of real numbers defined as:
S1=a1S_1 = a_1 S2=a1+a2S_2 = a_1 + a_2 S3=a1+a2+a3S_3 = a_1 + a_2 + a_3 \vdots Sn=a1+a2++anS_n = a_1 + a_2 + \cdots + a_n
If the sequence of partial sums S1,S2,S3,{S_1, S_2, S_3, \ldots} has a limit SS as nn \to \infty, then the series converges to SS (otherwise it diverges):
limnSn=S\lim_{n \to \infty} S_n = S
4
New cards
Limit of nth Term of a Convergent Series
Divergence Test - If the infinite series n=1an\sum_{n=1}^{\infty} a_n converges, then limnan=0\lim_{n \to \infty} a_n = 0
Note: The converse is not always true; limnan=0\lim_{n \to \infty} a_n = 0 does not imply that n=1an\sum_{n=1}^{\infty} a_n converges.
5
New cards
Nth Term Test for Divergence
If limnan0\lim_{n \to \infty} a_n \neq 0, then the infinite series n=1an\sum_{n=1}^{\infty} a_n will diverge.
6
New cards
Convergence of Geometric Series
Convergence of Geometric Series - A geometric series can be written as:
n=1arn1orn=0arn\sum_{n=1}^{\infty} a \cdot r^{n-1} \quad \text{or} \quad \sum_{n=0}^{\infty} a \cdot r^{n}
All geometric series will converge to a11r\frac{a_1}{1-r} if 0<r<10 < |r| < 1 and will diverge if r1|r| \geq 1.
7
New cards
Tail of a Series (Term not needed to know but need to know definition)
If a series converges, then removing a finite number of terms from the beginning of the series will not affect its convergence.
8
New cards
The Integral Test
If a sequence is decreasing and positive and can be represented by an=f(n)a_n = f(n) and ff is continuous for x1x \geq 1, then n=1(an)\sum_{n=1}^{\infty}(a_n) and 1f(x)dx\int_1^{\infty} f(x)dx either both converge or both diverge.
9
New cards
P-Series
A p-series can be written as: n=11npork=11kp\sum_{n=1}^{\infty} \frac{1}{n^p} \quad \text{or} \quad \sum_{k=1}^{\infty} \frac{1}{k^p} This infinite series converges if (and only if) p>1p > 1. Otherwise, it diverges.
10
New cards
Direct Comparison Test
Let 0<anbn0 < a_n \leq b_n for all nn. If n=1(bn)\sum_{n=1}^{\infty}(b_n) converges, then n=1(an)\sum_{n=1}^{\infty}(a_n) converges. 2. If n=1(an)\sum_{n=1}^{\infty}(a_n) diverges, then n=1(bn)\sum_{n=1}^{\infty}(b_n) diverges.
11
New cards
Direct Comparison Test (Key Idea)
When using the Direct Comparison Test, find a "similar but simpler" series to compare to. If the "larger" series converges, then the "smaller" series must also converge. If the "smaller" series diverges, then the "larger" series must also diverge. Note: if your original series is larger than a convergent series, or smaller than a divergent series, the test tells you nothing and you must use a different test.
12
New cards
Limit Comparison Test
If ana_n and bnb_n are both positive and limn(anbn)\lim_{n \to \infty} \left(\frac{a_n}{b_n}\right) is finite and positive, then an\sum a_n and bn\sum b_n either both converge or both diverge. The trick to choosing a good bnb_n to compare to is to take the highest power of nn in both the numerator and denominator and divide the numerator term by the denominator term.
13
New cards
Telescoping Series
A series where consecutive terms cancel each other out, leaving only the first and last terms. To solve, use partial fractions to rewrite the series, write out the first few terms to see the cancellation pattern, and the sum equals S=limnSnS = \lim_{n \to \infty} S_n where most terms cancel. For example, n=11n(n+1)\sum_{n=1}^{\infty} \frac{1}{n(n+1)} can be rewritten as n=1(1n1n+1)\sum_{n=1}^{\infty} \left(\frac{1}{n} - \frac{1}{n+1}\right), where all middle terms cancel, leaving S=1S = 1.
14
New cards
Alternating Series
An alternating series is a series where the signs alternate, written as n=1(1)n+1(an)=a1a2+a3a4+...\sum_{n=1}^{\infty} (-1)^{n+1}(a_n) = a_1 - a_2 + a_3 - a_4 + ... where an>0a_n > 0 for all nn.
15
New cards
Alternating Series Test
An alternating series converges if BOTH conditions are met:
1. The terms are decreasing: 0<an+1an0 < a_{n+1} \leq a_n for all n1n \geq 1
2. The terms approach zero: limnan=0\lim_{n \to \infty} a_n = 0
Then the alternating series:
n=1(1)n+1(an)orn=1(1)n(an)\sum_{n=1}^{\infty} (-1)^{n+1}(a_n) \quad \text{or} \quad \sum_{n=1}^{\infty} (-1)^{n}(a_n)
converges.
16
New cards
Alternating Series Remainder
For a convergent alternating series, the remainder (error) between the actual sum SS and the partial sum SnS_n is bounded by the first neglected term: Rn=SSnan+1|R_n| = |S - S_n| \leq a_{n+1}
17
New cards
Absolute Convergence
If n=1an\sum_{n=1}^{\infty} |a_n| converges, then n=1an\sum_{n=1}^{\infty} a_n converges. A series n=1an\sum_{n=1}^{\infty} a_n converges absolutely if n=1an\sum_{n=1}^{\infty} |a_n| converges. The converse is not always true — a series can converge without converging absolutely.
18
New cards
Absolute vs. Conditional Convergence
n=1an\sum_{n=1}^{\infty} a_n is absolutely convergent if n=1an\sum_{n=1}^{\infty} |a_n| converges. n=1an\sum_{n=1}^{\infty} a_n is conditionally convergent if n=1an\sum_{n=1}^{\infty} a_n converges, but n=1an\sum_{n=1}^{\infty} |a_n| diverges.
19
New cards
Ratio Test
Suppose n=1an\sum_{n=1}^{\infty} a_n with an0a_n \neq 0. Let limnan+1an=L\lim_{n\to\infty}\left|\frac{a_{n+1}}{a_n}\right|=L
If L<1L < 1, the series converges absolutely.
If L>1L > 1, the series diverges.
If L=1L = 1, no conclusion can be drawn.
20
New cards
limn(n+1n)n= ?\lim_{n\to\infty}\left(\frac{n+1}{n}\right)^n = \text{ ?}
limn(n+1n)n=limn(1+1n)n=e\lim_{n\to\infty}\left(\frac{n+1}{n}\right)^n = \lim_{n\to\infty}\left(1+\frac{1}{n}\right)^n = e
21
New cards
Maclaurin Polynomial
The nthn^{\text{th}} Maclaurin Polynomial for ff, centered at 0, is defined as:
Pn(x)=f(0)+f(0)x+f(0)x22!+f(0)x33!+f(4)(0)x44!++f(n)(0)xnn!P_n(x) = f(0) + f'(0)x + \frac{f''(0)x^2}{2!} + \frac{f'''(0)x^3}{3!} + \frac{f^{(4)}(0)x^4}{4!} + \cdots + \frac{f^{(n)}(0)x^n}{n!}
22
New cards
Taylor Polynomial
The nthn^{\text{th}} Taylor Polynomial for ff at cc is defined as:
Pn(x)=Tn(x)=f(c)+f(c)(xc)+f(c)(xc)22!++f(n)(c)(xc)nn!P_n(x) = T_n(x) = f(c) + f'(c)(x-c) + \frac{f''(c)(x-c)^2}{2!} + \cdots + \frac{f^{(n)}(c)(x-c)^n}{n!}
23
New cards
Remainder of the Taylor Polynomial
With every polynomial approximation (Maclaurin or Taylor), there exists some error between the actual function value and our approximation as you move away from the center.
The actual function can be written as:
f(x)=Pn(x)+En(x)f(x) = P_n(x) + E_n(x)
where En(x)E_n(x) is the remainder (error), defined as:
En(x)=f(x)Pn(x)|E_n(x)| = |f(x) - P_n(x)|
24
New cards
Taylor's Theorem
If a function ff is differentiable through order (n+1)(n+1) on an interval containing cc, then for each xx in the interval, there exists a zz between xx and cc such that:
f(x)=f(c)+f(c)(xc)+f(c)(xc)22!++f(n)(c)(xc)nn!+En(x)f(x) = f(c) + f'(c)(x-c) + \frac{f''(c)(x-c)^2}{2!} + \cdots + \frac{f^{(n)}(c)(x-c)^n}{n!} + E_n(x)
where En(x)E_n(x) is the remainder in Lagrange Form:
En(x)=f(n+1)(z)(xc)n+1(n+1)!E_n(x) = \frac{f^{(n+1)}(z)(x-c)^{n+1}}{(n+1)!}
Similar to the Alternating Series Remainder, if we know properties of the (n+1)st(n+1)^{\text{st}} derivative of ff, we can bound the error by maximizing that (n+1)st(n+1)^{\text{st}} derivative:
En(x)Mxcn+1(n+1)!|E_n(x)| \leq \frac{M|x-c|^{n+1}}{(n+1)!}
where MM is the maximum value of the (n+1)st(n+1)^{\text{st}} derivative between xx and cc.
25
New cards
Taylor Series
If a function ff has derivatives of all orders at x=cx = c, then:
n=0f(n)(c)n!(xc)n=f(c)+f(c)(xc)++f(n)(c)n!(xc)n+\sum_{n=0}^{\infty} \frac{f^{(n)}(c)}{n!}(x-c)^n = f(c) + f'(c)(x-c) + \cdots + \frac{f^{(n)}(c)}{n!}(x-c)^n + \cdots
is called the Taylor Series for f(x)f(x) at cc. If c=0c = 0, then the series is the Maclaurin Series for ff.
26
New cards
Power Series
Any expression of the form:
n=0anxn=a0+a1x+a2x2++anxn+\sum_{n=0}^{\infty} a_n x^n = a_0 + a_1 x + a_2 x^2 + \cdots + a_n x^n + \cdots
is a power series centered at zero.
Any expression of the form:
n=0an(xc)n=a0+a1(xc)++an(xc)n+\sum_{n=0}^{\infty} a_n (x-c)^n = a_0 + a_1(x-c) + \cdots + a_n(x-c)^n + \cdots
is a power series centered at cc (where cc is constant).
27
New cards
Convergence of Power Series
For a power series centered at cc, one of the following is true:
1. The series converges only at cc. [Its radius of convergence is 0.]
2. There exists an R>0R > 0 such that the series converges absolutely for xc<R|x - c| < R and diverges for xc>R|x - c| > R. [The interval of convergence is (cR,c+R)(c - R, c + R).]
3. The series converges absolutely for all xx. [The interval of convergence is (,)(-\infty, \infty).]
The Ratio Test is useful for determining the interval of convergence. Instead of:
limnan+1an\lim_{n \to \infty} \left|\frac{a_{n+1}}{a_n}\right|
we now use:
limnun+1un\lim_{n \to \infty} \left|\frac{u_{n+1}}{u_n}\right|
where uu is a function of xx.
28
New cards
Geometric Power Series
A geometric power series represents a function within its interval of convergence using the geometric series formula. Since n=0rn=11r\sum_{n=0}^{\infty} r^n = \frac{1}{1-r} for r<1|r| < 1, we can rewrite functions in this form. For example:
11x=n=0xn=1+x+x2+x3+x<1\frac{1}{1-x} = \sum_{n=0}^{\infty} x^n = 1 + x + x^2 + x^3 + \cdots \quad |x| < 1
29
New cards
Operations with Power Series
If f(x)=n=0anxnf(x) = \sum_{n=0}^{\infty} a_n x^n and g(x)=n=0bnxng(x) = \sum_{n=0}^{\infty} b_n x^n, then the following operations are defined:
Addition/Subtraction: f(x)±g(x)=n=0(an±bn)xnf(x) \pm g(x) = \sum_{n=0}^{\infty} (a_n \pm b_n)x^n
Multiplication by a constant: kf(x)=n=0kanxnk \cdot f(x) = \sum_{n=0}^{\infty} k a_n x^n
Substitution: Replace xx with an expression, e.g. f(x2)=n=0anx2nf(x^2) = \sum_{n=0}^{\infty} a_n x^{2n}, but the interval of convergence must be re-evaluated after substitution. For example, if x<1|x| < 1, then for f(x2)f(x^2): x2<1    x<1|x^2| < 1 \implies |x| < 1 (the same here, but this will not always be the case).
30
New cards
Differentiation and Integration of Power Series
If f(x)=n=0an(xc)nf(x) = \sum_{n=0}^{\infty} a_n (x-c)^n, then within the interval of convergence:
Differentiation: f(x)=n=1nan(xc)n1f'(x) = \sum_{n=1}^{\infty} n \cdot a_n (x-c)^{n-1}
Integration: f(x)dx=n=0an(xc)n+1n+1+C\int f(x)\,dx = \sum_{n=0}^{\infty} \frac{a_n (x-c)^{n+1}}{n+1} + C
Note: Differentiation and integration do not change the radius of convergence, but may affect convergence at the endpoints.
31
New cards
Radius of Convergence
The radius of convergence RR of a power series centered at cc is the value such that the series converges absolutely for xc<R|x - c| < R and diverges for xc>R|x - c| > R. It is found using the Ratio Test:
limnun+1un<1\lim_{n \to \infty} \left|\frac{u_{n+1}}{u_n}\right| < 1
Solving this inequality for xc|x - c| gives the radius RR. Special cases:
- If R=0R = 0, the series converges only at x=cx = c.
- If R=R = \infty, the series converges for all xx.
32
New cards
Interval of Convergence
The interval of convergence is the set of all xx values for which a power series converges. To find it:
1. Use the Ratio Test to find the radius of convergence RR, giving the open interval (cR,c+R)(c - R, c + R).
2. Check each endpoint separately by substituting into the original series and applying an appropriate convergence test (e.g. Alternating Series Test, p-series, Divergence Test).
3. Include an endpoint in the interval if the series converges there.
The final interval of convergence can be open, half-open, or closed at the endpoints.
33
New cards
Lagrange Error Bound
The Lagrange Error Bound gives an upper bound on the error between a function and its Taylor/Maclaurin polynomial approximation:
En(x)Mxcn+1(n+1)!|E_n(x)| \leq \frac{M|x-c|^{n+1}}{(n+1)!}
where MM is the maximum value of f(n+1)(z)|f^{(n+1)}(z)| for all zz between xx and cc.
To find MM:
1. Find the (n+1)th(n+1)^{\text{th}} derivative of ff.
2. Determine the interval of zz values (all values between xx and cc).
3. Maximize f(n+1)(z)|f^{(n+1)}(z)| on that interval. If the exact maximum is difficult to find, use a convenient upper bound instead.
4. That maximum (or upper bound) is MM.
Example: Approximate e0.1e^{0.1} using a degree 3 Maclaurin polynomial and bound the error.
- f(x)=exf(x) = e^x, so f(4)(z)=ezf^{(4)}(z) = e^z
- zz is between 0 and 0.1, so eze0.1<2e^z \leq e^{0.1} < 2 is a safe upper bound, giving M=2M = 2
E3(0.1)2(0.1)44!=0.0002240.0000083|E_3(0.1)| \leq \frac{2(0.1)^4}{4!} = \frac{0.0002}{24} \approx 0.0000083
34
New cards
What’s On The Test
5 MCQs
2 FRQ
Telescoping Series
3 different series and you have to say which converges
nth term test… etc
1 Bonus (Something we did in class)
35
New cards
Taylor Series to Memorize:
sin(x)\sin(x)
cos(x)\cos(x)
exe^{x}
11x\frac{1}{1-x}
Taylor Series to Memorize
sin(x)=n=0(1)nx2n+1(2n+1)!=xx33!+x55!x77!+(,)\sin(x) = \sum_{n=0}^{\infty} \frac{(-1)^n x^{2n+1}}{(2n+1)!} = x - \frac{x^3}{3!} + \frac{x^5}{5!} - \frac{x^7}{7!} + \cdots \quad (-\infty, \infty)
cos(x)=n=0(1)nx2n(2n)!=1x22!+x44!x66!+(,)\cos(x) = \sum_{n=0}^{\infty} \frac{(-1)^n x^{2n}}{(2n)!} = 1 - \frac{x^2}{2!} + \frac{x^4}{4!} - \frac{x^6}{6!} + \cdots \quad (-\infty, \infty)
ex=n=0xnn!=1+x+x22!+x33!+(,)e^x = \sum_{n=0}^{\infty} \frac{x^n}{n!} = 1 + x + \frac{x^2}{2!} + \frac{x^3}{3!} + \cdots \quad (-\infty, \infty)
$$\frac{1}{1-x} = \sum_{n=0}^{\infty} x^n = 1 + x + x^2 + x^3 + \cdots \quad (-1, 1