Consider a sequence of positive reals
a 1 = 2 0 1 7 , a 2 , a 3 , a 4 , … ,
which satisfy a i + 2 = a i − a i + 1 for all positive integers i .
Let k be the smallest value of a 2 such that the sequence has the maximal length (or is infinite).
What is the value of ⌊ 1 0 0 0 k ⌋ ?
Notation: ⌊ ⋅ ⌋ denotes the floor function .
This problem is a part of <Christmas Streak 2017> series .
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.
The recursion a i + 2 = a i − a i + 1 has general solution a i = C 1 p 1 i + C 2 p 2 i where p 1 , 2 are solutions of p 2 = 1 − p . We find p 1 = − 2 1 + 2 1 5 and p 2 = − 2 1 − 2 1 5 .
Since 0 < p 1 < 1 , the first term remains positive (provided C 1 > 0 ) and tends to zero. But p 2 < 1 , so that the second term alternates between positive and negative and diverges; it will dominate the sequence. Thus the sum a 1 = C 1 p 1 1 + C 2 p 2 2 will eventually include negative values, unless we choose C 2 = 0 . Therefore the sequence will remain positive indefinitely only if we have a i = 2 0 1 7 ⋅ ( − 2 1 + 2 1 5 ) i − 1 ; in that case a 2 = 2 0 1 7 ⋅ ( − 2 1 + 2 1 5 ) = 1 2 4 6 . 5 7 4 …
Problem Loading...
Note Loading...
Set Loading...
Let t 1 = 2 0 1 7 , t 2 = a .
Then we see that
t 3 = t 1 − t 2 t 4 = − t 1 + 2 t 2 t 5 = 2 t 1 − 3 t 2 t 6 = − 3 t 1 + 5 t 2 t 7 = 5 t 1 − 8 t 2
We deduce that t n = ( − 1 ) n + 1 ( t 1 F n − 2 − t 2 F n − 1 ) , where F n is a Fibonacci sequence .
Then solving this, we get:
⎩ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎧ t 2 t 1 > F n − 2 F n − 1 t 2 t 1 < F n − 2 F n − 1 ( n is odd. ) ( n is even. )
We know that
F 1 F 2 = 1 < F 3 F 4 = 2 3 < F 4 F 6 = 5 8 < ⋯ < 2 1 + 5 < ⋯ < F 6 F 7 = 8 1 3 < F 4 F 5 = 3 5 < F 2 F 3 = 1 2 .
So, if and only if t 2 t 1 = 2 1 + 5 , the length of the sequence is infinity.
Therefore, k 2 0 1 7 = 2 1 + 5 . Solving this yields k = 1 + 5 2 0 1 7 ⋅ 2 = 1 2 4 6 . 5 7 4 5 5 5 3 0 ⋯ .
∴ ⌊ 1 0 0 0 k ⌋ = 1 2 4 6 5 7 4 .