Is There a Convergence Test for the Series 1/(n*n^(1/n))?

  • Thread starter Thread starter Piamedes
  • Start date Start date
  • Tags Tags
    Convergence
Piamedes
Messages
41
Reaction score
0

Homework Statement


Test for convergence the series:
a_[n] = \frac{1}{n*n^{\frac{1}{n}}}


Homework Equations


Various Sequence Convergence Tests


The Attempt at a Solution


So far I've tried both a normal comparison and limit comparison test with n^2. The normal one seemed fine until the end. Here was my logic:

For n greater than 1 (its just less than, not equal)

n^{\frac{1}{n}} \le n

\frac{1}{n^{\frac{1}{n}}} \ge \frac{1}{n}

\frac{1}{n*n^{\frac{1}{n}}} \ge \frac{1}{n^2}}

But that doesn't work because it just proves that for every term, this sequence is greater than the p-series for n^2.

For the limit comparison test I don't get an actual limit, so I can't use it.

If anyone has any suggestions for which test to use, or what series to compare it to, I would be most grateful.
 
Physics news on Phys.org
Would n^{\frac{1}{n}} \le \log n work?
 
uh, I'm pretty sure that your inequality is backwards
 
Piamedes said:
uh, I'm pretty sure that your inequality is backwards

I'm pretty sure I'm right for "large" n. And on further reflection, n^(1/n) < 2 is even better.
 
thanks, the comparison with 2 works perfectly
 
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