Maths Olympiad Prep

Library / Romanian Mathematical Olympiad /223 of 275

Romanian Mathematical Olympiad

Algebra Difficulty 6.5 National Olympiad Prove it Romania

Consider a complex number zz, z≠0z \neq 0 and the real sequence
an=∣zn+1zn∣,n≥1. a_n = \left| z^n + \frac{1}{z^n} \right|, \quad n \ge 1.
a) Show that if a1>2a_1 > 2, then
an+1<an+an+22, for all n∈N∗. a_{n+1} < \frac{a_n + a_{n+2}}{2}, \text{ for all } n \in \mathbb{N}^*.
b) Prove that if there exists k∈N∗k \in \mathbb{N}^* such that ak≤2a_k \le 2, then a1≤2a_1 \le 2.

Solution

a)
We easily notice that
2∣zn+1+1zn+1∣<∣z+1z∣⋅∣zn+1+1zn+1∣=∣zn+1zn+zn+2+1zn+2∣≤∣zn+1zn∣+∣zn+2+1zn+2∣. \begin{aligned} 2|z^{n+1} + \frac{1}{z^{n+1}}| &< |z + \frac{1}{z}| \cdot |z^{n+1} + \frac{1}{z^{n+1}}| \\ & = |z^n + \frac{1}{z^n} + z^{n+2} + \frac{1}{z^{n+2}}| \leq |z^n + \frac{1}{z^n}| + |z^{n+2} + \frac{1}{z^{n+2}}|. \end{aligned}

Alternative Solution. Consider the sequence (αn)n≥1(\alpha_n)_{n \ge 1} given by αn=zn+1zn\alpha_n = z^n + \frac{1}{z^n}. Extend to the left with the term α0=z0+1z0=2\alpha_0 = z^0 + \frac{1}{z^0} = 2, and denote α=α1\alpha = \alpha_1. Clearly an=∣αn∣a_n = |\alpha_n|. We have
ααn=(z+1z)(zn+1zn)=(zn+1+1zn+1)+(zn−1+1zn−1)=αn+1+αn−1 \alpha\alpha_n = \left(z + \frac{1}{z}\right) \left(z^n + \frac{1}{z^n}\right) = \left(z^{n+1} + \frac{1}{z^{n+1}}\right) + \left(z^{n-1} + \frac{1}{z^{n-1}}\right) = \alpha_{n+1} + \alpha_{n-1}
for all n≥1n \ge 1, so the sequence (αn)n≥0(\alpha_n)_{n \ge 0} satisfies the linear recurrence relation αn+1=ααn−αn−1\alpha_{n+1} = \alpha\alpha_n - \alpha_{n-1}. Then for ∣α∣>2|\alpha| > 2 we have
an=∣αn∣=∣αn+1+αn−1α∣≤∣αn+1∣+∣αn−1∣∣α∣<an+1+an−12, a_n = |\alpha_n| = \left| \frac{\alpha_{n+1} + \alpha_{n-1}}{\alpha} \right| \le \frac{|\alpha_{n+1}| + |\alpha_{n-1}|}{|\alpha|} < \frac{a_{n+1} + a_{n-1}}{2},
i.e. the sequence (an)n≥0(a_n)_{n \ge 0} is convex.
But then, if a1=∣α∣>2=a0a_1 = |\alpha| > 2 = a_0, any convex sequence is (strictly) increasing, since from an>an−1a_n > a_{n-1} follows an+1>2an−an−1=an+(an−an−1)>ana_{n+1} > 2a_n - a_{n-1} = a_n + (a_n - a_{n-1}) > a_n, and the thesis is proved by simple induction. Conversely, if there exists k∈N∗k \in \mathbb{N}^* such that ak≤2a_k \le 2, then a1≤2a_1 \le 2. Therefore the proof for b) comes directly from a), and the nature of the sequence is not anymore relevant.

b)
a2=∣z2+1z2∣=∣(z+1z)2−2∣≥(z+1z)2−2=a12−2>a1, a_2 = |z^2 + \frac{1}{z^2}| = \left|\left(z + \frac{1}{z}\right)^2 - 2\right| \ge \left(z + \frac{1}{z}\right)^2 - 2 = a_1^2 - 2 > a_1,
therefore the sequence (an)n(a_n)_n is strictly increasing, hence ak≥a1>2a_k \ge a_1 > 2 for all kk, a contradiction.

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

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.