Skip to main content
OlympiadHQ

Browse · MathNet

Print

Seventeenth ROMANIAN MASTER OF MATHEMATICS

Romania geometry

Problem

Let be an integer, and let be distinct points in the plane such that the distances between the points are pairwise different. Define to be the 10th smallest of the distances from to , excluding if . Suppose that for all and satisfying , we have . Prove that for all in the range . Iran, Morteza Saghafian
Solution
To prove this, choose an arbitrary , and let be the ten smallest numbers among the with , ordered so that . If , then , and the problem condition yields which is even stronger than we need. Otherwise, set (in this case we also have ), and denote . By the problem condition, we have . On the other hand, we have as . So , as desired.

Alternative solution. Let , . To prove that for every , induct on . Consider the base case, . Note that each , as is 10-variate. Let for some index . Clearly, and if then , by the triangle inequality. For the induction step, let and note that as both maxima are achieved at , by the condition in the statement. Hence also satisfy this condition. Let , . By the induction hypothesis, for all . Note that ; the first inequality holds by the condition in the statement for and the second because adding more variables to does not increase its value. Let now be the closed disc (interior and boundary) of radius , centred at . By the definition of , each contains at least 11 points, of which at most 10 (, inclusive) lie strictly inside. Finally, suppose, if possible, that for some index . If is not among the first 10 distances from to the other points, then and this leads to a contradiction with the induction hypothesis. So has to be among the first 10 distances from to the other points. This means that , so . Hence lies strictly inside . This is a contradiction, as contains at least 11 points, whereas contains at most 10 strictly inside. The conclusion follows.

Techniques

Distance chasingConstructions and lociTriangle inequalitiesCombinatorial Geometry