A sequence { x n } satisfies the recurrent relation below:
⎩ ⎪ ⎨ ⎪ ⎧ x 0 = 1 x n = − n 2 2 5 ( x 0 + x 1 + x 2 + . . . + x n − 1 ) for n ≥ 1
Find the value of x 0 + 2 x 1 + 2 2 x 2 + 2 3 x 3 + . . . + 2 2 2 5 x 2 2 5 .
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.
Problem Loading...
Note Loading...
Set Loading...
The first few x n indicate the probable claim that x n = ( − 1 ) n ( n 2 2 5 ) . Let us proof by induction that the claim is true by n ≥ 0 .
Proof:
For n = 0 , x 0 = ( − 1 ) 0 ( 0 2 2 5 ) = 1 , which is as given. Therefore, the claim is true for n = 0 .
Assuming the claim is true for n , then we have:
x n + 1 = − n + 1 2 2 5 k = 0 ∑ n x k = − n + 1 2 2 5 ( k = 0 ∑ n − 1 x k + x n ) = n + 1 n x n − n + 1 2 2 5 x n = n + 1 n − 2 2 5 x n = n + 1 n − 2 2 5 × ( − 1 ) n ( n 2 2 5 ) = ( − 1 ) n + 1 × n + 1 2 2 5 − n × n ! ( 2 2 5 − n ) ! 2 2 5 ! = ( − 1 ) n + 1 ( n + 1 2 2 5 ) Note that x n = ( − 1 ) n ( n 2 2 5 )
Therefore, the claim is also true for n + 1 and it is true for all n ≥ 0 . □
Then, we have:
X = x 0 + 2 x 1 + 2 2 x 2 + ⋯ + 2 2 2 5 x 2 2 5 = k = 0 ∑ 2 2 5 2 k x k = k = 0 ∑ 2 2 5 ( − 1 ) k ( k 2 2 5 ) 2 k = ( 1 − 2 ) 2 2 5 = − 1 Note that ( 1 − u ) n = k = 0 ∑ n ( − 1 ) k ( k n ) u k