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

Use Cauchy criterion to tell if series converges or not

OpenStudy (anonymous):

\[\frac{ \cos x }{ 2 }+\frac{ \cos 2x }{ 2^{2} }+....+\frac{ \cos nx }{ 2^{n} }+...\]

OpenStudy (anonymous):

does this series converge or not?

OpenStudy (anonymous):

@kropot72 @zepdrix any ideas?

OpenStudy (anonymous):

@zzr0ck3r can you help?

OpenStudy (anonymous):

@satellite73

OpenStudy (anonymous):

heeeellllppppppp please :-) :-)

OpenStudy (anonymous):

@UnkleRhaukus can you help by chance?

OpenStudy (anonymous):

i am going to say "yes" and then look up "cauchy" in any case each of these terms is bounded by \(\frac{1}{2^n}\)

OpenStudy (anonymous):

how do i use the cauchy criterion though to find out? u saying just b/c each term is bounded by 1/2^n

OpenStudy (anonymous):

given any \(\epsilon>0\) there is an \(N\) such that for all \(n,m>N\) you have \(|a_n-a_m|<\epsilon\) numerator is bounded above by \(1\) and below by \(-1\) so largest this can be is \[\frac{1}{2^n}+\frac{1}{2^m}\]

OpenStudy (anonymous):

at least i think that is right, maybe get a second opinion

OpenStudy (anonymous):

i have been trying for awhile as you can see, haha., you are the first to respond though, im not sure i will get lucky enough to get another response... does that say 1/2^n + 1/2^m its tough to read on my computer.

OpenStudy (anonymous):

\[\large \frac{1}{2^n}+\frac{1}{2^m}\]

OpenStudy (anonymous):

is the largest \[\large |\frac{\cos(nx)}{2^n}-\frac{\cos(mx)}{2^m}|\] can be

OpenStudy (anonymous):

so pick your \(N\) so that if \[\large n, m>N\] you get \[\large \frac{1}{2^n}+\frac{1}{2^m}<\epsilon\]

OpenStudy (anonymous):

and if there is a sup, or max then it has to converge?

OpenStudy (anonymous):

not sure what you mean you have to show what i wrote above

OpenStudy (anonymous):

check out this attachments

OpenStudy (anonymous):

ok i might be wrong, let me think for a moment or two you are trying to show that the series converges, not a sequence the sequence would be the partial sums

OpenStudy (anonymous):

yes, trying to show if the series converges or not.

OpenStudy (anonymous):

yeah i was totally wrong, but the idea is right

OpenStudy (anonymous):

replace \(a_n\) by \(S_n\) and you need to show that if for any \(\epsilon>0\) there is an \(N\) so that \(|S_n-S_m|<\epsilon\) which is the same as showing \[\large| a_{n+1}+a_{n+2}+a_{n+3}+...+a_{n+p}|<\epsilon\]

OpenStudy (anonymous):

in your case you have to show that \[ \frac{\cos((n+1)x)}{2^{n+1}}+\frac{\cos((n+2)x)}{2^{n+2}}+\frac{\cos((n+13)x)}{2^{n+3}}+...+\frac{\cos((n+p)x)}{2^{n+p}}\] can be made arbitrarily small

OpenStudy (anonymous):

but the numerator is still bounded above by 1, so the most this can be is \[\frac{1}{2^{n+1}}+\frac{1}{2^{n+2}}+\frac{1}{2^{n+3}}+...+\frac{1}{2^{n+p}}\]

OpenStudy (anonymous):

and this is less than or equal to \[\frac{1}{2^{n+1}}+\frac{1}{2^{n+1}}+\frac{1}{2^{n+1}}+...\frac{1}{2^{n+1}}\] \(p\) times or \[\frac{p}{2^{n+1}}\]

OpenStudy (anonymous):

which you can supply the details to make this arbitrarily small, remembering that you get to pick \(N\) so that \(n>N\)

OpenStudy (anonymous):

i appreciate you putting in the time on this one, this stuff is tough to understand for me, thank you for your time.

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!