n = 1 ∑ ∞ 2 n − 1 n ( n + 1 ) = 2 + 3 + 4 1 2 + 8 2 0 + 1 6 3 0 + 3 2 4 2 + 6 4 5 6 + ⋯
Compute the sum above.
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.
Exactly Same Way
So awesome just solved it .
Did the same
This is calculus approach
This sum can be rewritten as :
2 0 2 . 1 + 2 3 . 2 + 2 2 4 . 3 + 2 3 5 . 4 + . . . = n = 0 ∑ ∞ 2 n ( n + 2 ) ( n + 1 ) = n = 2 ∑ ∞ 2 n − 2 n ( n − 1 ) = n = 2 ∑ ∞ n ( n − 1 ) x n − 2 where x = 2 1
This last series can be summed by differentiating the geometric series twice.
So , for any ∣ x ∣ < 1 we have :
f ( x ) = n = 0 ∑ ∞ x n = 1 − x 1
f ′ ( x ) = n = 0 ∑ ∞ n x n − 1 = ( 1 − x ) 2 1
f ′ ′ ( x ) = n = 0 ∑ ∞ n ( n − 1 ) x n − 2 = ( 1 − x ) 3 2
Evaluating this last expression at x = 1 / 2 , and seeing that this is the same as the series we need to sum, we have the sum which is 16.
I have solved this by using arithmetic optometric sequence twice
Post the solution.
Problem Loading...
Note Loading...
Set Loading...
Let the given sum be S.
S = n = 1 ∑ ∞ 2 n − 1 ( n ) ( n + 1 ) = 1 ∑ ∞ 2 n − 1 n 2 + n
Absolute convergence can be proved using the ratio test, and hence we are free to rearrange the terms.
Let, S 1 = n = 1 ∑ ∞ 2 n − 1 n
S 1 = 1 + 2 2 + 4 3 + … ...(1)
2 S 1 = 2 1 + 4 2 + 8 3 + … ...(2)
Subtracting (2) from (1),
2 S 1 = 1 + 2 1 + 4 1 + 8 1 …
S 1 = 2 ⋅ 1 − 2 1 1 = 4
Let S 2 = n = 1 ∑ ∞ 2 n − 1 n 2
S 2 = 1 + 2 4 + 4 9 + … ..(3)
2 S 2 = 2 1 + 4 4 + 8 9 … ...(4)
Subtracting (4) from (3),
2 S 2 = 1 + 2 3 + 4 5 + … ...(5)
4 S 2 = 2 1 + 4 3 + 8 5 + … ...(6)
Subtracting (6) from (5),
4 S 4 = 1 + 2 2 + 4 2 + 8 2 + …
4 S 4 = 1 + 1 − 2 1 1 = 3
∴ S 2 = 4 ⋅ 3 = 1 2
S = S 1 + S 2 = 4 + 1 2 = 1 6