Difference between revisions of "009C Sample Midterm 3, Problem 2"

From Math Wiki
Jump to navigation Jump to search
m
m
Line 81: Line 81:
 
\end{array}</math>  
 
\end{array}</math>  
 
|-
 
|-
|Notice the pattern; each time there are ''<u>exactly</u>'' two surviving positive terms, and two surviving negative terms. If we then take the limit, we find  
+
|Again, notice the pattern: each time there are ''<u>exactly</u>'' two surviving positive terms, and two surviving negative terms in each partial sum. If we then take the limit, we find  
 
|-
 
|-
 
|
 
|
Line 129: Line 129:
 
!Final Answer: &nbsp;
 
!Final Answer: &nbsp;
 
|-
 
|-
|The series in (a) converges to <math style="vertical-align: -23%">3/8</math>, while the series in (b) converges to <math style="vertical-align: -21%">3/2</math>.
+
|The series in (a) converges to <math style="vertical-align: -21%">3/8</math>, while the series in (b) converges to <math style="vertical-align: -21%">3/2</math>.
 
|}
 
|}
 
[[009C_Sample_Midterm_3|'''<u>Return to Sample Exam</u>''']]
 
[[009C_Sample_Midterm_3|'''<u>Return to Sample Exam</u>''']]

Revision as of 21:03, 26 April 2015

For each the following series find the sum, if it converges. If you think it diverges, explain why.

(a) (6 points)     


(b) (6 points)      Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle \sum _{n=1}^{\infty }\,{\frac {3}{(2n-1)(2n+1)}}.}
Foundations:  
One of the important series to know is the Geometric series. These are series with a common ratio between adjacent terms which are usually written
These are convergent if , and divergent if . If it is convergent, we can find the sum by the formula

