Difference between revisions of "1997 OIM Problems/Problem 6"
(→Problem) |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | Let <math>\textbf{P} = { | + | Let <math>\textbf{P} = {P_1, P_2, \cdots , P_{1997}}</math> be a set of 1997 points inside a circle of radius 1, with <math>P_1</math> being the center of the circle. For each <math>k = 1, \cdots , 1997</math> let <math>x_k</math> be the distance from <math>P_k</math> to the point of <math>\textbf{P}</math> closest to <math>P_k</math> and different from <math>P_k</math>. Show that |
<cmath>(x_1)^2 + (x_2)^2 + \cdots + (x_{1997})^2 \le 9</cmath> | <cmath>(x_1)^2 + (x_2)^2 + \cdots + (x_{1997})^2 \le 9</cmath> | ||
Latest revision as of 07:54, 26 December 2023
Problem
Let 
be a set of 1997 points inside a circle of radius 1, with 
being the center of the circle. For each 
let 
be the distance from 
to the point of 
closest to and different from . Show that
![\[(x_1)^2 + (x_2)^2 + \cdots + (x_{1997})^2 \le 9\]](http://latex.artofproblemsolving.com/d/0/7/d073e37edb14bff92b025b159a8d973da115e443.png)
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
