Let be a set of distinct points given in the plane. Let be the set of midpoints of all segments with two distinct endpoints in . What is the smallest possible size of ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If we let the points be ( 0 , 0 ) , ( 2 , 0 ) , … , ( 5 9 8 , 0 ) , then the midpoint of any pair of points will be a point of the form ( k , 0 ) with 1 ≤ k ≤ 5 9 7 . So the minimum possible size of B is at most 5 9 7 . We will show that we are unable to do any better.
Because we have 3 0 0 points, there are at most ( 2 3 0 0 ) different slopes which occur between pairs of points. Choose a slope m such that no pair of points has slope m − 1 between them. We can rotate the plane such that the line y = m x is mapped onto the x-axis. It is clear that this transformation does not affect the number of distinct midpoints. After this transformation, every point in A will have a distinct x -coordinate. We can label the points A 1 , A 2 , … , A n in ascending order of x-coordinate. The x-coordinates of the midpoints of A i , A i + 1 will all be pairwise distinct, so the midpoints will also be pairwise distinct. This is also true for the midpoints for A i , A i + 2 . No point can occur as a midpoint in both of these instances, so we get a total of 2 9 9 + 2 9 8 = 5 9 7 distinct midpoints from this. Thus, we always have at least 5 9 7 distinct midpoints, and 5 9 7 distinct midpoints is attainable, so it is our minimum.