Difference between revisions of "009C Sample Midterm 1, Problem 2"
Jump to navigation
Jump to search
Kayla Murray (talk | contribs) |
Kayla Murray (talk | contribs) |
||
| Line 22: | Line 22: | ||
!Step 1: | !Step 1: | ||
|- | |- | ||
| − | | | + | |We need to find a pattern for the partial sums in order to find a formula. |
|- | |- | ||
| − | | | + | |We start by calculating <math>s_2</math>. We have |
| + | |- | ||
| + | | <math>s_2=2\bigg(\frac{1}{2^2}-\frac{1}{2^3}\bigg).</math> | ||
|} | |} | ||
Revision as of 12:37, 12 February 2017
Consider the infinite series Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \sum_{n=2}^\infty 2\bigg(\frac{1}{2^n}-\frac{1}{2^{n+1}}\bigg).}
- a) Find an expression for the Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n} th partial sum Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle s_n} of the series.
- b) Compute Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \lim_{n\rightarrow \infty} s_n.}
| Foundations: |
|---|
| The Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n} th partial sum, Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle s_n} for a series Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \sum_{n=1}^\infty a_n } |
| is defined as |
|
Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle s_n=\sum_{i=1}^n a_i.} |
Solution:
(a)
| Step 1: |
|---|
| We need to find a pattern for the partial sums in order to find a formula. |
| We start by calculating Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle s_2} . We have |
| Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle s_2=2\bigg(\frac{1}{2^2}-\frac{1}{2^3}\bigg).} |
| Step 2: |
|---|
(b)
| Step 1: |
|---|
| Step 2: |
|---|
| Final Answer: |
|---|
| (a) |
| (b) |