Series Test for convergent and divergent

mikbear
Messages
5
Reaction score
0

Homework Statement


Ʃ √n/(ln(n))^2
from n=2 to ∞


Homework Equations



Series Test for convergent and divergent

The Attempt at a Solution



I tried doing ratio test and gotten
[√(n+1)*(ln(n))^n] / [(ln(n+1))^(n+1) * √n]

to find the limit, do i cont by using Hopstal rule?
 
Physics news on Phys.org
mikbear said:

Homework Statement


Ʃ √n/(ln(n))^2
from n=2 to ∞

Homework Equations



Series Test for convergent and divergent

The Attempt at a Solution



I tried doing ratio test and gotten
[√(n+1)*(ln(n))^n] / [(ln(n+1))^(n+1) * √n]
That is not correct. It should be
$$ \frac{\sqrt{n+1}~(ln(n))^2}{\sqrt{n}~(ln(n+1))^2}$$

In any case, I don't think the Ratio Test is going to be much help here. What other tests do you know?
mikbear said:
to find the limit, do i cont by using Hopstal rule?
 
The absolute first check you should always make is to check that the nth term approaches 0. l'Hopital's should help there.
 
I made a mistake in the question its suppose to be power of n

Ʃ √n/(ln(n))^n
from n=2 to ∞

I have learned root test, integral test, comparison and limit test.

however I do not see how these will help solve this question.
 
mikbear said:
I made a mistake in the question its suppose to be power of n

Ʃ √n/(ln(n))^n
from n=2 to ∞

I have learned root test, integral test, comparison and limit test.

however I do not see how these will help solve this question.

That's little more subtle. Can you show (ln(n))^n will eventually dominate any power series? For example, (ln(n))^n>n^2 for sufficiently large n? That would let you make a comparison test.
 
Oh. thanks for the tip. I gona try it rite now. Thanks
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...

Similar threads

Back
Top