How do you determine the convergence or divergence of #Sigma ((-1)^(n+1))/(2n-1)# from #[1,oo)#?

2 Answers
Nov 20, 2016

Alternating series, which alternate between having positive and negative terms, often come in the forms #sum_(n=1)^oo(-1)^na_n# or #sum_(n=1)^oo(-1)^(n+1)a_n#. The only difference between these two is which terms are positive and which are negative.

Leibniz's rule, or the alternating series test, can be used to determine if one of these series converges or not.

For an alternating series such as #sum_(n=1)^oo(-1)^na_n# or #sum_(n=1)^oo(-1)^(n+1)a_n#, the sum will converge if both:

  • #lim_(nrarroo)a_n=0" "" "# (the sequence approaches #0#)
  • #a_n>=a_(n+1)" "" "# (the sequence is decreasing)

So, for #sum_(n=1)^oo(-1)^(n+1)/(2n-1)#, we see that the sequence being alternated is #a_n=1/(2n-1)#.

We see that #lim_(nrarroo)a_n=lim_(nrarroo)1/(2n-1)=lim_(nrarroo)(1/n)/(2-1/n)=0#. We also can see that as #nrarroo#, the denominator of #1/(2n-1)# will steadily grow, so #1/(2n-1)# will steadily decrease.

We can also show that #a_n>=a_(n+1)# by actually setting up that inequality:

#1/(2n-1)>=1/(2(n+1)-1)=>1/(2n-1)>=1/(2n+1)#

And then by cross-multiplying and solving this inequality, which is tedious, we can show that this is always true (at least for #n>1#).

Anyway, we've showed that #lim_(nrarroo)a_n=0# and #a_n>=a_(n+1)#, so we can conclude that #sum_(n=1)^oo(-1)^(n+1)/(2n-1)# converges.

Nov 20, 2016

Arranging and adding successive terms

#1/(2k-1)-1/(2(k+1)-1)=1/(2k-1)-1/(2k+1)=2/((2k)^2-1)#

so

#sum_(k=1)^oo(-1)^(k+1)/(2k-1)=sum_(k=0)^oo 2/((2(2k+1))^2-1)#.

and we have

#sum_(k=0)^oo 2/((2(2k+1))^2-1) < sum_(k=0)^oo 2/(2(2k+1))^2<2sum_(k=1)^oo 1/k^2 = 2pi^2/6#

so

#sum_(k=1)^oo(-1)^(k+1)/(2k-1)# converges.