Home > Combinatorics, Geometry, IMO, Olympiad, Problem Solving > BMO 2010 strip cover problem

BMO 2010 strip cover problem

Suppose that a set if a S in the plane containing n points has the property that any three points can be covered by an infinite strip of width 1. Prove that S can be covered by a strip of width 2.
Balkan Mathematical Olympiad 2010
Probably the easiest problem in the contest, maybe just junior level. Taking the triangle with the greatest area, ABC (if the points are not all in a line), constructing the triangle who’s midpoints are the vertices of the given triangle. It’s easy to see that S is contained in this triangle. Taking a homothety of center the gravity center of ABC and ratio -2 the strip which contains ABC is transformed in a strip which contains $S$, and has width 2.

I think, that by a limit argument this can be generalized to infinitely countable S.

  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: