Maths Olympiad Prep

Library / /112 of 120

, 2012

Geometry Difficulty 6.5 National olympiad Prove it Saudi Arabia

Determine all positive integers n2n \ge 2 for which the following statement is true:
Given any nn distinct points on the plane such that the distance between each pair of points is distinct, there exists a pair of points AA, BB for which the difference between the number of points lying on either side of the perpendicular bisector of segment ABAB is not greater than 11.

Solution

The statement trivially holds for n=2n = 2 and n=3n = 3. We will show that it does not hold for any n4n \ge 4.

First suppose that nn is even. Setup a coordinate, and place a point at (0,0)(0,0). Place n/21n/2 - 1 points on the negative xx-axis and n/21n/2 - 1 points on the positive xx-axis at (1/2i,0)(-1/2^i, 0) and (2i,0)(2^i, 0) for i=1,2,,n1i = 1, 2, \dots, n-1. Place the last point on the positive yy-axis, so that the perpendicular bisector of the segment joining that point and any of the previously placed point divides the plane into two parts, one of which contains only the last point. (It is clear that we can do this, and that this construction serves as a counterexample to the given statement.)

If nn is odd, we simply add another point on the negative yy-axis, so that perpendicular bisector of the segment joining that point and any of the previously placed point of the xx-axis divides the plane into two parts, one of which contains only the last point. Also, the distance from the xx-axis of the point on the positive yy-axis and the point on the negative yy-axis should be distinct.

Want a route through all this instead of 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.