Olympiad Maths Prep

Library / /3 of 29

Geometry Difficulty 5.5 AIME, harder Prove it Iran

Let A1,A2,,AkA_1, A_2, \dots, A_k be points on the unit circle. Prove that
1i<jkd(Ai,Aj)2k2, \sum_{1 \le i < j \le k} d(A_i, A_j)^2 \le k^2,
where d(Ai,Aj)d(A_i, A_j) denotes the distance between Ai,AjA_i, A_j.

Solution

Assume that the circle mentioned in the problem is the unit circle on the complex plane. Then we can say every vertex AiA_i is equivalent to a complex number ziz_i such that zi=1|z_i| = 1. On the other hand we have d(Ai,Aj)=zizjd(A_i, A_j) = |z_i - z_j|. So we should prove that
1i<jkzizj2k2. \sum_{1 \le i < j \le k} |z_i - z_j|^2 \le k^2.
We know that
zizj2=(zizj)(zˉizˉj)=zi2+zj2(zˉizj+zˉjzi)=2zˉizjzˉjzi. |z_i - z_j|^2 = (z_i - z_j)(\bar{z}_i - \bar{z}_j) = |z_i|^2 + |z_j|^2 - (\bar{z}_i z_j + \bar{z}_j z_i) = 2 - \bar{z}_i z_j - \bar{z}_j z_i.
So we have
1i<jkzizj2=2(k2)1i<jk(zˉizj+zˉjzi). \sum_{1 \le i < j \le k} |z_i - z_j|^2 = 2 \binom{k}{2} - \sum_{1 \le i < j \le k} (\bar{z}_i z_j + \bar{z}_j z_i).
and
1i<jk(zˉizj+zˉjzi)=1ijkzˉizj=1ikzˉi(z1++zkzi)=(1ikzˉi)(1ikzi)k=1ikzi2k. \begin{align*} \sum_{1 \le i < j \le k} (\bar{z}_i z_j + \bar{z}_j z_i) &= \sum_{1 \le i \ne j \le k} \bar{z}_i z_j = \sum_{1 \le i \le k} \bar{z}_i (z_1 + \dots + z_k - z_i) \\ &= \left( \sum_{1 \le i \le k} \bar{z}_i \right) \left( \sum_{1 \le i \le k} z_i \right) - k = \left| \sum_{1 \le i \le k} z_i \right|^2 - k. \end{align*}
Therefore,
1i<jkzizj2=k2k(1ikzi2k)=k21ikzi2. \sum_{1 \le i < j \le k} |z_i - z_j|^2 = k^2 - k - \left( \left| \sum_{1 \le i \le k} z_i \right|^2 - k \right) = k^2 - \left| \sum_{1 \le i \le k} z_i \right|^2.
Since 1ikzi20\left| \sum_{1 \le i \le k} z_i \right|^2 \ge 0, we have
1i<jkzizj2k2. \sum_{1 \le i < j \le k} |z_i - z_j|^2 \le k^2.
Equality holds whenever 1ikzi=0\sum_{1 \le i \le k} z_i = 0, in other words, when the circumcenter and the centroid of A1A2AkA_1A_2\dots A_k coincide.

Looking for a route rather than 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 and solution reproduced as published; topic and difficulty added by this site.