Question
Find the best upper bound you can for the error $s-s_{n}$ encountered if the partial sum $s_{n}$ is used to approximate the sum $s$ of the series. How many terms of each series do you need to be sure that the approximation has error less than $0.001 ?$$$\sum_{n=0}^{\infty} \frac{2^{n}}{(2 n) !}$$
Step 1
The series is given by \[s = \sum_{n=0}^{\infty} \frac{2^{n}}{(2 n) !}\] and its partial sum is \[s_{n} = \sum_{n=0}^{n} \frac{2^{n}}{(2 n) !}\] Show more…
Show all steps
Your feedback will help us improve your experience
Nick Johnson and 59 other Calculus 2 / BC educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Find the best upper bound you can for the error $s-s_{n}$ encountered if the partial sum $s_{n}$ is used to approximate the sum $s$ of the series. How many terms of each series do you need to be sure that the approximation has error less than $0.001 ?$ $$\sum_{n=1}^{\infty} \frac{1}{(2 n-1) !}$$
Sequences, Series, and Power Series
Convergence Tests for Positive Series
Find the best upper bound you can for the error $s-s_{n}$ encountered if the partial sum $s_{n}$ is used to approximate the sum $s$ of the series. How many terms of each series do you need to be sure that the approximation has error less than $0.001 ?$ $$\sum_{n=1}^{\infty} \frac{1}{n^{n}}$$
Find the best upper bound you can for the error $s-s_{n}$ encountered if the partial sum $s_{n}$ is used to approximate the sum $s$ of the series. How many terms of each series do you need to be sure that the approximation has error less than $0.001 ?$ $$\sum_{k=1}^{\infty} \frac{1}{2^{k} k !}$$
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD