Convergence Test for Series with Exponential and Polynomial Terms

wanchosen
Messages
19
Reaction score
0
I am having problems with the following question:

Using an appropriate convergence test, find the values of x \in R for which the following series is convergent:

(\sumnk=1 1/ekkx)n

I used the ratio test to solve this but I'm not so sure about my solution:

n1 = \frac{1}{e}

n2 = \frac{1}{e} + \frac{1}{e^2 * 2^x}

n3 = \frac{1}{e} + \frac{1}{e^2 * 2^x} + \frac{1}{e^3 * 3^x}

n4 = \frac{1}{e} + \frac{1}{e^2 * 2^x} + \frac{1}{e^3 * 3^x} + \frac{1}{e^4 * 4^x}

\sum all n = \frac{n}{e} + \frac{n-1}{e^2*2^x} + \frac{n-2}{e^3*3^x}

So,

Un = \sumnn=1 \frac{n-(k-1)}{e^k*k^x} = \frac{n-(k-1)}{e^n*n^x}

Un+1 = \sumnk=1 \frac{(n+1)-(k-1)}{e^n*n^x} = \frac{n-k+2}{e^(n+1) * (n+1)^x}

n-->\infty

Un+1/Un = \frac{(n-k+2)n^x}{(n-k+1)*(n+1)^x}

divide by n

= \frac{((1-(k/n))n^(x-1)}{(1-(k/n)+(1/n)*((n+1)^x)/n}

Lim\infty nx-1 if convergent

|nx-1| < 1

so,

x-1 < 0

x < 1

Does this look right?
 
Physics news on Phys.org
How did you get this?
\sum all n = \frac{n}{e} + \frac{n - 1}{e^2 * 2^x} + \frac{n - 2}{e^3 * 3^x}
 
I assumed because the whole expression is encased in ()n that we summed all terms for each value of k upto n.
 
I'm not sure why you are calling the "n1", "n2", etc. I presume you just mean "n= 1", "n= 2", etc.

And, I'm not at all clear on what you are doing calculating all those terms. You said you used the ratio test but that's just
\left(e^{-k}k^{-x}\right)\left(e^{k+1}(k+1)^{x}\right)= e\left(\frac{k+1}{k}\right)^k
What is that as k goes to infinity? For what x is it less than 1?
 
Yes, I had misunderstood the ()n.

I believe, effectively the series is :-

\sumn \frac{1}{e^n * n^x}

If

Un = \frac{1}{e^n * n^x}

and

U(n+1) = \frac{1}{e^(n+1) * (n+1)^x}

then

U(n+1)/Un = \frac{n^x}{e * (n+1)^x}

Therefore if the series is convergent:

\frac{n^x}{(n+1)^x} < e

ln(\frac{n^x}{(n+1)^x}) < 1

x * ln(\frac{n}{n+1}) < 1

n/n+1 is always positive but less than one :- ln term is negative,

x > \frac{1}{ln(n) - ln (n+1)}

but is this a final solution?
 
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