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

How to prove the sequence {cos(n)} diverges

OpenStudy (fibonaccichick666):

What tests do you have? Is cosine bounded? if so by what?

OpenStudy (anonymous):

lcos(n)l <=1 , can it be done by sqeeze theorem ?

OpenStudy (fibonaccichick666):

I wasn't thinking that, but actually, I think it can what function would you use?

OpenStudy (anonymous):

i don't know, so i would like to know if there is another way :/

OpenStudy (fibonaccichick666):

I think squeeze will be easiest

OpenStudy (fibonaccichick666):

why don't we do harmonic?

OpenStudy (fibonaccichick666):

like 2/n

OpenStudy (anonymous):

value of cos n oscillates between -1 and 1,hence it do not converge.

OpenStudy (fibonaccichick666):

need a full proof

OpenStudy (fibonaccichick666):

though I agree, think they need something a bit more substantial

OpenStudy (anonymous):

is is possible for a sequence to be bounded and convergent ? if you said so

OpenStudy (fibonaccichick666):

? sorry can you rephrase that, i don't understand your question

OpenStudy (anonymous):

Surjihayer proved it's divergent by saying its oscillations between -1 and 1, but i would like to know if it's possible for {cos(n)} to be bounded by -1 and 1, and still convergent. Clearly i just need proof

OpenStudy (fibonaccichick666):

oh it's a thing for cosine, sine but ie 1/n^2 is convergent, but bounded

OpenStudy (fibonaccichick666):

actually in order to converge, it has to be bounded i believe, but anyways let's try squeeze

OpenStudy (fibonaccichick666):

so can you think of a function that diverges which is always greater than cosine?

OpenStudy (anonymous):

i think the sqeeze theorem is usually compared with a definite number, if you have to think of another function, i think it's Comparison Test

OpenStudy (fibonaccichick666):

meh, semantics, I think of them as one in the same you compare by picking a fn then their limits squeeze an answer

OpenStudy (fibonaccichick666):

but my initial thought was the integral test, though I doubt you've proven sin's div if you haven't done cos

OpenStudy (fibonaccichick666):

could just convert it into it's series form. basic but simple way

OpenStudy (anonymous):

how can we convert a sequence into a series? I thought we only can covert a function into a series ?

OpenStudy (fibonaccichick666):

meh true i was thinking in series, partial sums( subsequences)? ie n>0 n=0 n<0

OpenStudy (fibonaccichick666):

n=0 yields 1+1+1 --> diverge

OpenStudy (anonymous):

okay

OpenStudy (fibonaccichick666):

check the others maybe

OpenStudy (fibonaccichick666):

uhm hmm

OpenStudy (fibonaccichick666):

i mean it contains a divergent subsequence, wouldn't that be enough?

OpenStudy (fibonaccichick666):

n=2kpi not 0

OpenStudy (anonymous):

i think it's enough to prove it's divergent, maybe i use that way by partial sums, thankyou

OpenStudy (fibonaccichick666):

np sorry, I forget how we acually proved proved it it was like a common sense thing

OpenStudy (fibonaccichick666):

but i mean if you graph it the tops cancel out the bottoms right?

OpenStudy (fibonaccichick666):

so you are left with 1+1+1+1....

OpenStudy (fibonaccichick666):

that's how i'd go about it without using any tests I think

OpenStudy (anonymous):

maybe that's it, there's another way to prove it by epsilon, but i'm not quite sure by that way either

OpenStudy (fibonaccichick666):

hmm i'd have to think on it

OpenStudy (fibonaccichick666):

you mean by def of a limit right?

OpenStudy (anonymous):

yeah, it's a hard way to do though

OpenStudy (anonymous):

can it be of any help? \[\cos x=1-\frac{ x^2 }{ 2! }+\frac{ x^4 }{ 4! }-\frac{ x^6 }{ 6! }+...+\frac{ \left( -1 \right)^kx ^{2k} }{ 2k! }+...\]

OpenStudy (fibonaccichick666):

we had suggested that, but it's a sequence not a series, so that would have to be done for every term

OpenStudy (fibonaccichick666):

which would be a little much unless you can think of a way to apply it

OpenStudy (kainui):

Can't we just do the divergence test? Since the limit as n approaches infinity of cos(n) is not 0, then we know it must diverge.

OpenStudy (fibonaccichick666):

we'd have to prove that test works first

OpenStudy (fibonaccichick666):

but yea, since there is no limit that would work

OpenStudy (fibonaccichick666):

I totally forgot about that one

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!