Skip to main content
OlympiadHQ

Browse · MathNet

Print

China Mathematical Olympiad

China geometry

Problem

There are 5 points in a rectangle (including its boundary) with unit area such that any three of them are not collinear. Find the minimum number of triangles with areas no more than and vertexes chosen from these 5 points. (posed by Leng Gangsong)

problem


problem


problem


problem


problem
Solution
Lemma The area of a triangle inscribed in a rectangle is no more than half of the area of the rectangle.

Denote , , and the midpoints of , , and , respectively, and the intersection of line segments and . and divide the rectangle into 4 small rectangles, it follows that there exists certain small rectangle, say , in which there are at least two points (say, and ) out of those 5 points, see Figure 5.

Figure 5

(1) If there is no more than one given point in the rectangle , consider any given point which is different from and and not in the rectangle . It is easy to verify that triple is either in rectangle , or in rectangle . By the above lemma is good. Since there are at least two such points , we have at least two such good triples.

(2) If there exist at least two given points in rectangle , we suppose that and are the given points in rectangle . Consider the final given point . If is in the rectangle , then is in the rectangle , and is in the rectangle . So they are all good. It follows that there are at least two good triples. Similarly, when point is in the rectangle there are at least two good triples too. If point is in the rectangle or the rectangle , suppose that is in the rectangle . Consider the smallest convex polygon containing the 5 points , , , and . The polygon must be contained in the convex hexagon (see Figure 6). But the area

Figure 6

i) Suppose the convex polygon generated by and is a convex pentagon, (no loss of generality) say (as seen in Figure 7). In this case it follows that there is at least one good triple among , and . Moreover, is clearly good for it is in the rectangle . Thus there are at least two good triples.

Figure 7

ii) If the convex polygon generated by and is a convex quadrilateral, say , and the fifth point is (as seen in Figure 8) where . Draw line segments (), then Therefore, there are at least two good triples among , , and .

Figure 8

iii) If the convex polygon generated by and is a triangle, say , and the remaining two points are and (as seen in Figure 9), where . Draw line segments , then Therefore, there is at least one good triple among , and . Similarly, with two of and constitutes a good triple. Consequently, in this case there are at least two good triples.

Figure 9

Thus, in any case there are at least two good triples among these 5 points.

In the following we will give some examples to show that the number of good triples may be just two. Pick a point on the side of the rectangle and a point on the side such that (as shown in Figure 10). Then among 5 points and there are just two good triples. In fact, is clearly not good. Suppose that a triple containing exactly one of two points and , say . Let be the midpoint of , then It follows that is not good. Thus Hence and are not good. If a triangle does contain two points and , then So is not good. But , thus among the triples there are only two good triples and .

Consequently, the minimum number of triangles with area not greater than is .
Final answer
2

Techniques

Convex hullsPigeonhole principleOptimization in geometry