where is the first term in the series (if the index starts at or , then "" is actually the first term or , respectively).
Another common type of series to evaluate is a telescoping series, where the telescoping better describes the partial sums, denoted Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle S_{k}} . Most of the time, they are presented as a fraction which requires partial fraction decomposition.
This can be accomplished fairly quickly via a shortcut when the factors in the denominator are linear and share the same coefficient on .
Example. Suppose we wish to decompose the fraction Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle {\frac {4}{(n-2)(n+1)}}} . First, consider the difference
Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle {\frac {1}{n-2}}-{\frac {1}{n-1}}}
If we combine this to a common denominator, we find
Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle {\frac {1}{n-2}}\cdot {\frac {n+1}{n+1}}-{\frac {1}{n+1}}\cdot {\frac {n-2}{n-2}}\,=\,{\frac {n+1-(n-2)}{(n-2)(n+1)}}\ =\ {\frac {3}{(n-2)(n+1)}}.}
To have a 1 in the numerator, we would just multiply by Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle 1/3,} or the reciprocal of the difference between the two constants. Thus
Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle {\begin{array}{rcl}{\displaystyle {\frac {4}{(n-2)(n+1)}}}&=&{\displaystyle 4\cdot {\frac {1}{(n-2)(n+1)}}}\\\\&=&4\cdot {\displaystyle {\frac {1}{3}}\left({\frac {1}{n-2}}-{\frac {1}{n+1}}\right).}\end{array}}}
Notice the pattern: for any fraction of the form 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 \frac{1}{(x+a)(x+b)}} where 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 a<b,} 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 {\displaystyle \frac{1}{(x+a)(x+b)}\,=\,\frac{1}{b-a}\left(\frac{1}{x+a}-\frac{1}{x+b}\right).}}
In this manner, we can quickly find that
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 {\displaystyle \frac{1}{n^{2}-25}\,=\,\frac{1}{(n-5)(n+5)}\,=\,\frac{1}{5-(-5)}\left(\frac{1}{n-5}-\frac{1}{n+5}\right)\,=\,\frac{1}{10}\left(\frac{1}{n-5}-\frac{1}{n+5}\right)}}
As per the so-called telescoping, consider the series defined by
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}\frac{1}{n^{2}-1}.}
Using the technique above, we can rewrite the series 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 \sum_{n=2}^{\infty}\frac{1}{(n-1)(n+1)}\,=\,\sum_{n=1}^{\infty}\frac{1}{2}\left(\frac{1}{n-1}-\frac{1}{n+1}\right).}
This means that
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 \begin{array}{cclcl} S_{2} & = & \frac{1}{2}\left(\frac{1}{1}-\frac{1}{3}\right)\\ \\ S_{3} & = & \frac{1}{2}\left(\frac{1}{1}-\frac{1}{3}+\frac{1}{2}-\frac{1}{4}\right) & = & \frac{1}{2}\left(\frac{1}{1}+\frac{1}{2}-\frac{1}{3}-\frac{1}{4}\right)\\ \\ S_{4} & = & \frac{1}{2}\left(\frac{1}{1}-\frac{1}{3}+\frac{1}{2}-\frac{1}{4}+\frac{1}{3}-\frac{1}{5}\right) & = & \frac{1}{2}\left(\frac{1}{1}+\frac{1}{2}-\frac{1}{4}-\frac{1}{5}\right)\\ \\ S_{5} & = & \frac{1}{2}\left(\frac{1}{1}-\frac{1}{3}+\frac{1}{2}-\frac{1}{4}+\frac{1}{3}-\frac{1}{5}+\frac{1}{4}-\frac{1}{6}\right) & = & \frac{1}{2}\left(\frac{1}{1}+\frac{1}{2}-\frac{1}{5}-\frac{1}{6}\right)\\ \\ \vdots & \vdots & \vdots\\ S_{k} & = & \frac{1}{2}\left(\frac{1}{1}+\frac{1}{2}-\frac{1}{k}-\frac{1}{k+1}\right). \end{array}}
Again, notice the pattern: each time there are exactly two surviving positive terms, and two surviving negative terms in each partial sum. If we then take the limit, we find
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}\frac{1}{n^{2}-1}\,=\,\lim_{n\rightarrow\infty}S_{n}\,=\,\lim_{n\rightarrow\infty}\frac{1}{2}\left(\frac{1}{1}+\frac{1}{2}-\frac{1}{n}-\frac{1}{n+1}\right)\,=\,\frac{3}{4}.}

 Solution:

(a):  
This is the easier portion of the problem. Each term grows by a ratio of 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 1/3} , and it reverses sign. Thus, there is a common ratio 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 r=-1/3} . Also, the first term is 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 1/2} , so we can write the series as a geometric 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=0}^{\infty}\,\frac{1}{2}\left(-\frac{1}{3}\right)^n.}
Then, the series converges to the 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\,=\,\frac{a_{0}}{1-r}\,=\,\frac {1/2}{1-(-1/3)}\,=\,\frac{1/2}{4/3}\,=\,\frac{3}{8}.}
(b):  
Using the technique in Foundations, we can rewrite the sequence 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 \sum_{n=1}^{\infty}\,\frac{3}{(2n-1)(2n+1)}\,=\,3 \sum_{n=1}^{\infty}\,\frac{1}{2} \left(\frac{1}{2n-1}-\frac{1}{2n+1}\right).}

Writing a few terms out, we find

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\,=\,\frac{3}{2}\left(\frac{1}{1}-\frac{1}{3}+\frac{1}{3}-\frac{1}{5}+\frac{1}{5}-\frac{1}{7}+\cdots \right).}
Since only one positive term and one negative term survive, 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_k \,=\,\frac{3}{2}\left( 1-\frac{1}{2k+1} \right),}
so the series converges to the sum S, where
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\,=\,\lim_{k\rightarrow\infty} S_k\,=\,\frac{3}{2}.}
Final Answer:  
The series in (a) converges to 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 3/8} , while the series in (b) converges to 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 3/2} .

Return to Sample Exam