A sequence adheres to the recursion relation a n = 3 a n − 1 a n − 2 a n − 3 with initial terms a 0 = 1 , a 1 = 2 , a 2 = 1 .
As n tends to infinity, what is the limit of a n correct to 2 decimal places?
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.
Very well done............I was doing like this and when I landed with the cubic I was stuck, then what I did was another way which was pretty trivial. After checking for the first few terms I saw that each a n = 2 b where b = 3 n − 2 3 n − 3 + t , where t is a real number much less that 3 n − 2 ..............this claim can be proved real easily through induction. Taking the limit, the required answer is found.
Lovely solution! I have never seen recurrence relations of this form before and the problem sufficiently stumped me haha.
Hm, 1.26 would have been a better answer, since 2 3 1 = 1 . 2 5 9 9 … .
I will update this accordingly.
Could u please tell how did u generate polynomial function for series
So, it is basically a small variation on the problem with a 1 , a 2 , a 3 = 1 , 2 , 3 and a n + 3 = ( a n + 2 + a n + 1 + a n ) / 3 . (I could not include a link to that problem; it is in the same quiz.) By taking base-2 logarithms, the initial values become: 0, 1, 0, and it is clear that all values are (real) powers of 2.
This is a nice solution, comprehensible one
I get the answer, but I don't feel right with my method, please point out for me. a n = 3 a n − 1 a n − 2 a n − 3 . . . ( 1 )
a n 3 = a n − 1 a n − 2 a n − 3
( a n 3 ) 3 = a n − 1 3 a n − 2 3 a n − 3 3
= a n − 2 a n − 3 2 a n − 4 3 a n − 5 2 a n − 6
= a n − 2 a n − 3 2 a n − 5 3 a n − 6 2 a n − 7
...
= a n − 2 a n − 3 2 a 2 3 a 1 2 a 0
∴ a n 3 = 3 4 a n − 2 a n − 3 2 . . . ( 2 )
( 1 ) ( 2 )
a n 2 = 3 a n − 1 a n − 2 a n − 3 4 a n − 2 a n − 3 2
a n = 6 a n − 1 4 a n − 3
As tends to infinity and limit a n exists (said in the question and that is what we need to find), therefore a n − 3 = a n − 1
l i m n → ∞ a n = 6 4
It's absolutely right
Nice method!!
Seem to be right
Where can i post my solution 😂
Convergence of this sequence can be obtained this way: Let u n = ln ( a n ) , therefore, u n + 3 = 3 u n + 2 + u n + 1 + u n , and 3 X 3 − X 2 − X − 1 = ( X − 1 ) ( 3 X 2 + 2 X + 1 ) . So, 3 ( u n + 3 − u n + 2 ) + 2 ( u n + 2 − u n + 1 ) + ( u n + 1 − u n ) = 0 . Since the roots of 3 X 2 + 2 X + 1 are all of modulus 3 3 < 1 , u n + 1 − u n decreases exponentially to 0. It is therefore summable, hence u n converging.
Problem Loading...
Note Loading...
Set Loading...
Let b n = lo g a n . Then
b n = 3 1 b n − 1 + 3 1 b n − 2 + 3 1 b n − 3 , b 0 = 0 , b 1 = lo g 2 , b 2 = 0
The characteristic polynomial of the sequence { b n } is
p ( x ) = x 3 − 3 1 x 2 − 3 1 x − 3 1
p ( x ) have three roots; x = 1 , − 3 1 ± 3 2 i , so b n is given as
b n = A + B w 1 n + C w 2 n ( w 1 = − 3 1 + 3 2 i , w 2 = − 3 1 − 3 2 i )
for some constant A , B , C .
As ∣ w 1 ∣ = ∣ w 2 ∣ = 3 1 < 1 , n → ∞ lim w 1 n = n → ∞ lim w 2 n = 0 . So
n → ∞ lim b n = n → ∞ lim ( A + B w 1 n + C w 2 n ) = A
Besides, the initial condition b 0 = 0 , b 1 = lo g 2 , b 2 = 0 gives a system of equations for A , B , C ; solving this gives A = 3 1 lo g 2 .
Therefore
n → ∞ lim b n = 3 1 lo g 2 ∴ n → ∞ lim a n = e 3 1 lo g 2 = 2 3 1