Maths Olympiad Prep

Library / Japanese Mathematical Olympiad /3 of 16

Japanese Mathematical Olympiad

Algebra Difficulty 6.4 National Olympiad Prove it Japan

Let n≥2n \ge 2 be an integer. Suppose that real numbers a1,a2,…,a2na_1, a_2, \dots, a_{2n} satisfy ∣ak−an+k∣≥1|a_k - a_{n+k}| \ge 1 for every integer kk such that 1≤k≤n1 \le k \le n. Find the minimum possible value of
(a1−a2)2+(a2−a3)2+⋯+(a2n−1−a2n)2+(a2n−a1)2. (a_1 - a_2)^2 + (a_2 - a_3)^2 + \dots + (a_{2n-1} - a_{2n})^2 + (a_{2n} - a_1)^2.

Solution

Set a2n+1=a1a_{2n+1} = a_1. Since an+1−a2n+1=−(a1−an+1)a_{n+1} - a_{2n+1} = -(a_1 - a_{n+1}), the values
a1−an+1, a2−an+2, …, an−a2n, an+1−a2n+1 a_1 - a_{n+1}, \ a_2 - a_{n+2}, \ \dots, \ a_n - a_{2n}, \ a_{n+1} - a_{2n+1}
are all nonzero, and a1−an+1a_1 - a_{n+1} and an+1−a2n+1a_{n+1} - a_{2n+1} have opposite signs. Therefore, there exists an integer mm with 1≤m≤n1 \le m \le n such that am−an+ma_m - a_{n+m} and am+1−an+m+1a_{m+1} - a_{n+m+1} have opposite signs. In this case, since both ∣am−an+m∣|a_m - a_{n+m}| and ∣am+1−an+m+1∣|a_{m+1} - a_{n+m+1}| are at least 1, we have
∣(am−am+1)−(an+m−an+m+1)∣=∣(am−an+m)−(am+1−an+m+1)∣≥2. |(a_m - a_{m+1}) - (a_{n+m} - a_{n+m+1})| = |(a_m - a_{n+m}) - (a_{m+1} - a_{n+m+1})| \ge 2.
In general, for real numbers xx and yy, we have
x2+y2−(x−y)22=(x+y)22≥0, x^2 + y^2 - \frac{(x - y)^2}{2} = \frac{(x + y)^2}{2} \geq 0,
so it follows that
(am−am+1)2+(an+m−an+m+1)2≥((am−am+1)−(an+m−an+m+1))22≥2. (a_m - a_{m+1})^2 + (a_{n+m} - a_{n+m+1})^2 \ge \frac{((a_m - a_{m+1}) - (a_{n+m} - a_{n+m+1}))^2}{2} \\ \ge 2.
Therefore, we obtain
(a1−a2)2+(a2−a3)2+⋯+(a2n−1−a2n)2+(a2n−a1)2≥2. (a_1 - a_2)^2 + (a_2 - a_3)^2 + \dots + (a_{2n-1} - a_{2n})^2 + (a_{2n} - a_1)^2 \ge 2.
On the other hand, the values a1=a2=⋯=an=1a_1 = a_2 = \dots = a_n = 1 and an+1=an+2=⋯=a2n=0a_{n+1} = a_{n+2} = \dots = a_{2n} = 0 satisfy the given condition, and the value of the given function is 2 in this case. Hence, the minimum possible value is 2.

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.