Question about alternating series

Click For Summary
The discussion revolves around testing the convergence of the series ∑ (sin(nπ)/2)/n! using the alternating series test. Participants emphasize the need to prove that the series is decreasing and that the limit approaches zero as n approaches infinity. A key suggestion is to demonstrate that 1/n! is decreasing by showing that 1/(k+1)! < 1/k!. There is also a concern about how to handle the zero terms that appear in the series and whether the alternating series test can adequately address this. Ultimately, the conversation highlights the importance of rigorous proof in mathematical series convergence.
vande060
Messages
180
Reaction score
0

Homework Statement



test the series for divergence or convergence, and the only thing we have learned so far is alternating series test

(∞, n=1) ∑ (sin(nπ)/2)/n!

Homework Equations


The Attempt at a Solution



So I know that the alternating series test has two conditions that need to be satisfied.

1. series must be decreasing
2 limit as n approaches infinity must be 0

I'm not even sure how to show this series is decreasing, I know that plugging in numbers is not enough for my prof, and I need to prove it. I am not sure how to take the limit of a factorial either; I am really lost here

Ill try to write out the first few terms just to make things more clear for myself:

Sn = 1/1 + 0 -1/6 + 0 + 1/120 ...(sin((n-1)π)/2)/(n-1)!
 
Last edited:
Physics news on Phys.org
vande060 said:

Homework Statement



test the series for divergence or convergence, and the only thing we have learned so far is alternating series test

(∞, n=1) ∑ (sin(nπ)/2)/n!

Homework Equations


The Attempt at a Solution



So I know that the alternating series test has two conditions that need to be satisfied.

1. series must be decreasing
2 limit as n approaches infinity must be 0

I'm not even sure how to show this series is decreasing, I know that plugging in numbers is not enough for my prof, and I need to prove it. I am not sure how to take the limit of a factorial either; I am really lost here

Ill try to write out the first few terms just to make things more clear for myself:

Sn = 1/1 + 0 -1/6 + 0 ...(sin((n-1)π)/2)/(n-1)!
You must mean:

\sum{\frac{sin(\frac{n\pi}{n!})}{n!}}

Right? Otherwise every term is 0.

So, you need to show that if this is your sequence:

b_1 - b_2 + b_3 - b_4 \ldots

then b_{n+1} \leq b_n&lt;br /&gt; &lt;br /&gt; Now, forget about the n! (for now) and just write down the first few terms (actually &amp;quot;work out&amp;quot; the sin function for each term, hint: it is really easy). Now, just go and divide each term by n!. It should be clear that the sequence is decreasing. Once you have done this, try to show that limit is 0.
 
Last edited:
Robert1986 said:
You must mean:
\sum{\frac{sin(n\pi)}{n!}}

yeah the alt text pi does not show up the greatest, sorry

b_{n+1} \leq b_n/

Im not sure how to work this out, I already wrote out the first few terms of the sequence. The numerator alternates between -1, 0, and 1. I understand that dividing by n! will show the series is decreasing, but is there a different way to show that the series is decreasing. My prof insists we prove that a series is decreasing, for example, by taking the derivative of f(x). She said that writing down the first few terms of the series is not good enough. Do you have any idea how I could do this, it doesn't even seem possible with factorials.
 
Last edited:
sorry, forget about my last post, I am experiencing some technical difficulties and what I wrote isn't what I meant. I'm going to try to do it again, before my connection screws up :(
 
So, what you really need to show is that 1/n! is decreasing, that is:

1/(k+1)! < 1/k!

I would re-write the denominator of 1/(k+1)! as (k+1)k!. Proving it this way is sufficient since you are doing it for any k. As for the 0's that turn up in every other term, I don't see how you can deal with this if ALL you can use is the Alternating Series Test. Because, all you can show is the the subsequence consisting of all odd n converges, unless someone else has a better idea.
 
Robert1986 said:
So, what you really need to show is that 1/n! is decreasing, that is:

1/(k+1)! < 1/k!

I would re-write the denominator of 1/(k+1)! as (k+1)k!. Proving it this way is sufficient since you are doing it for any k.


As for the 0's that turn up in every other term, I don't see how you can deal with this if ALL you can use is the Alternating Series Test. Because, all you can show is the the subsequence consisting of all odd n converges, unless someone else has a better idea.

I understand this completely, but to prove maybe i could say

maybe i can say something like:

an = (sin(nπ)/2)/n!

bn = |an| , 0 ≤ bn ≤ 1/n!

since 1/n! is convergent, an is convergent. or is this way out there and wrong?
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
14
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 17 ·
Replies
17
Views
2K
Replies
7
Views
2K