Given the sequence a n recursively defined by a n + 1 = 2 cos 2 π − a n 1 , a 1 = 1 . Find the value ⌊ a 2 0 1 9 ⌋ .
Note. The symbol ⌊ a ⌋ represents the floor of a , that is, the greatest integer that is less than or equal to a .
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.
That's a very clever substitution! It also (incidentally) shows that the sequence a n is unbounded, which is perhaps surprising.
Thank you, Chris, for you comment!
So the main key is that substitution, right?
Yes, Maalav!
By direct evaluation ≈ 2 . 2 0 1 0 6 1 2 2 8 3 9 5 4 6 .
By direct evaluation, do you mean using a computer program?
Wolfram Mathematica 11.3.
Problem Loading...
Note Loading...
Set Loading...
Let us assume that there is a sequence b n , such that b n = 0 and a n = b n − 1 b n for all n . By substituting a n by b n − 1 b n into the given recursive relation, we obtain that b n must satisfy b n + 1 = 2 cos 2 π b n − b n − 1 . Let us also assume that b 0 = b 1 = 1 , such that a 1 = b 0 b 1 = 1 . Then the sequence b n is a sequence defined by the given linear recursion. The characteristic polynomial of the linear recurrence is r 2 − 2 cos 2 π + 1 , with complex zeros cos 2 π ± i sin 2 π . Therefore, b n = c 1 cos ( n 2 π ) + c 2 sin ( n 2 π ) . Using the given values of b 0 and b 1 , to find the values of c 1 and c 2 , and transforming the expression a bit, we obtain that b n = sec 2 2 π cos ( 2 2 π ( 1 − 2 n ) ) . Now it is not difficult to see that b n = 0 for any value of n , because the argument of the cosine function wont be an integer multiple of π ever. So, a n = b n − 1 b n = cos ( 2 2 π ( 3 − 2 n ) ) cos ( 2 2 π ( 1 − 2 n ) ) . Using this formula, we obtain that a 2 0 1 9 = 2 . 2 0 1 0 6 , and, therefore, ⌊ a 2 0 1 9 ⌋ = 2 .