Determining convergence of a sum

  • Thread starter Thread starter pk1234
  • Start date Start date
  • Tags Tags
    Convergence Sum
Click For Summary

Homework Help Overview

The discussion revolves around determining the convergence of the series defined by the terms a_n = |sin n| / n. Participants are exploring the behavior of this series and the implications of its terms in relation to convergence criteria.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the idea of creating a subsequence of terms where a_n > epsilon > 0 and comparing it to the divergent series 1/n. There is uncertainty about how to identify sufficient terms that meet this criterion. One participant suggests examining the relationship between |sin n| and |sin(n+1)| to establish bounds.

Discussion Status

Some guidance has been offered regarding the exploration of the sine function's properties and how they might relate to the convergence of the series. Participants are actively engaging with the problem and considering various approaches, but no consensus has been reached on a definitive method or solution.

Contextual Notes

Participants are grappling with the challenge of proving the existence of terms greater than a specified epsilon and the implications of their findings on the overall convergence of the series. There is an acknowledgment of the complexity involved in analyzing the sine function's behavior at integer values.

pk1234
Messages
11
Reaction score
0
I'd really appreciate some help with a sum of:

a_n= |sin n| / n

All I've thought of, is that I should probably create a subsequence of {a_n}, such that all the elements of this subsequence {a_n_k} are >epsilon >0, and then compare the subsequence to 1/n which diverges.
However, I have no idea how to go about this. I don't know how to show, that there really is 'enough' of >epsilon>0 terms. I can't think of a pattern by which to choose only those n, for which a_n > epsilon>0, and I don't really know whether that's possible. If I knew that | sin n| > 0.1 for all n=4k -2 or something like that, it would probably be easy, but since that seems impossible, I don't know what to do.
 
Physics news on Phys.org
pk1234 said:
I'd really appreciate some help with a sum of:

a_n= |sin n| / n

All I've thought of, is that I should probably create a subsequence of {a_n}, such that all the elements of this subsequence {a_n_k} are >epsilon >0, and then compare the subsequence to 1/n which diverges.
However, I have no idea how to go about this. I don't know how to show, that there really is 'enough' of >epsilon>0 terms. I can't think of a pattern by which to choose only those n, for which a_n > epsilon>0, and I don't really know whether that's possible. If I knew that | sin n| > 0.1 for all n=4k -2 or something like that, it would probably be easy, but since that seems impossible, I don't know what to do.

No, that won't work. Try to think more basic. Suppose |sin n|<1/10. Can you show |sin(n+1)|>1/10? That would mean for every pair of numbers n, n+1 then either |sin n| or |sin n+1|>1/10. What could you do with that?
 
Thanks.

If I prove that, should I then take a series of:
b_k = a_2k-1 + a_2k, and say that for all k element N, b_k >= (1/10) * (1/2k) = 1/20k, which diverges?
 
pk1234 said:
Thanks.

If I prove that, should I then take a series of:
b_k = a_2k-1 + a_2k, and say that for all k element N, b_k >= (1/10) * (1/2k) = 1/20k, which diverges?

Sure that's the idea. And proving my statement can be done pretty crudely. Just draw a graph of the sine function and it should be easy to convince yourself.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
4
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K