Andrew's recursive dream

Probability Level 4

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 a1,a2,a3,an+1a_1,a_2,a_3 \dots ,a_{n+1} which followed the recurrence relation ak+1=2ak1+3aka_{k+1}=2a_{k-1}+3a_k for integer k>1k>1 .

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

2(a1+an)+5a2an+1a3+a4++an1=2(a1+an)+5a2an+1x=3n1ax\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.

×

Problem Loading...

Note Loading...

Set Loading...