A recurrence relation is given by b 0 = 2 7 and b n = 8 − b n − 1 7 .
If b n = A + B ⋅ C n − 1 A + B ⋅ C n and n → ∞ lim b n = F , where A , B and C are positive integers and g cd ( A , B ) = 1 then find A + B + C + F .
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.
The value of B/A is 5, and B and A can be of any real value unless specified that A is 1.
Problem Loading...
Note Loading...
Set Loading...
Let , b n = a n − 1 a n
Then the given recurrence relation becomes, a n − 8 a n − 1 − 7 a n − 2 = 0 .
The characteristic equation for this linear second order recurrence relation is,
x 2 − 8 x − 7 = 0
⇒ x = 1 , 7 .
so ,
a n = A + B . 7 n
putting n=0 and n=1 and then solving for A and B we get,
A = 6 7 a 0 − a 1
B = 6 a 1 − a 0
Therefore,
a n = 6 7 a 0 − a 1 + 6 a 1 − a 0 . 7 n ------ ( i )
Now,
b 1 = a 0 a 1 ⇒ a 1 = b 1 . a 0
so equation (i) becomes,
a n = 6 a 0 { 7 − b 1 + ( b 1 − 1 ) . 7 n } ------ (ii)
replace n by n − 1 ,
a n − 1 = 6 a 0 { 7 − b 1 + ( b 1 − 1 ) . 7 n − 1 } ------- (iii)
calculating b 1 = 6
and ,
( i i i ) ( i i ) ⇒ a n − 1 a n = b n = 1 + 5 ⋅ 7 n − 1 1 + 5 ⋅ 7 n
as question format A+B+C= 1 + 5 + 7 = 13
and , lim n → ∞ b n = 7 = F
finally A + B + C + F = 1 3 + 7 = 2 0