Absolute Converge test for 1/[n*ln(n)]

  • Thread starter Thread starter donald1403
  • Start date Start date
  • Tags Tags
    Absolute Test
donald1403
Messages
16
Reaction score
0

Homework Statement



<br /> \sum_{n = 2}^{\infty} \frac{1}{n*ln(n)}<br />

I have to find whether the series absolute converge, conditionally converge or diverge?2. The attempt at a solution

I used the ratio test.

so, lim(n to infinity) [n*ln(n)]/[(n+1)*ln(n+1)]

since ln (n+1) will be greater than ln (n) and n+1 will be greater than n, the whole denominator will be greater than the numerator so when i take the limit, the value must be less than 1.

but i think i have cancel n or ln(n) to show that the whole limit is really less than 1 to converge.

help!

i m sorry . i dun know how to use the latex code..
 
Physics news on Phys.org
No, the limit is 1 even though each \frac{n \ln n}{(n + 1) \ln (n + 1)} &lt; 1, because \lim_{n \to \infty} \frac{n}{n + 1} = \lim_{n \to \infty} \frac{1}{1 + \frac{1}{n}} = 1 and \lim_{n \to \infty} \frac{\ln n}{\ln (n + 1)} = 1 by l'hopital's rule.

Since the limit is 1, the ratio test is inconclusive. Do you have any other methods to use?
 
i think i can use "limit comparison test" but i m not sure what i should use for bn.

if i use either 1/n or 1/ln(n) for bn, the limit goes to zero and since bn diverge, i can't decide on an(original term).

one more questions abt absolute convergence test. assuming the series is given, not alternative series, if i use one of the test n find out , it is divergent. it is divergent. rt?
i am confused with when i have to test for conditional convergence. is it only for alternate series.
all the examples in the textbook which turn out to be conditional convergence are alternate series..

sorry for asking too many questions in one post.
 
Use an integral test:
\int 1 / (n*ln|n|)
A certain substitution should eventually lead to an antiderivative of:
ln(ln(n))

I'll leave the rest to you (remember to look at what lim n->inf: ln(ln(n)) does)
 
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

Replies
3
Views
1K
Replies
4
Views
1K
Replies
6
Views
2K
Replies
2
Views
2K
Replies
5
Views
2K
Replies
3
Views
7K
Replies
1
Views
1K
Replies
4
Views
1K
Back
Top