Let be a recurrence relation such that, and . Find the sum of the first 50 terms of the linear recurrence relation above.
For more problems like this, try this set .
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.
It is difficult of course to list all 50 terms and add them one by one. So, first, find the characteristic polynomial of the recurrence equation. We have:
3 r 2 = 2 r + 1 ⟹ r ∈ { 1 , − 3 1 }
Hence, x k = ( α 1 ) ( 1 k ) + ( α 2 ) ( − 3 1 ) k .
To solve for the constants α 1 and α 2 , we need to substitute the given.
For k = 1 ⟹ x 1 = 1 = α 1 − 3 α 2 .
For k = 2 ⟹ x 2 = 6 = α 1 + 9 α 2 .
subtracting the 2 equations yields: 5 = ( α 2 ) ( 9 1 + 3 1 ) ⟹ α 2 = 5 ( 4 9 ) = 4 4 5 .
Then, the value of α 1 = 1 + 3 ( 4 4 5 ) = 1 + 4 1 5 = 4 1 9 .
Therefore, x k = ( 4 1 9 ) ( 1 k ) + ( 4 4 5 ) ( − 3 1 ) k .
We found already the general term for x k . hence,
k = 1 ∑ 5 0 x k = k = 1 ∑ 5 0 ( ( 4 1 9 ) ( 1 k ) + ( 4 4 5 ) ( − 3 1 ) k ) = k = 1 ∑ 5 0 ( ( 4 1 9 ) ( 1 k ) ) + k = 1 ∑ 5 0 ( ( 4 4 5 ) ( − 3 1 ) k ) = ( 4 1 9 ) ( 5 0 ) + ( 4 4 5 ) k = 1 ∑ 5 0 ( ( − 3 1 ) k ) = 2 4 7 5 + ( 4 4 5 ) ⎝ ⎜ ⎜ ⎜ ⎜ ⎛ 1 − ( − 3 1 ) ( − 3 1 ) ( 1 − ( − 3 1 ) 5 0 ) ⎠ ⎟ ⎟ ⎟ ⎟ ⎞ = 2 4 7 5 − ( 4 4 5 ) ⎝ ⎜ ⎜ ⎛ 4 ( 1 − 3 5 0 1 ) ⎠ ⎟ ⎟ ⎞ = 2 4 7 5 − ( 4 4 5 ) ( ( 3 5 0 ) ( 4 ) 3 5 0 − 1 ) ≈ 2 4 7 5 − ( 4 4 5 ) ( ( 3 5 0 ) ( 4 ) 3 5 0 ) ≈ 2 4 7 5 − ( 4 4 5 ) ( 4 1 ) ≈ 2 4 7 5 − 1 6 4 5 ≈ 2 3 4 . 6 8 7 5 .