Maths Olympiad Prep

Library / IMO Hk TST /6 of 119

IMO Hk TST

Algebra Difficulty 7.1 National Olympiad, round 2 Prove it Hong Kong

Let (an)n≥1(a_n)_{n \ge 1} be a sequence of positive real numbers with the property that
(an+1)2+anan+2≤an+an+2 (a_{n+1})^2 + a_n a_{n+2} \le a_n + a_{n+2}
for all positive integers nn. Show that a2022≤1a_{2022} \le 1.

Solution

Let us denote bn=anb_n = a_n for all nn. The given inequality is:
(an+1)2+anan+2≤an+an+2(a_{n+1})^2 + a_n a_{n+2} \le a_n + a_{n+2}
for all n≥1n \ge 1.

We can rearrange the inequality:
(an+1)2+anan+2−an−an+2≤0(a_{n+1})^2 + a_n a_{n+2} - a_n - a_{n+2} \le 0
(an+1)2−an+anan+2−an+2≤0(a_{n+1})^2 - a_n + a_n a_{n+2} - a_{n+2} \le 0
(an+1)2−an+(an−1)an+2≤0(a_{n+1})^2 - a_n + (a_n - 1)a_{n+2} \le 0

Let us try to bound ana_n from above. Suppose an>1a_n > 1 for some nn. Since all an>0a_n > 0, we can divide both sides by ana_n (if needed), but let's try to use the structure.

Suppose an≤1a_n \le 1 for all nn. Then a2022≤1a_{2022} \le 1 as desired. Suppose not, and let kk be the smallest index such that ak>1a_k > 1.

Since a1>0a_1 > 0, and a1≤1a_1 \le 1 (otherwise k=1k=1), so a1≤1a_1 \le 1, a2≤1a_2 \le 1, ..., ak−1≤1a_{k-1} \le 1, ak>1a_k > 1.

Now, consider the inequality for n=k−1n = k-1:
(ak)2+ak−1ak+1≤ak−1+ak+1(a_k)^2 + a_{k-1} a_{k+1} \le a_{k-1} + a_{k+1}
(ak)2≤ak+1(1−ak−1)+ak−1(a_k)^2 \le a_{k+1} (1 - a_{k-1}) + a_{k-1}
But ak−1≤1a_{k-1} \le 1, so 1−ak−1≥01 - a_{k-1} \ge 0, and ak+1>0a_{k+1} > 0.
So ak+1(1−ak−1)+ak−1≤ak+1+ak−1a_{k+1} (1 - a_{k-1}) + a_{k-1} \le a_{k+1} + a_{k-1}.
But (ak)2≤ak+1(1−ak−1)+ak−1≤ak+1+ak−1(a_k)^2 \le a_{k+1} (1 - a_{k-1}) + a_{k-1} \le a_{k+1} + a_{k-1}.
But ak>1a_k > 1, so (ak)2>1(a_k)^2 > 1.
Therefore, ak+1(1−ak−1)+ak−1>1a_{k+1} (1 - a_{k-1}) + a_{k-1} > 1.

But ak−1≤1a_{k-1} \le 1, so ak+1(1−ak−1)>1−ak−1≥0a_{k+1} (1 - a_{k-1}) > 1 - a_{k-1} \ge 0.
So ak+1>1a_{k+1} > 1 unless ak−1=1a_{k-1} = 1.
If ak−1=1a_{k-1} = 1, then ak+1(1−ak−1)=0a_{k+1} (1 - a_{k-1}) = 0, so (ak)2≤1(a_k)^2 \le 1.
But ak>1a_k > 1, so (ak)2>1(a_k)^2 > 1, contradiction.

Therefore, ak−1<1a_{k-1} < 1, so 1−ak−1>01 - a_{k-1} > 0, and ak+1>1−ak−11−ak−1=1a_{k+1} > \frac{1 - a_{k-1}}{1 - a_{k-1}} = 1.
So ak+1>1a_{k+1} > 1.

Thus, if ak>1a_k > 1 for some kk, then ak+1>1a_{k+1} > 1 as well. But then, by induction, an>1a_n > 1 for all n≥kn \ge k.

Now, consider the original inequality for n≥kn \ge k:
(an+1)2+anan+2≤an+an+2(a_{n+1})^2 + a_n a_{n+2} \le a_n + a_{n+2}
But an>1a_n > 1, an+2>1a_{n+2} > 1, so an+an+2<(an)(an+2)a_n + a_{n+2} < (a_n)(a_{n+2}) (since an,an+2>1a_n, a_{n+2} > 1).
So anan+2>an+an+2a_n a_{n+2} > a_n + a_{n+2}.
Therefore,
(an+1)2+anan+2>(an+1)2+an+an+2(a_{n+1})^2 + a_n a_{n+2} > (a_{n+1})^2 + a_n + a_{n+2}
But the inequality says (an+1)2+anan+2≤an+an+2(a_{n+1})^2 + a_n a_{n+2} \le a_n + a_{n+2}, so (an+1)2≤0(a_{n+1})^2 \le 0, which is impossible since an+1>0a_{n+1} > 0.

Therefore, our assumption that ak>1a_k > 1 for some kk leads to a contradiction. Thus, an≤1a_n \le 1 for all nn, in particular a2022≤1a_{2022} \le 1.

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.