A sequence of numbers is defined using the relation a n = − a n − 1 + 6 a n − 2 , where a 1 = 2 , a 2 = 1 . Find a 1 0 0 + 3 a 9 9 .
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.
Let x n ≡ a n + 3 a n − 1 . We are seeking x 1 0 0 . Note that since a 1 = 2 and a 2 = 1 , then x 2 = a 2 + 3 a 1 = 1 + 3 ( 2 ) = 7 . Using the recursion relation a n = − a n − 1 + 6 a n − 2 , we have:
x n = a n + 3 a n − 1 = ( − a n − 1 + 6 a n − 2 ) + 3 a n − 1 = 2 a n − 1 + 6 a n − 2 = 2 ( a n − 1 + 3 a n − 2 ) = 2 x n − 1 .
Iterative substitution gives: x n = 2 x n − 1 = 2 2 x n − 2 = ⋯ = 2 k x n − k . After k = n − 2 iterations, x n = 2 n − 2 x 2 = 2 n − 2 ⋅ 7 .
Therefore, when n = 1 0 0 , x 1 0 0 = 7 × 2 9 8 .
Problem Loading...
Note Loading...
Set Loading...
The characteristic equation of the linear recurrence relation a n = a n − 1 + 6 a n − 2 is as follows:
r 2 + r − 6 ( r − 2 ) ( r + 3 ) ⟹ r = 0 = 0 = 2 , − 3
Let b n = a n + 1 , ⟹ a 1 = b 0 = 2 and a 2 = b 1 = 1 and:
b n b 0 b 1 ⟹ c 1 ⟹ c 2 ⟹ b n = c 1 ( 2 n ) + c 2 ( − 3 ) n = c 1 + c 2 = 2 = 2 c 1 − 3 c 2 = 1 = 5 7 = 5 3 = 5 7 ( 2 n ) + ( − 1 ) n 3 n + 1
Therefore, we have:
a 1 0 0 + 3 a 9 9 = b 9 9 + 3 b 9 8 = 5 7 ( 2 9 9 ) − 3 1 0 0 + 2 1 ( 2 9 8 ) + 3 1 0 0 = 5 1 4 ( 2 9 8 ) + 2 1 ( 2 9 8 ) = 7 × 2 9 8