Sum of squared distances between points on a unit circle

circlescomplex numbersgeometrysummationvectors

The problem goes as

Let $P_1$, $P_2$, $P_3$, $\ldots P_n$ be $n$ points on a circle with radius unity. Prove that sum of squares of their mutual distances is not greater than $n^2$.

Using the properties of vectors, I assumed centre of circle as origin and the radius $r_1$, $r_2$, $r_3 \ldots$ as vectors but I'm not able to comprehend after that. My second thought was using complex numbers. Can they be used here?


$|r_1-r_2| +|r_1-r_3| +|r_1-r_4|+\dots|r_1-r_n|+ \\|r_2-r_3| +|r_2-r_4| +|r_2-r_5|+\dots|r_2-r_n|\ +\\.\\..\\…\\|r_{n-1}-r_n|$

I see that on squaring them and adding I get each term $n-1$ times and a huge no. of pairs are subtracted which I don't know how to write in an organized form.


$$D^2= (n-1)(r_1^2+r_2^2 ……,+r_n^2) -x$$
So although it's clear from the expression that distance is certainly less than $n^2$ but I want to know how to find $x$.

Best Answer

Let the center of the circle be an origin and $P_i(x_i,y_i).$

Thus, $x_i^2+y_i^2=1$ and $$\sum_{1\leq i<j\leq n}P_iP_j^2=\sum_{1\leq i<j\leq n}\left((x_i-x_j)^2+(y_i-y_j)^2\right)=$$ $$=n(n-1)-2\sum_{1\leq i<j\leq n}(x_ix_j+y_iy_j)=$$ $$= n(n-1)-\left(\sum_{i=1}^nx_i\right)^2-\left(\sum_{i=1}^ny_i\right)^2+\sum_{i=1}^n(x_i^2+y_i^2)\leq$$ $$\leq n(n-1)+n=n^2.$$

Related Question