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.
Here's how I did it. Start with the formula ∑ n = 0 ∞ x n = 1 − x 1 . Differentiate it to obtain ∑ n = 1 ∞ n x n − 1 = ( 1 − x ) 2 1 . Differentiate it again to obtain ∑ n = 2 ∞ n ( n − 1 ) x n − 2 = ∑ n = 1 ∞ n ( n + 1 ) x n − 1 = ( 1 − x ) 3 2 . Finally differentiate a third time to obtain ∑ n = 2 ∞ n ( n + 1 ) ( n − 1 ) x n − 2 = ∑ n = 1 ∞ n ( n + 1 ) ( n + 2 ) x n − 1 = ( 1 − x ) 4 6 . Substitute x = 2 1 into each of the equations, and then multiply both sides of each equation by 2 1 to obtain: ∑ n = 1 ∞ 2 n n = 2 , ∑ n = 1 ∞ 2 n n 2 + n = 8 , ∑ n = 1 ∞ 2 n n 3 + 3 n 2 + 2 n = 4 8 . Then, taking a certain linear combination of the equations will lead to the result. So I found a , b , c such that a n + b ( n 2 + n ) + c ( n 3 + 3 n 2 + 2 n ) = n 3 . This amounts to solving the system a + b + 2 c = 0 , b + 3 c = 0 , c = 1 , which is easily solved using back substitution as a = 1 , b = − 3 , c = 1 . So the answer is 2 a + 8 b + 4 8 c = 2 − 2 4 + 4 8 = 2 6 .
Problem Loading...
Note Loading...
Set Loading...
S 1 = n = 1 ∑ ∞ 2 n n = n = 0 ∑ ∞ 2 n n = n = 0 ∑ ∞ 2 n + 1 n + 1 = 2 1 ( n = 0 ∑ ∞ 2 n n + n = 0 ∑ ∞ 2 n 1 ) = 2 1 S 1 + 1 = 2
S 2 = n = 1 ∑ ∞ 2 n n 2 = n = 0 ∑ ∞ 2 n n 2 = n = 0 ∑ ∞ 2 n + 1 ( n + 1 ) 2 = 2 1 n = 0 ∑ ∞ 2 n n 2 + 2 n + 1 = 2 1 S 2 + S 1 + 1 = 6
S 3 = n = 1 ∑ ∞ 2 n n 3 = n = 0 ∑ ∞ 2 n n 3 = n = 0 ∑ ∞ 2 n + 1 ( n + 1 ) 3 = 2 1 n = 0 ∑ ∞ 2 n n 3 + 3 n 2 + 3 n + 1 = 2 1 S 3 + 2 3 S 2 + 2 3 S 1 + 1 = 2 ( 9 + 3 + 1 ) = 2 6