Ask your own question, for FREE!
Mathematics 20 Online
OpenStudy (anonymous):

Confused how to go about this problem. Any help is appreciated

OpenStudy (anonymous):

http://prntscr.com/awfv3n

satellite73 (satellite73):

you need two things for the alternating series test the absolute value of the terms are decreasing i.e without the alternating business and also that the terms go to zero

satellite73 (satellite73):

pretty clear how to write this is sigma notation with a general term \(a_n\) yes? (or no?)

OpenStudy (anonymous):

Not really. I understand the conditions of the alternating series test but i never really learned sigma notation

satellite73 (satellite73):

ok what is the pattern then?

OpenStudy (anonymous):

(n+1)^2

satellite73 (satellite73):

once we identify the patter, writing it as a sum is the easy part

OpenStudy (anonymous):

(-1)(n+1)^2

satellite73 (satellite73):

forget the +1

OpenStudy (anonymous):

oh yeah true

satellite73 (satellite73):

also, don't you need a fraction?

OpenStudy (anonymous):

(-1)/(n)^2

satellite73 (satellite73):

yea that is all the 2 is a constant, we can write that in front of the big ugly sigma \[2\sum_{n=1}^{\infty}\frac{(-1)^n}{n^2}\]

satellite73 (satellite73):

ok that is not exactly right, that one alternates wrong no matter

OpenStudy (anonymous):

yeah I realized that right when I saw yours

satellite73 (satellite73):

\[2\sum_{n=1}^{\infty}\frac{(-1)^{n+1}}{n^2}\]

OpenStudy (anonymous):

oh nvm i thought you were talking about mine. Mine didnt alternate. I see what you mean now though

satellite73 (satellite73):

ok so you need to show two things \[a_{n+1}<a_n\] i.e. \[\frac{1}{(n+1)^2}<\frac{1}{n}\]

satellite73 (satellite73):

oops typo again

satellite73 (satellite73):

\[\frac{1}{(n+1)^2}<\frac{1}{n^2}\]

OpenStudy (anonymous):

1/n^2 is bigger because the value of denominator would be bigger on the other one

satellite73 (satellite73):

which i would just say, since it is completely obvious

satellite73 (satellite73):

and also that \[\lim_{n\to\infty}\frac{1}{n^2}=0\] which is another "doh"

OpenStudy (anonymous):

yeah so all 3 conditions are met the series is convergent

OpenStudy (anonymous):

how do we estimate the error?

satellite73 (satellite73):

i have no idea

satellite73 (satellite73):

ok maybe a little idea since it alternates, add up a few terms and see when you get two that are within \(.05\) of each other

OpenStudy (anonymous):

Im supposed to justify this in an essay so I feel as if there is a method

satellite73 (satellite73):

when you add the terms go back and forth plus or minus, so you get closer with each term to the true sum if two are within \(.05\) of each other then you will never get further away

satellite73 (satellite73):

@jim_thompson5910 ?

satellite73 (satellite73):

well kinda what is said is the reasoning i am sure there is a more succinct way to put it, and i am sure it is in your text too

OpenStudy (anonymous):

I believe the la grange error bound thing could be used but I am not too familiar with it

OpenStudy (anonymous):

that would be more of a plug and chug although it makes sense to just keep running the sum until we approach .05

satellite73 (satellite73):

well there is a bit of something else going on here since it alternates that would not work if it did not, since you would not know how far away the true sum is

satellite73 (satellite73):

and you are not approaching \(.05\) you are getting to within \(.05\) of the sum here is an example http://www.wolframalpha.com/input/?i=2%281-1%2F4%2B1%2F9-1%2F16%29-2%281-1%2F4%2B1%2F9-1%2F16%2B1%2F25%29

satellite73 (satellite73):

the next difference will be less than \(.08\)

OpenStudy (anonymous):

oh ok

OpenStudy (anonymous):

so we just want to be .05 off the true answer

OpenStudy (anonymous):

im looking around trying to see how to do this

OpenStudy (anonymous):

yeah cant figure it out

OpenStudy (anonymous):

@ganeshie8 @jim_thompson5910 can either of you potentially help?

ganeshie8 (ganeshie8):

You may do the part b by using \[|s-s_n| \le b_{n+1}\]

ganeshie8 (ganeshie8):

Here \(b_n = \dfrac{2}{n^2}\)

ganeshie8 (ganeshie8):

since you want that error to be less than 0.05, you need to solve \[b_{n+1} \le 0.05\]

ganeshie8 (ganeshie8):

\[\dfrac{2}{(n+1)^2}\le 0.05\]

OpenStudy (anonymous):

2/(n+1)^2 <_ .05

OpenStudy (anonymous):

and then solve for n. Would that be the amount of terms needed in the sequence?

ganeshie8 (ganeshie8):

\[(n+1)^2 \ge \dfrac{2}{0.05}\]

ganeshie8 (ganeshie8):

\[(n+1)^2 \ge 40\]

ganeshie8 (ganeshie8):

\[n+1 \ge 6.32\]

ganeshie8 (ganeshie8):

\[n \ge 5.32\]

ganeshie8 (ganeshie8):

that means you need at least 6 terms to make the error in estimation less than 0.05

OpenStudy (anonymous):

Thank you so much

OpenStudy (anonymous):

That was way easier than i thought it to be

OpenStudy (anonymous):

$$2-\frac24+\frac29-\frac2{16}+\dots=\sum_{n=1}^\infty (-1)^n\frac2{n^2}$$clearly \(2/n^2\to0\) as \(n\to\infty\) so it converges by the alternating series test. to determine the number of terms needed, we find $$\bigg|\sum_{n=k}^\infty (-1)^n\frac2{n^2}\bigg|< 0.05$$ since \(2/n^2\) decreases monotonically, it follows that we simply need to find the last term that contributes at most \(0.05\): $$\frac2{n^2}<0.05\\2<0.05n^2\\40<n^2\\n\ge 2\sqrt{10}\approx 6.3$$ so we need at least the first \(7\) terms

OpenStudy (anonymous):

oops, that should read \((-1)^{n+1}\) my above reasoning is flawed, though -- that is a sufficient but not necessary condition for the error to be at most \(0.05\)

ganeshie8 (ganeshie8):

Ahh right, 6 terms is also at most, not at least

OpenStudy (anonymous):

actually it *is* at least 6 terms, it's just not a tight bound

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!