Maths Olympiad Prep

Library / /233 of 397

Algebra Difficulty 6.1 National Olympiad Prove it Taiwan

Let the sequence {an}\{a_n\} satisfy:
a1=a2=1, an+2=an+1+an (nN). a_1 = a_2 = 1,\ a_{n+2} = a_{n+1} + a_n\ (n \in \mathbb{N}).
When nn is odd, find all real solutions (x,y)(x, y) satisfying the following system of equations.
{x+2xan+2yan+1=1+2an+2,y+2xan+1+2yan+2=1+2an+3. \begin{cases} x + 2^x a_n + 2^y a_{n+1} = 1 + 2a_{n+2}, \\ y + 2^x a_{n+1} + 2^y a_{n+2} = 1 + 2a_{n+3}. \end{cases}

Solution

(x,y)=(1,1)(x, y) = (1,1) is the unique real solution of this system of equations.
Clearly, (x,y)=(1,1)(x, y) = (1,1) is a real solution of this system of equations. We now prove that there is no other real solution.
Suppose otherwise, that (x,y)=(x1,y1)(1,1)(x, y) = (x_1, y_1) \neq (1,1) is another real solution of the system of equations
{x+2xan+2yan+1=1+2an+2,y+2xan+1+2yan+2=1+2an+3, \begin{cases} x + 2^x a_n + 2^y a_{n+1} = 1 + 2a_{n+2}, \\ y + 2^x a_{n+1} + 2^y a_{n+2} = 1 + 2a_{n+3}, \end{cases}
For convenience, let (x2,y2)=(1,1)(x_2, y_2) = (1,1). Substituting these two solutions into the system of equations and subtracting, we obtain respectively
(x1x2)+(2x12x2)an+(2y12y2)an+1=0,(1) (x_1 - x_2) + (2^{x_1} - 2^{x_2})a_n + (2^{y_1} - 2^{y_2})a_{n+1} = 0, \quad (1)
(y1y2)+(2x12x2)an+1+(2y12y2)an+2=0,(2) (y_1 - y_2) + (2^{x_1} - 2^{x_2})a_{n+1} + (2^{y_1} - 2^{y_2})a_{n+2} = 0, \quad (2)
Multiplying (1) by (2x12x2)(2^{x_1} - 2^{x_2}) and (2) by (2y12y2)(2^{y_1} - 2^{y_2}), then adding the two together and simplifying, we obtain
(x1x2)(2x12x2)+(y1y2)(2y12y2)+(2x12x2)2an+2(2x12x2)(2y12y2)an+1+(2y12y2)2an+2=0.(3) (x_1 - x_2)(2^{x_1} - 2^{x_2}) + (y_1 - y_2)(2^{y_1} - 2^{y_2}) \\ + (2^{x_1} - 2^{x_2})^2 a_n + 2(2^{x_1} - 2^{x_2})(2^{y_1} - 2^{y_2})a_{n+1} + (2^{y_1} - 2^{y_2})^2 a_{n+2} = 0. \quad (3)
We now prove that when (x1,y1)(x2,y2)(x_1, y_1) \neq (x_2, y_2), (3) does not hold, thereby leading to a contradiction.
Note that f(x)=2xf(x) = 2^x is an increasing function, hence we obtain
(x1x2)(2x12x2)0and(y1y2)(2y12y2)0. (x_1 - x_2)(2^{x_1} - 2^{x_2}) \geq 0 \quad \text{and} \quad (y_1 - y_2)(2^{y_1} - 2^{y_2}) \geq 0.
Equality holds in both of the above inequalities simultaneously if and only if (x1,y1)=(x2,y2)(x_1, y_1) = (x_2, y_2).
Therefore, when (x1,y1)(x2,y2)(x_1, y_1) \neq (x_2, y_2), we obtain the following strict inequality:
(x1x2)(2x12x2)+(y1y2)(2y12y2)>0.(4) (x_1 - x_2)(2^{x_1} - 2^{x_2}) + (y_1 - y_2)(2^{y_1} - 2^{y_2}) > 0. \quad (4)
On the other hand, using mathematical induction it is easy to prove that when nn is odd, the following identity holds:
an+12anan+2=1. a_{n+1}^2 - a_n a_{n+2} = -1.
(This is a basic property of the Fibonacci sequence, and the proof is omitted here.)
And noting that an>0,(x1,y1)(x2,y2)a_n > 0, (x_1, y_1) \neq (x_2, y_2), we thus obtain
(2x12x2)2an+2(2x12x2)(2y12y2)an+1+(2y12y2)2an+2(5)=1an[(2x12x2)an+(2y12y2)an+1]2+1an(2y12y2)2>0. (2^{x_1} - 2^{x_2})^2 a_n + 2(2^{x_1} - 2^{x_2})(2^{y_1} - 2^{y_2})a_{n+1} + (2^{y_1} - 2^{y_2})^2 a_{n+2} \quad (5) \\ = \frac{1}{a_n} \left[ (2^{x_1} - 2^{x_2})a_n + (2^{y_1} - 2^{y_2})a_{n+1} \right]^2 + \frac{1}{a_n} (2^{y_1} - 2^{y_2})^2 > 0.

(4) & (5) give
(x1x2)(2x12x2)+(y1y2)(2y12y2)+(2x12x2)2an+2(2x12x2)(2y12y2)an+1+(2y12y2)2an+2>0, (x_1 - x_2)(2^{x_1} - 2^{x_2}) + (y_1 - y_2)(2^{y_1} - 2^{y_2}) \\ + (2^{x_1} - 2^{x_2})^2 a_n + 2(2^{x_1} - 2^{x_2})(2^{y_1} - 2^{y_2})a_{n+1} + (2^{y_1} - 2^{y_2})^2 a_{n+2} > 0,
which contradicts (3). In conclusion, this system of equations has exactly one real solution (x,y)=(1,1)(x,y) = (1,1).

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 translated into English from zh; metadata (topic, difficulty) added by this project.