Christmas Streak 09/88: Subtract, Subtract, Subtract

Consider a sequence of positive reals

a 1 = 2017 , a 2 , a 3 , a 4 , , a_1 = 2017, a_2, a_3, a_4, \ldots ,

which satisfy a i + 2 = a i a i + 1 a_{i+2} = a_{i} - a_{i+1} for all positive integers i i .

Let k k be the smallest value of a 2 a_2 such that the sequence has the maximal length (or is infinite).

What is the value of 1000 k \lfloor 1000k\rfloor ?


Notation: \lfloor\cdot\rfloor denotes the floor function .

This problem is a part of <Christmas Streak 2017> series .


The answer is 1246574.

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.

2 solutions

Boi (보이)
Oct 6, 2017

Let t 1 = 2017 , t 2 = a . t_1=2017,~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 \begin{aligned} & t_3=t_1-t_2 \\ & t_4=-t_1+2t_2 \\ &t_5=2t_1-3t_2 \\ & t_6=-3t_1+5t_2 \\ & t_7=5t_1-8t_2 \end{aligned}

We deduce that t n = ( 1 ) n + 1 ( t 1 F n 2 t 2 F n 1 ) , t_n=(-1)^{n+1}(t_1F_{n-2}-t_2F_{n-1}), where F n F_n is a Fibonacci sequence .

Then solving this, we get:

{ t 1 t 2 > F n 1 F n 2 ( n is odd. ) t 1 t 2 < F n 1 F n 2 ( n is even. ) \cases{\begin{aligned} &\dfrac{t_1}{t_2}>\dfrac{F_{n-1}}{F_{n-2}} & (n\text{ is odd.}) \\\\ &\dfrac{t_1}{t_2}<\dfrac{F_{n-1}}{F_{n-2}} & (n\text{ is even.})\end{aligned}}

We know that

F 2 F 1 = 1 < F 4 F 3 = 3 2 < F 6 F 4 = 8 5 < < 1 + 5 2 < < F 7 F 6 = 13 8 < F 5 F 4 = 5 3 < F 3 F 2 = 2 1 . \begin{aligned}&\frac{F_{2}}{F_{1}}=1<\frac{F_{4}}{F_{3}}=\frac{3}{2}<\frac{F_6}{F_4}=\frac{8}{5}<~\cdots \\\\ &<\frac{1+\sqrt{5}}{2} \\\\ &<~\cdots~<\frac{F_7}{F_6}=\frac{13}{8}<\frac{F_5}{F_4}=\frac{5}{3}<\frac{F_3}{F_2}=\frac{2}{1}. \end{aligned}

So, if and only if t 1 t 2 = 1 + 5 2 , \dfrac{t_1}{t_2}=\dfrac{1+\sqrt{5}}{2}, the length of the sequence is infinity.

Therefore, 2017 k = 1 + 5 2 . \dfrac{2017}{k}=\dfrac{1+\sqrt{5}}{2}. Solving this yields k = 2017 2 1 + 5 = 1246.57455530 . k=\dfrac{2017\cdot2}{1+\sqrt{5}}=1246.57455530\cdots.

1000 k = 1246574 . \therefore~\lfloor1000k\rfloor=\boxed{1246574}.

Arjen Vreugdenhil
Oct 17, 2017

The recursion a i + 2 = a i a i + 1 a_{i+2} = a_i - a_{i+1} has general solution a i = C 1 p 1 i + C 2 p 2 i a_i = C_1p_1^i + C_2p_2^i where p 1 , 2 p_{1,2} are solutions of p 2 = 1 p p^2 = 1 - p . We find p 1 = 1 2 + 1 2 5 p_1 = -\tfrac12 + \tfrac12\sqrt 5 and p 2 = 1 2 1 2 5 p_2 = -\tfrac12 - \tfrac12\sqrt 5 .

Since 0 < p 1 < 1 0 < p_1 < 1 , the first term remains positive (provided C 1 > 0 C_1 > 0 ) and tends to zero. But p 2 < 1 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 a_1 = C_1p_1^1 + C_2p_2^2 will eventually include negative values, unless we choose C 2 = 0 C_2 = 0 . Therefore the sequence will remain positive indefinitely only if we have a i = 2017 ( 1 2 + 1 2 5 ) i 1 ; a_i = 2017\cdot (-\tfrac12 +\tfrac12\sqrt 5)^{i-1}; in that case a 2 = 2017 ( 1 2 + 1 2 5 ) = 1246.574 a_2 = 2017\cdot (-\tfrac12 + \tfrac12\sqrt 5) = 1246.574\dots

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...