Find the minimum value of such that the following statement is true:
Given any configuration of 100 points which satisfies the condition that any 3 points determine a triangle of area , there exists a triangle of area which encloses all these points.
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.
Choose any 3 points X Y Z so that the area of △ X Y Z < = 1 .
Draw parallels A B ∥ X Z , B C ∥ Y X , A C ∥ Y Z and construct △ A B C . The area of △ A B C will be ≤ 4 .
Now we need to show that △ A B C contains the 100 points which satisfy that any triplets have an area ≤ 1 .
Assume that a point D is outside the △ X Y Z , see the above figure. The triangle area of △ D Y Z is > area of △ X Y Z . This contradicts the assumption. Then the maximum area of △ A B C doesn't exceed 4 annd all other points are inside or at the borders of △ A B C .
The number of points in this problem has no meaning and this solution is valid for any number of points satisfying the given condition.