Maths Olympiad Prep

Library / /11 of 13

Algebra Difficulty 7.0 National olympiad Prove it China

Suppose an infinite sequence {an}\{a_n\} satisfies a0=xa_0 = x, a1=ya_1 = y, an+1=anan1+1an+an1a_{n+1} = \frac{a_n a_{n-1} + 1}{a_n + a_{n-1}}, n=1,2,n = 1, 2, \dots.

(1) Find all real numbers xx and yy that satisfy the statement: there exists a positive integer n0n_0, such that, for nn0n \ge n_0, ana_n is a constant.

(2) Find an explicit expression for ana_n.

Solution

(1) We have
anan+1=ananan1+1an+an1=an21an+an1,n=1,2,1 a_n - a_{n+1} = a_n - \frac{a_n a_{n-1} + 1}{a_n + a_{n-1}} = \frac{a_n^2 - 1}{a_n + a_{n-1}}, \quad n = 1, 2, \dots \quad \textcircled{1}
If there exists a positive integer nn such that an+1=ana_{n+1} = a_n, we get
an2=1andan+an10. a_n^2 = 1 \quad \text{and} \quad a_n + a_{n-1} \neq 0.
If n=1n=1, we have
y=1 and xy.2 |y|=1 \text{ and } x \neq -y. \qquad \textcircled{2}
If n>1n > 1, then
an1=an1an2+1an1+an21=(an11)(an21)an1+an2,n2,3 a_n - 1 = \frac{a_{n-1}a_{n-2} + 1}{a_{n-1} + a_{n-2}} - 1 = \frac{(a_{n-1}-1)(a_{n-2}-1)}{a_{n-1} + a_{n-2}}, \quad n \ge 2, \qquad \textcircled{3}
and
an+1=an1an2+1an1+an2+1=(an1+1)(an2+1)an1+an2,n2.4 a_n + 1 = \frac{a_{n-1}a_{n-2} + 1}{a_{n-1} + a_{n-2}} + 1 = \frac{(a_{n-1}+1)(a_{n-2}+1)}{a_{n-1} + a_{n-2}}, \quad n \ge 2. \qquad \textcircled{4}
Multiplying equations (3) and (4), we get
an21=an121an1+an2an221an1+an2,n2.5 a_n^2 - 1 = \frac{a_{n-1}^2 - 1}{a_{n-1} + a_{n-2}} \cdot \frac{a_{n-2}^2 - 1}{a_{n-1} + a_{n-2}}, \quad n \ge 2. \qquad \textcircled{5}
From (5) we infer that xx and yy satisfy either (2) or
x=1 and yx.6 |x|=1 \text{ and } y \neq -x. \qquad \textcircled{6}
Conversely, if xx and yy satisfy either (2) or (6), then an=a_n = constant when n2n \ge 2 and the constant can only be either 11 or 1-1.

(2) From (3) and (4), we get
an1an+1=an11an1+1an21an2+1,n2.7 \frac{a_n - 1}{a_n + 1} = \frac{a_{n-1} - 1}{a_{n-1} + 1} \cdot \frac{a_{n-2} - 1}{a_{n-2} + 1}, \quad n \ge 2. \qquad \textcircled{7}
Let bn=an1an+1b_n = \frac{a_n - 1}{a_n + 1}. Then, for n2n \ge 2, equation (7) becomes
bn=bn1bn2=(bn2bn3)bn2=bn22bn3=(bn3bn4)2bn3=bn33bn42= \begin{aligned} b_n &= b_{n-1}b_{n-2} = (b_{n-2}b_{n-3})b_{n-2} = b_{n-2}^2 b_{n-3} \\ &= (b_{n-3}b_{n-4})^2 b_{n-3} = b_{n-3}^3 b_{n-4}^2 = \dots \end{aligned}
Then we get
an1an+1=(y1y+1)Fn1(x1x+1)Fn2,n2,8 \frac{a_n - 1}{a_n + 1} = \left(\frac{y-1}{y+1}\right)^{F_{n-1}} \cdot \left(\frac{x-1}{x+1}\right)^{F_{n-2}}, \quad n \ge 2, \qquad \textcircled{8}
here,
Fn=Fn1+Fn2,n2,F0=F1=1.9 F_n = F_{n-1} + F_{n-2}, \quad n \ge 2, \quad F_0 = F_1 = 1. \qquad \textcircled{9}
From (9) we get
Fn=15((1+52)n+1(152)n+1).10 F_n = \frac{1}{\sqrt{5}} \left( \left( \frac{1+\sqrt{5}}{2} \right)^{n+1} - \left( \frac{1-\sqrt{5}}{2} \right)^{n+1} \right). \qquad \textcircled{10}
The range of nn in (10) can be extended to negative integers. For example, F1=0,F2=1F_{-1} = 0, F_{-2} = 1. Since (8) holds for any n0n \ge 0, we get
an=(x+1)Fn2(y+1)Fn1+(x1)Fn2(y1)Fn1(x+1)Fn2(y+1)Fn1(x1)Fn2(y1)Fn1,n0,11 a_n = \frac{(x+1)^{F_{n-2}} (y+1)^{F_{n-1}} + (x-1)^{F_{n-2}} (y-1)^{F_{n-1}}}{(x+1)^{F_{n-2}} (y+1)^{F_{n-1}} - (x-1)^{F_{n-2}} (y-1)^{F_{n-1}}}, \quad n \ge 0, \qquad \textcircled{11}
here Fn1,Fn2F_{n-1}, F_{n-2} are determined by (10).

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.