How to prove the sequence {cos(n)} diverges
What tests do you have? Is cosine bounded? if so by what?
lcos(n)l <=1 , can it be done by sqeeze theorem ?
I wasn't thinking that, but actually, I think it can what function would you use?
i don't know, so i would like to know if there is another way :/
I think squeeze will be easiest
why don't we do harmonic?
like 2/n
value of cos n oscillates between -1 and 1,hence it do not converge.
need a full proof
though I agree, think they need something a bit more substantial
is is possible for a sequence to be bounded and convergent ? if you said so
? sorry can you rephrase that, i don't understand your question
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
oh it's a thing for cosine, sine but ie 1/n^2 is convergent, but bounded
actually in order to converge, it has to be bounded i believe, but anyways let's try squeeze
so can you think of a function that diverges which is always greater than cosine?
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
meh, semantics, I think of them as one in the same you compare by picking a fn then their limits squeeze an answer
but my initial thought was the integral test, though I doubt you've proven sin's div if you haven't done cos
could just convert it into it's series form. basic but simple way
how can we convert a sequence into a series? I thought we only can covert a function into a series ?
meh true i was thinking in series, partial sums( subsequences)? ie n>0 n=0 n<0
n=0 yields 1+1+1 --> diverge
okay
check the others maybe
uhm hmm
i mean it contains a divergent subsequence, wouldn't that be enough?
n=2kpi not 0
i think it's enough to prove it's divergent, maybe i use that way by partial sums, thankyou
np sorry, I forget how we acually proved proved it it was like a common sense thing
but i mean if you graph it the tops cancel out the bottoms right?
so you are left with 1+1+1+1....
that's how i'd go about it without using any tests I think
maybe that's it, there's another way to prove it by epsilon, but i'm not quite sure by that way either
hmm i'd have to think on it
you mean by def of a limit right?
yeah, it's a hard way to do though
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! }+...\]
we had suggested that, but it's a sequence not a series, so that would have to be done for every term
which would be a little much unless you can think of a way to apply it
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.
we'd have to prove that test works first
but yea, since there is no limit that would work
I totally forgot about that one
Join our real-time social learning platform and learn together with your friends!