Maths Olympiad Prep

Library / /85 of 104

Algebra Difficulty 6.6 National Olympiad Prove it Bulgaria

Problem:
Let a2a \geq 2 be a real number. Denote by x1x_{1} and x2x_{2} the roots of the equation x2ax+1=0x^{2}-a x+1=0 and set Sn=x1n+x2nS_{n}=x_{1}^{n}+x_{2}^{n}, n=1,2,n=1,2, \ldots

a) Prove that the sequence {SnSn+1}n=1\left\{\frac{S_{n}}{S_{n+1}}\right\}_{n=1}^{\infty} is decreasing.

b) Find all aa such that
S1S2+S2S3++SnSn+1>n1 \frac{S_{1}}{S_{2}}+\frac{S_{2}}{S_{3}}+\cdots+\frac{S_{n}}{S_{n+1}}>n-1
for any n=1,2,n=1,2, \ldots.

Solution

Solution:
If a2a \geq 2, then the roots x1x_{1} and x2x_{2} of the equation x2ax+1=0x^{2}-a x+1=0 are positive and x1x2=1x_{1} x_{2}=1. In particular, Sn>0S_{n}>0 for n=1,2,n=1,2, \ldots

a) We have
Sn1SnSnSn+1(x1n1+x2n1)(x1n+1+x2n+1)(x1n+x2n)2x1n1x2n+1+x2n1x1n+12x1nx2n(x1x2)n1(x1x2)20 \begin{aligned} \frac{S_{n-1}}{S_{n}} \geq \frac{S_{n}}{S_{n+1}} &\Longleftrightarrow \left(x_{1}^{n-1}+x_{2}^{n-1}\right)\left(x_{1}^{n+1}+x_{2}^{n+1}\right) \geq \left(x_{1}^{n}+x_{2}^{n}\right)^{2} \\ &\Longleftrightarrow x_{1}^{n-1} x_{2}^{n+1}+x_{2}^{n-1} x_{1}^{n+1} \geq 2 x_{1}^{n} x_{2}^{n} \\ &\Longleftrightarrow \left(x_{1} x_{2}\right)^{n-1}\left(x_{1}-x_{2}\right)^{2} \geq 0 \end{aligned}
which obviously holds.

b) Let a2a \geq 2 have the desired property. Then a) implies that
nS1S2S1S2++SnSn+1>n1 n \frac{S_{1}}{S_{2}} \geq \frac{S_{1}}{S_{2}}+\cdots+\frac{S_{n}}{S_{n+1}}>n-1
i.e., S1S2>11n\frac{S_{1}}{S_{2}}>1-\frac{1}{n}. Since limn1n=0\lim _{n \rightarrow \infty} \frac{1}{n}=0, the last inequality gives S1S21\frac{S_{1}}{S_{2}} \geq 1. Using Vieta's formulas we get S1=aS_{1}=a, S2=a22S_{2}=a^{2}-2 and therefore aa221(a+1)(a2)a220\frac{a}{a^{2}-2} \geq 1 \Longleftrightarrow \frac{(a+1)(a-2)}{a^{2}-2} \leq 0. Since a2a \geq 2 we get a=2a=2.

Conversely, if a=2a=2, then x1=x2=1x_{1}=x_{2}=1 and Sn=2S_{n}=2 for any n=1,2,n=1,2, \ldots Hence
S1S2+S2S3++SnSn+1=n>n1 \frac{S_{1}}{S_{2}}+\frac{S_{2}}{S_{3}}+\cdots+\frac{S_{n}}{S_{n+1}}=n>n-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 reproduced verbatim; metadata (topic, difficulty) added by this project.