Show series [sin(n)]/n converges?

  • Thread starter erjkism
  • Start date
  • Tags
    Series
In summary: I have to show that this series converges, but that it doesn't converge absolutely.The Attempt at a Solutionif you say that the top of the equation is -1<sin(n)<1, you can then take the absolute value to get 0<sin(n)<1. so then the equation can look like this:\Sigma\frac{1}{n} from n=1 to infinity, which is a divergent series. i just don't know how to show that the original equation is convergent.Try to use D'alemberts test for convergence of series.\lim_{n\to\infty}\
  • #36
drpizza said:
How about writing the numerator as a MacLaurin Series, then dividing out the n in the denominator? Then, use a comparison test and compare it to the MacLaurin Series for Cos(n)?

Oh my you have lost the sum. Thus you have introduced a double sum. Analysis of such a some is likely harder than that of the original sum.
 
Physics news on Phys.org
  • #37
Do you know how to find Fourier expansions?
consider
(pi-x)/2 0<x<2pi
then consider x=1
 
  • #38
lurflurf said:
try sumation by parts
ΣuΔv=uv-ΣΔuEv
btw the sum is (π-1)/2

Hi lurflurf,

You obviously know what you are doing. I was writing the answer as arctan(sin(1)/(1-cos(1))), but yeah, that is more cleanly expressed as (pi-1)/2. But how do you set this up using this 'summation by parts'? And I haven't figured out the how the Fourier expansion works yet, but I'll look at it tomorrow. Really nice work. Most other contributions to this thread have been completely clueless.
 
Last edited:
  • #39
I haven't ever seen this summation by parts formula before, though I should have expected it exists, there must have been some discrete form for the continuous counterpart. As for the Fourier expansion, that seems even more out of such a course, though It is also a nice solution =]

Dick; as for the Fourier expansion, since f(x) = x is an odd function, the a coefficient is automatically zero whilst [tex]b_v = \frac{2}{\pi} \int^{\pi}_0 x \sin vx dx[/tex] which some quick integration by parts yields [tex]b_v = (-1)^{v+1} \frac{2}{v}[/tex], and so we get [tex] x = 2 \left( \frac{\sin x}{1} - \frac{\sin 2x}{2} + \frac{\sin 3x}{3} + ... \right) [/tex].

Rearranging and letting x=1 gives us the desired result, and putting in x= pi/2 gives us a very famous result =]

EDIT: O god i just realized I found the wrong Fourier series. argh
 
Last edited:
  • #40
Hmm. If you did everything right then x=1 does not give the desired solution. That's an alternating sign series (-1)^n*sin(n)/n. The original question doesn't have the alternating sign. Is there an extra sign that makes it work? But like I said, I didn't really look at that yet. I was trying to figure out the summation by parts thing. It makes perfect sense it such a thing would exist though. Thanks, Gib.
 
Last edited:
  • #41
Gib Z said:
I haven't ever seen this summation by parts formula before, though I should have expected it exists, there must have been some discrete form for the continuous counterpart. As for the Fourier expansion, that seems even more out of such a course, though It is also a nice solution =]

Dick; as for the Fourier expansion, since f(x) = x is an odd function, the a coefficient is automatically zero whilst [tex]b_v = \frac{2}{\pi} \int^{\pi}_0 x \sin vx dx[/tex] which some quick integration by parts yields [tex]b_v = (-1)^{v+1} \frac{2}{v}[/tex], and so we get [tex] x = 2 \left( \frac{\sin x}{1} - \frac{\sin 2x}{2} + \frac{\sin 3x}{3} + ... \right) [/tex].

Rearranging and letting x=1 gives us the desired result, and putting in x= pi/2 gives us a very famous result =]

EDIT: O god i just realized I found the wrong Fourier series. argh

Ok, if you do the right Fourier series, it does work. And yep, putting in x=pi/2 gives you the Gregory-Leibniz formula for pi. Interesting.
 
  • #42
lurflurf said:
Oh my you have lost the sum. Thus you have introduced a double sum. Analysis of such a some is likely harder than that of the original sum.

Ooops! That was as silly mistake. Should have worked it on paper first - I lose things when I'm typing them sometimes.
 
  • #43
For future reference, a systematic approach to this uses the Abel-Dedekind-Dirichlet theorem. The product of a sequence with bounded partial sums (sin(n), use a trig identity) and a function of bounded variation (1/n), converges as a series. This is proved using Abel's 'summation by parts', as lurflurf intimated.
 
  • #44
Dick said:
For future reference, a systematic approach to this uses the Abel-Dedekind-Dirichlet theorem. The product of a sequence with bounded partial sums (sin(n), use a trig identity) and a function of bounded variation (1/n), converges as a series. This is proved using Abel's 'summation by parts', as lurflurf intimated.

I came across that theorem yesterday and I was seeing if it fit with that problem, but I don't think it does because the partial sums of sin(n) must be bounded. How does one show that those partial sums are bounded?
 
  • #45
Use sin(nx)=[cos((n-1/2)x)-cos(n+1/2)x)]/(2*sin(x/2)). It's a telescoping series. So if A_n is the partial sum, |A_n|<=1/|sin(x/2)|. Clever, huh? Wish I'd thought of it. It shows things like sin(2n)/n converge also.
 
Last edited:
  • #46
Dick said:
Use sin(nx)=[cos((n-1/2)x)-cos(n+1/2)x)]/(2*sin(x/2)). It's a telescoping series. So if A_n is the partial sum, |A_n|<=1/|sin(x/2)|. Clever, huh? Wish I'd thought of it. It shows things like sin(2n)/n converge also.

That is very clever!

