Andrew's recursive dream

Once Andrew was trying hard to sleep (slack people motivated him to) and finally he was asleep. However during his sleep he thought upon the recursive relations which was a topic of the problem writing party. In his dream , he came across a certain sequence a 1 , a 2 , a 3 , a n + 1 a_1,a_2,a_3 \dots ,a_{n+1} which followed the recurrence relation a k + 1 = 2 a k 1 + 3 a k a_{k+1}=2a_{k-1}+3a_k for integer k > 1 k>1 .

A weird blast took place in Andrew's dream and a certain ugly expression appeared spontaneously:

2 ( a 1 + a n ) + 5 a 2 a n + 1 a 3 + a 4 + + a n 1 = 2 ( a 1 + a n ) + 5 a 2 a n + 1 x = 3 n 1 a x \dfrac{2(a_1+a_n)+5a_2-a_{n+1}}{a_3+a_4+\dots+a_{n-1}} = \dfrac{2(a_1+a_n)+5a_2-a_{n+1}}{\displaystyle\sum_{x=3}^{n-1} a_x}

Now your job is to find the value of above expression which randomly appeared in Andrew's sweet recursive mathematical dream.


The answer is -4.0.

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...