Maths Olympiad Prep

Library / /88 of 133

, 2015

Algebra Difficulty 5.8 AIME, harder Prove it Saudi Arabia

Let be given the sequence (xn)\left(x_{n}\right) defined by x1=1x_{1}=1 and xn+1=3xn+xn5x_{n+1}=3 x_{n}+\left\lfloor x_{n} \sqrt{5}\right\rfloor for all n=1,2,3,n=1,2,3, \ldots, where x\lfloor x\rfloor denotes the greatest integer that does not exceed xx. Prove that for any positive integer nn we have
xnxn+2xn+12=4n1 x_{n} x_{n+2}-x_{n+1}^{2}=4^{n-1}

Solution

It is easy to prove by induction that xnx_{n} is an integer for all n1n \geq 1. Therefore, we have xn+1=(3+5)xnx_{n+1}=\left\lfloor(3+\sqrt{5}) x_{n}\right\rfloor for all n1n \geq 1, and we deduce that
xn+2=(3+5)xn+1=6xn+1+(35)(3+5)xn=6xn+1+4(3+5)xn(3+5)=6xn+14xn \begin{aligned} x_{n+2} & =\left\lfloor(3+\sqrt{5}) x_{n+1}\right\rfloor=6 x_{n+1}+\left\lfloor-(3-\sqrt{5})\left\lfloor(3+\sqrt{5}) x_{n}\right\rfloor\right\rfloor \\ & =6 x_{n+1}+\left\lfloor-4 \frac{\left\lfloor(3+\sqrt{5}) x_{n}\right\rfloor}{(3+\sqrt{5})}\right\rfloor=6 x_{n+1}-4 x_{n} \end{aligned}
Indeed, for the last equality we have
(3+5)xn1<(3+5)xn(3+5)xn, (3+\sqrt{5}) x_{n}-1<\left\lfloor(3+\sqrt{5}) x_{n}\right\rfloor \leq(3+\sqrt{5}) x_{n},
from which we deduce
4xn4(3+5)xn(3+5)<4xn+43+5<4xn+1. -4 x_{n} \leq-4 \frac{\left\lfloor(3+\sqrt{5}) x_{n}\right\rfloor}{(3+\sqrt{5})}<-4 x_{n}+\frac{4}{3+\sqrt{5}}<-4 x_{n}+1 .
Let yn=xnxn+2xn+12y_{n}=x_{n} x_{n+2}-x_{n+1}^{2}, for all n1n \geq 1. We will prove by induction that yn=4n1y_{n}=4^{n-1}, for all n1n \geq 1.
For n=1n=1, we have x1=1,x2=(3+5)=5x_{1}=1, x_{2}=\lfloor(3+\sqrt{5})\rfloor=5 and x3=5(3+5)=26x_{3}=\lfloor 5(3+\sqrt{5})\rfloor=26, and therefore y1=40y_{1}=4^{0}. Assume yn=4n1y_{n}=4^{n-1} for some positive integer nn. We have
yn+1=xn+1xn+3xn+22=xn+1(6xn+24xn+1)xn+2(6xn+14xn)=4yn=4n \begin{aligned} y_{n+1} & =x_{n+1} x_{n+3}-x_{n+2}^{2}=x_{n+1}\left(6 x_{n+2}-4 x_{n+1}\right)-x_{n+2}\left(6 x_{n+1}-4 x_{n}\right) \\ & =4 y_{n}=4^{n} \end{aligned}
This ends the induction and solves the problem.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.