For the given series, determine the radius of convergence :
n = 1 ∑ ∞ n n x n
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Thank you for sharing your solution
Consider the series ∑ n = 1 ∞ n n x n whose coefficients are a n = n − n ,
then let α = lim sup ∣ a n ∣ n 1 = lim ∣ n − n ∣ n 1 = lim sup n n − 1 , (sup: supreme )
since the power is always negative, all the terms must be less than or equal to 1; therefore, α ≤ 1 .
Now, take the sub sequence of terms for n = 2 k ⟹ n − 1 n = 2 2 2 k − k , as k goes to infinity, 2 2 k k goes to 0 , implies 2 2 2 k − k goes to 1 . Since the limit of sub sequence is equal to 1 , and we have proved earlier that the limit of the sequence is less than or equal to 1 ; therefore, the limit of the series is 1 , thus the radius of convergence is 1 .
Problem Loading...
Note Loading...
Set Loading...
Consider the function k 2 x k . Since exponentials grow faster than polynomials, this function diverges for ∣ x ∣ > 1 as k → ∞ .
Now consider ( k 2 x k ) k . Since ∣ x k ∣ > ∣ x ∣ for ∣ x ∣ > 1 , k > 1 , this function also diverges for ∣ x ∣ > 1 as k → ∞ . Now, letting k = n , we see that ( ( n ) 2 x n ) n = n n x n must also diverge, and hence the sum must diverge for ∣ x ∣ > 1 . So, we know that the radius of convergence must be at least 1.
To prove that the sum converges for ∣ x ∣ ≤ 1 , we look at x = 1 : n = 0 ∑ ∞ n n 1 n = 1 + 1 + n = 2 ∑ ∞ n n 1 < 1 + 1 + n = 2 ∑ ∞ n 2 1 By the p-series test, this sum converges, and hence the required sum converges for x = 1 .
Then, if ∣ x ∣ ≤ 1 we have ∣ x n ∣ ≤ 1 for any n ≥ 0 , and hence n = 0 ∑ ∞ ∣ ∣ ∣ ∣ n n x n ∣ ∣ ∣ ∣ ≤ n = 0 ∑ ∞ n n 1 This proves that the sum is absolutely convergent, and therefore convergent, for all ∣ x ∣ ≤ 1 , and divergent for all ∣ x ∣ ≥ 1 , and thus the radius of convergence is 1.