Consider the above sequence, with initial conditions and .
Find the last 3 digits of .
Details and Assumptions
If you don't know how to get the solutions for recurrence relations, you may try to learn it here .
This note will prove helpful in the coming problems of this series.
First Problem and Second problem are easier than this one
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.
See, it's not that tough as it looks, very easy !!!
a n = 7 a n − 1 − 1 0 a n − 2 + 3 n . . . . . . . . . . e q ( 1 )
a n − 1 = 7 a n − 2 − 1 0 a n − 3 + 3 n − 1
Hence 3 a n − 1 = 2 1 a n − 2 − 3 0 a n − 3 + 3 n . . . . . . . . . . e q ( 2 )
Subtract the 2 equations to get
a n − 3 a n − 1 = 7 a n − 1 − 3 1 a n − 2 + 3 0 a n − 3
That is a n − 1 0 a n − 1 + 3 1 a n − 2 − 3 0 a n − 3 = 0
Characterstic equation is x 3 − 1 0 x 2 + 3 1 x − 3 0 = 0 That is ( x − 2 ) ( x − 5 ) ( x − 3 ) = 0
And thus each term can be written as a n = x 2 n + y 3 n + z 3 n
We have initial conditions a 0 = 0 , a 1 = 1 and calculating from the recurrence , a 2 = 1 6
Thus you get 3 equations with 3 variables ,
0 = x + y + z 1 = 2 x + 3 y + 5 z 1 6 = 4 x + 9 y + 2 5 z
Solve to get x = 3 8 , y = 2 − 9 , z = 6 1 1
Hence general term is given by a n = 3 8 2 n − 2 9 3 n + 6 1 1 5 n
Thus a 2 0 = 3 8 ⋅ 2 2 0 − 2 9 ⋅ 3 2 0 + 6 1 1 ⋅ 5 2 0 = 1 7 4 8 2 4 6 0 3 6 0 7 5 4 4
Hence the last 3 digits are 5 4 4