Well that problem would be appropriate for upper level math (analysis for use of the Dirichlet test, or applied math for engineers/physicists for recognizing that it's a Fourier series). But I think it's now safe to say that was probably an inappropriate problem for freshman calculus.
 
  • #47
DavidWhitbeck said:
That is very clever!

Well that problem would be appropriate for upper level math (analysis for use of the Dirichlet test, or applied math for engineers/physicists for recognizing that it's a Fourier series). But I think it's now safe to say that was probably an inappropriate problem for freshman calculus.

Probably so, I think the student who asked this ran away long ago.
 
  • #48
When I look at something like that, my temptation is to try to find an upper bound for:
[tex]f(n)=\sum_{j=1}^{k} \sin(jx)[/tex]
using geometry, and then to rearrange things into a sum that should look like:
[tex]\sum \frac{1}{n^2+n} f(n)[/tex]
 
  • #49
[tex]\sum_{n=1}^{\infty} a_n \, sin(n)[/tex]
converges whenever {an} is a decreasing sequence that tends to zero.

By : "[URL [Broken] Black"]Dirichlet's test[/FONT][/B][/U][/URL]
 
Last edited by a moderator:
  • #50
Dirichlet's test will work for this series.
we can think of sin(n)/n as the product sin(n)*1/n.
dirichlet's test says that if one of the sequences in the product is bounded, and the other is monotone and converges to 0 then the series of the product of sequences must converge.
the sequence of partial sums of sin(n) is bounded and certainly 1/n is monotone and converges to 0, so the series must converge.
 
  • #51
nice discussion here; I know the thread is a bit old but since so much trouble was stirred over this, I would like to also point out that dirichlet's test would have worked with this ( and would have proven this fairly easily ). It uses a lemma by Abel which says that if {bn} is non-decreasing and non-negative for each n, and terms a1,..,an are bounded: m <= a1 +... + an <= M for any n , then bk*m <= a1b1 +... + anbn <= bk*M.

Development of these theorems can be found in Spivak's Calculus book on chapters 22 (chapter on infinite series ) and 19 (chapter on integration in elementary terms ). In chapter 22, the Dirichlet test is developed in exercise 13 and in chapter 19, abel's theorem is developed in problem 35.
Not saying that it is very difficult at all, but for anyone who may be curious -- those are excellent sources
 
  • #52
one other technique that would work is an interesting criterion involving the partial sums. let sn be the nth partial sum of the series. If for every epsilon greater than zero there exists an N such that for all n>N we have
|sn+k - sn|<epsilon for all k >= 1, then the series must converge. (Knopp "Theory and Application of Infinite Series") A quick induction on k would make quick work of this series' convergence.
 
<h2>1. What does the notation "sin(n)" mean in this series?</h2><p>The notation "sin(n)" refers to the sine function, which is a mathematical function that takes in an input (in this case, the variable n) and outputs the sine of that value.</p><h2>2. How do you determine if a series converges?</h2><p>A series converges if the sum of its terms approaches a finite number as the number of terms approaches infinity. In this case, we can use the Limit Comparison Test to determine if the given series converges.</p><h2>3. What is the Limit Comparison Test?</h2><p>The Limit Comparison Test is a method used to determine the convergence or divergence of a series by comparing it to a known convergent or divergent series. In this case, we would compare the given series to a known convergent series, such as the harmonic series (1/n).</p><h2>4. Can you provide an example of a convergent series using the Limit Comparison Test?</h2><p>Yes, for example, if we have the series 1/n^2, we can use the Limit Comparison Test by comparing it to the known convergent series 1/n. Since the limit of (1/n^2)/(1/n) as n approaches infinity is equal to 0, we can conclude that the series 1/n^2 also converges.</p><h2>5. What is the significance of the sine function in this series?</h2><p>The sine function is used in this series because it is a common function in mathematics that has a known limit as n approaches infinity (equal to 0). This allows us to use the Limit Comparison Test to determine the convergence of the given series.</p>

1. What does the notation "sin(n)" mean in this series?

The notation "sin(n)" refers to the sine function, which is a mathematical function that takes in an input (in this case, the variable n) and outputs the sine of that value.

2. How do you determine if a series converges?

A series converges if the sum of its terms approaches a finite number as the number of terms approaches infinity. In this case, we can use the Limit Comparison Test to determine if the given series converges.

3. What is the Limit Comparison Test?

The Limit Comparison Test is a method used to determine the convergence or divergence of a series by comparing it to a known convergent or divergent series. In this case, we would compare the given series to a known convergent series, such as the harmonic series (1/n).

4. Can you provide an example of a convergent series using the Limit Comparison Test?

Yes, for example, if we have the series 1/n^2, we can use the Limit Comparison Test by comparing it to the known convergent series 1/n. Since the limit of (1/n^2)/(1/n) as n approaches infinity is equal to 0, we can conclude that the series 1/n^2 also converges.

5. What is the significance of the sine function in this series?

The sine function is used in this series because it is a common function in mathematics that has a known limit as n approaches infinity (equal to 0). This allows us to use the Limit Comparison Test to determine the convergence of the given series.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
87
  • Calculus and Beyond Homework Help
Replies
3
Views
353
  • Calculus and Beyond Homework Help
Replies
2
Views
658
  • Calculus and Beyond Homework Help
Replies
6
Views
272
  • Calculus and Beyond Homework Help
Replies
17
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
734
  • Calculus and Beyond Homework Help
Replies
1
Views
753
  • Calculus and Beyond Homework Help
Replies
5
Views
938
  • Calculus and Beyond Homework Help
Replies
15
Views
1K
  • Calculus and Beyond Homework Help
Replies
7
Views
919
Back
Top