From the earth to the moon

Probability Level pending

Let A A be a set of 300 300 distinct points given in the plane. Let B B be the set of midpoints of all segments with two distinct endpoints in A A . What is the smallest possible size of B B ?


The answer is 597.

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.

1 solution

Calvin Lin Staff
May 13, 2014

If we let the points be ( 0 , 0 ) , ( 2 , 0 ) , , ( 598 , 0 ) (0,0), (2,0), \ldots, (598,0) , then the midpoint of any pair of points will be a point of the form ( k , 0 ) (k,0) with 1 k 597 1 \leq k \leq 597 . So the minimum possible size of B B is at most 597 597 . We will show that we are unable to do any better.

Because we have 300 300 points, there are at most ( 300 2 ) \binom{300}{2} different slopes which occur between pairs of points. Choose a slope m m such that no pair of points has slope 1 m \frac{-1}{m} between them. We can rotate the plane such that the line y = m x y = mx 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 A will have a distinct x x -coordinate. We can label the points A 1 , A 2 , , A n A_1, A_2, \ldots, A_n in ascending order of x-coordinate. The x-coordinates of the midpoints of A i , A i + 1 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 A_i,A_{i+2} . No point can occur as a midpoint in both of these instances, so we get a total of 299 + 298 = 597 299 + 298 = 597 distinct midpoints from this. Thus, we always have at least 597 597 distinct midpoints, and 597 597 distinct midpoints is attainable, so it is our minimum.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...