Maths Olympiad Prep

Track / Stage 9 / 3 of 52 #1883 of 1964

Problem 1883

IMO P2/P5; hard shortlist
Algebra Difficulty 9.1 Prove it VN IMO Booklet · Vietnam

Assume aa is a real number in [12,23][\frac{1}{2}, \frac{2}{3}]. Consider two sequences (un),(vn),(n=0,1,)(u_n), (v_n), (n = 0, 1, \dots), defined by:
un=32n+1(1)2n+1a,vn=32n+1(1)n+2n+1a. u_n = \frac{3}{2^{n+1}} \cdot (-1)^{\lfloor 2^{n+1}a \rfloor}, \quad v_n = \frac{3}{2^{n+1}} \cdot (-1)^{n+\lfloor 2^{n+1}a \rfloor}.

a. Prove that
(i=02018ui)2+(i=02018vi)272a248a+10+242019. \left(\sum_{i=0}^{2018} u_i\right)^2 + \left(\sum_{i=0}^{2018} v_i\right)^2 \le 72a^2 - 48a + 10 + \frac{2}{4^{2019}}.

b. Find all value of aa for which equality occurs.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

(a) By assumption, we have vi=uiv_i = u_i for even ii and vi=uiv_i = -u_i for odd ii. Thus, the inequality can be rewritten as
(i=01009u2i+i=01008u2i+1)2+(i=01009u2ii=01008u2i+1)272a248a+10+242019, \left(\sum_{i=0}^{1009} u_{2i} + \sum_{i=0}^{1008} u_{2i+1}\right)^2 + \left(\sum_{i=0}^{1009} u_{2i} - \sum_{i=0}^{1008} u_{2i+1}\right)^2 \le 72a^2 - 48a + 10 + \frac{2}{4^{2019}},
which is equivalent to
(i=01009u2i)2+(i=01008u2i+1)236a224a+5+142019. \left(\sum_{i=0}^{1009} u_{2i}\right)^2 + \left(\sum_{i=0}^{1008} u_{2i+1}\right)^2 \le 36a^2 - 24a + 5 + \frac{1}{4^{2019}}.
Let the binary representation of aa be a=i=1+xi2ia = \sum_{i=1}^{+\infty} \frac{x_i}{2^i} where xi{0,1}x_i \in \{0, 1\}. Since 12a23\frac{1}{2} \le a \le \frac{2}{3}, we have x1=1x_1 = 1.
For each natural number ii, the parity of 2i+1a\lfloor 2^{i+1}a \rfloor depends on xi+1x_{i+1}. In particular, if xi+1=0x_{i+1} = 0, then 2i+1a\lfloor 2^{i+1}a \rfloor is even, and if xi+1=1x_{i+1} = 1, then 2i+1a\lfloor 2^{i+1}a \rfloor is odd. Therefore, (1)2i+1a=1(-1)^{\lfloor 2^{i+1}a \rfloor} = 1 if xi+1=0x_{i+1} = 0, and (1)2i+1a=1(-1)^{\lfloor 2^{i+1}a \rfloor} = -1 if xi+1=1x_{i+1} = 1. In all cases, we have
(1)2i+1a=12xi+1. (-1)^{\lfloor 2^{i+1}a \rfloor} = 1 - 2x_{i+1}.
---
Denote A=i=01009x2i+122i+1A = \sum_{i=0}^{1009} \frac{x_{2i+1}}{2^{2i+1}} and B=i=01008x2i+222i+2B = \sum_{i=0}^{1008} \frac{x_{2i+2}}{2^{2i+2}}, we have
i=01009u2i=i=010093(12x2i+1)22i+1=212410096A, \sum_{i=0}^{1009} u_{2i} = \sum_{i=0}^{1009} \frac{3(1 - 2x_{2i+1})}{2^{2i+1}} = 2 - \frac{1}{2 \cdot 4^{1009}} - 6A,
i=01008u2i+1=i=010083(12x2i+2)22i+2=11410096B. \sum_{i=0}^{1008} u_{2i+1} = \sum_{i=0}^{1008} \frac{3(1 - 2x_{2i+2})}{2^{2i+2}} = 1 - \frac{1}{4^{1009}} - 6B.
On the other hand, aA+B12a \ge A + B \ge \frac{1}{2}, thus
36a224a+5+142019=4(3a1)2+1+1420194(3A+3B1)2+1+142019. \begin{aligned} 36a^2 - 24a + 5 + \frac{1}{4^{2019}} &= 4(3a - 1)^2 + 1 + \frac{1}{4^{2019}} \\ &\ge 4(3A + 3B - 1)^2 + 1 + \frac{1}{4^{2019}}. \end{aligned}
We prove that
(212410096A)2+(11410096B)24(3A+3B1)2+1+142019. \begin{aligned} & \left(2 - \frac{1}{2 \cdot 4^{1009}} - 6A\right)^2 + \left(1 - \frac{1}{4^{1009}} - 6B\right)^2 \\ & \le 4(3A + 3B - 1)^2 + 1 + \frac{1}{4^{2019}}. \end{aligned}
By some calculations, we can rewrite the above inequality as
641009A+12B(1+1410096A)141008142018. \frac{6}{4^{1009}}A + 12B \left(1 + \frac{1}{4^{1009}} - 6A\right) \le \frac{1}{4^{1008}} - \frac{1}{4^{2018}}.
Since A12A \ge \frac{1}{2}, we have 6A>1+1410096A > 1 + \frac{1}{4^{1009}}. Thus,
641009A+12B(1+1410096A)641009A641009i=01009122i+1=141008142018. \begin{aligned} & \frac{6}{4^{1009}}A + 12B \left(1 + \frac{1}{4^{1009}} - 6A\right) \\ & \le \frac{6}{4^{1009}}A \le \frac{6}{4^{1009}} \sum_{i=0}^{1009} \frac{1}{2^{2i+1}} = \frac{1}{4^{1008}} - \frac{1}{4^{2018}}. \end{aligned}
Using these inequalities, the desired result will follow.

(b) By the arguments in part (a), the equality holds if and only if a=A+B,B=0a = A + B, B = 0 and A=23(1141010)A = \frac{2}{3}\left(1 - \frac{1}{4^{1010}}\right), which implies that
a=23(1141010). a = \frac{2}{3} \left( 1 - \frac{1}{4^{1010}} \right).

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.