Sum convergence - is my approach flawless?

AI Thread Summary
The discussion centers on determining the convergence of the series ∑_{n=2}^{∞} n^{α} (log(n+1) - log(n))^4. The approach involves rewriting the series and applying the limit comparison test, revealing that the logarithmic term approaches 1, simplifying the analysis to ∑_{n=2}^{∞} 1/n^{4-α}. It is established that the series converges for α in the interval (0, 3), with specific emphasis on the need to justify each transformation step. Participants suggest proving that the logarithmic expression is less than 1 and approaches 1, which would confirm the convergence of the original series. Ultimately, the limit comparison test is highlighted as the key method for establishing convergence conditions.
twoflower
Messages
363
Reaction score
0
I have to find out, whether this sum converges:

<br /> \sum_{n = 2}^{+ \infty} n^{\alpha} \left( \log (n+1) - \log n \right)^4<br />

So I rewrote it:

<br /> \sum_{n = 2}^{+ \infty} n^{\alpha} \left( \log \left(1 + \frac{1}{n} \right) \right)^4 = <br />

<br /> \sum_{n = 2}^{+ \infty} n^{\alpha - 4} \left[ \frac {\log \left(1 + \frac{1}{n} \right)}{\frac{1}{n}} \right]^4<br />

Now I can see that the expression with log goes to 1, so the sum gets reduced to

<br /> \sum_{n = 2}^{+ \infty} \frac {1}{n^{4 - \alpha}}<br />

and the result is obviously \alpha \in \left(0, 3\right).

But, I don't know how exactly should I justify my decision. I'm not talking about the very last step now, but the one in which I threw away the logarithm because of the limit 1. We have to give reasons for each non-trivial step we do, so I think I should write some theorem or rule under that step...

Thank you.
 
Physics news on Phys.org
If you're saying that:

\sum_{n = 2}^{+ \infty} n^{\alpha - 4} \left[ \frac {\log \left(1 + \frac{1}{n} \right)}{\frac{1}{n}} \right]^4=\sum_{n = 2}^{+ \infty} \frac{1}{n^{4-\alpha}}
..then no.
But you can use it to compare the original series it with the right hand side.

If you can show
\left[ \frac {\log \left(1 + \frac{1}{n} \right)}{\frac{1}{n}} \right]^4&lt;1
and approaches 1, then you're home free. That means the original series converges too.
 
Galileo said:
If you're saying that:

\sum_{n = 2}^{+ \infty} n^{\alpha - 4} \left[ \frac {\log \left(1 + \frac{1}{n} \right)}{\frac{1}{n}} \right]^4=\sum_{n = 2}^{+ \infty} \frac{1}{n^{4-\alpha}}
..then no.
But you can use it to compare the original series it with the right hand side.

If you can show
\left[ \frac {\log \left(1 + \frac{1}{n} \right)}{\frac{1}{n}} \right]^4&lt;1
and approaches 1, then you're home free. That means the original series converges too.

Yes, I see what you mean. But...how should I prove this:

If you can show
\left[ \frac {\log \left(1 + \frac{1}{n} \right)}{\frac{1}{n}} \right]^4&lt;1

I only know the limit is 1, nothing more...
 
twoflower said:
Yes, I see what you mean. But...how should I prove this:

If you can show
\left[ \frac {\log \left(1 + \frac{1}{n} \right)}{\frac{1}{n}} \right]^4&lt;1

I only know the limit is 1, nothing more...

Use the limit comparison test. You know that n^{\alpha-4} converges for \alpha &lt;= 2.

Compare your given series

\sum_{n = 2}^{+ \infty} n^{\alpha - 4} \left[ \frac {\log \left(1 + \frac{1}{n} \right)}{\frac{1}{n}} \right]^4

to the series n^{\alpha-4}, and calculate the limit... which you've already discovered is 1 (this is essentially what you did anway). Since this is finite and greater than zero, your series must converge.

This also shows that when n^{\alpha-4} diverges ( \alpha &gt; 2, your series also diverges.
 
Last edited:
learningphysics said:
Use the limit comparison test. You know that n^{\alpha-4} converges for \alpha &lt;= 2.

Compare your given series

\sum_{n = 2}^{+ \infty} n^{\alpha - 4} \left[ \frac {\log \left(1 + \frac{1}{n} \right)}{\frac{1}{n}} \right]^4

to the series n^{\alpha-4}, and calculate the limit... which you've already discovered is 1 (this is essentially what you did anway). Since this is finite and greater than zero, your series must converge.

This also shows that when n^{\alpha-4} diverges ( \alpha &gt; 2, your series also diverges.

Now it's clear, thank you learningphysics and Galileo. Limit comparsion test is the clue.
 
learningphysics said:
Use the limit comparison test. You know that n^{\alpha-4} converges for \alpha &lt;= 2.

Compare your given series

\sum_{n = 2}^{+ \infty} n^{\alpha - 4} \left[ \frac {\log \left(1 + \frac{1}{n} \right)}{\frac{1}{n}} \right]^4

to the series n^{\alpha-4}, and calculate the limit... which you've already discovered is 1 (this is essentially what you did anway). Since this is finite and greater than zero, your series must converge.

This also shows that when n^{\alpha-4} diverges ( \alpha &gt; 2, your series also diverges.

I thought it was clear to me, but some time ago I had to solve similar problem and I realized that comparing my original sum to some other sum only tells me, for which \alpha it converges surely, but it doesn't tell me all \alpha values for which it converges. I hope I expressed it in an understandable way...
 
I multiplied the values first without the error limit. Got 19.38. rounded it off to 2 significant figures since the given data has 2 significant figures. So = 19. For error I used the above formula. It comes out about 1.48. Now my question is. Should I write the answer as 19±1.5 (rounding 1.48 to 2 significant figures) OR should I write it as 19±1. So in short, should the error have same number of significant figures as the mean value or should it have the same number of decimal places as...
Thread 'A cylinder connected to a hanging mass'
Let's declare that for the cylinder, mass = M = 10 kg Radius = R = 4 m For the wall and the floor, Friction coeff = ##\mu## = 0.5 For the hanging mass, mass = m = 11 kg First, we divide the force according to their respective plane (x and y thing, correct me if I'm wrong) and according to which, cylinder or the hanging mass, they're working on. Force on the hanging mass $$mg - T = ma$$ Force(Cylinder) on y $$N_f + f_w - Mg = 0$$ Force(Cylinder) on x $$T + f_f - N_w = Ma$$ There's also...

Similar threads

Back
Top