Consider the recursive sequence defined by
a 1 = 1 ; a 2 = 2 ; a n = a n − 1 3 − a n − 2 for n ≥ 3 .
Then a 2 0 1 4 can be expressed as m + n p , where m , n , and p are integers, and p is positive and square-free. Find m + n + p .
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.
i tried to make a closed form of this recurrence relation but it really became so complicated so i couldn't solve it any way nice thinking !!!!!!
Log in to reply
Look at the sequence that uses the same recurrence relation, but with initial terms a 1 = 0 and a 2 = 2 1 . That might look a little more familiar...
The closed form is a n = x e n α i + y e − n α i , where α = 6 π . Without solving for the values of x , y , we can see that a 2 0 1 4 = − a 4 since 2 0 1 4 = 6 ⋅ 3 3 5 + 4 .
How I do it is pretty simple:
Problem Loading...
Note Loading...
Set Loading...
If you list up the first few terms of the sequence you find that a 3 = 2 3 − 1 , a 4 = − 3 + 4 , a 5 = 2 3 − 2 , a 6 = − 3 + 2 , a 7 = − 1 , a 8 = − 2 and so on... we find that a 7 = − a 1 and therefore a 1 3 = − a 7 = a 1 So to find a i we can take i m o d 1 2 (the difference between the two equal terms) a 2 0 1 4 = a 2 0 1 4 m o d 1 2 = a 1 0 and a 1 0 = − a 4 = − ( − 3 + 4 ) = − 4 + 3 .
− 4 + 1 + 3 = 0 so the answer is 0