Checking convergence of series My task is to check whether the series <munderover> &#x22

Roland Manning

Roland Manning

Answered question

2022-06-20

Checking convergence of series
My task is to check whether the series
n = 1 ( 2 ) n + n 2 n 2 n
converges or not. So I tried expanding the fraction like that(should equal to original form):
n = 1 ( 1 ) n 2 n n 2 n + n 2 n 2 n = n = 1 ( 1 ) n 1 n + n 2 n
Then I thought about that the first addend does converge because of Leibniz's rule and the second addend converges because 2 n grows much faster than n
But I'm not sure(and rather thinking this form of argumentation is wrong) if I can take addends of a series and prove convergence for each addend instead of proving convergence for the whole series.
I would appreciate if someone can point me to the right direction.

Answer & Explanation

Stevinivm

Stevinivm

Beginner2022-06-21Added 18 answers

The 1st one is ln 2 (Taylor series).
The 2nd one is
f ( x ) = n = 1 n x n
f ( x ) x d x = n = 1 x n = x 1 x
f ( x ) = x ( x 1 x ) = x ( 1 x ) 2
n = 1 n ( 1 2 ) n = 1 2 ( 1 1 2 ) 2 = 2
So the total sum is 2 ln 2
boloman0z

boloman0z

Beginner2022-06-22Added 10 answers

To control if the series:
n = 1 ( 1 ) n 1 n + n 2 n
you can use the Leibniz's rule. First you have to demonstrate that
1 n + n 2 n < 0
for every n. Indeed you can note that rewriting the expression
2 n + n 2 n 2 n < 0
. Therefore now you know that for n
1 n + n 2 n 0
therefore you have to demonstrate
1 n + n 2 n
is decreasing proving that the derivate of f ( x ) = 1 x + x 2 x < 0 after a value of x.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?