Browse · MathNet
PrintEighteenth STARS OF MATHEMATICS Competition
Romania geometry
Problem
Prove that a convex polygon has three vertices such that
where denotes the area of the polygon .
where denotes the area of the polygon .
Solution
Let be a triangle of maximal area. Let be the reflection of across the midpoint of the side ; the points and are defined similarly. Note that at most one of these three reflections can be a vertex of the polygon — otherwise, the polygon would have three collinear vertices, contradicting convexity.
We will prove that the triangle covers the polygon . By the preceding, the cover is strict, so . As , the conclusion follows.
To prove the covering claim above, suppose, if possible, some vertex lies outside the triangle . Let denote the Euclidean distance of the point to line . Note that at least one of the three inequalities below holds: Hence at least one of the triangles , , has an area (strictly) greater than that of , contradicting the choice of this latter. This ends the proof.
We will prove that the triangle covers the polygon . By the preceding, the cover is strict, so . As , the conclusion follows.
To prove the covering claim above, suppose, if possible, some vertex lies outside the triangle . Let denote the Euclidean distance of the point to line . Note that at least one of the three inequalities below holds: Hence at least one of the triangles , , has an area (strictly) greater than that of , contradicting the choice of this latter. This ends the proof.
Techniques
Optimization in geometryRotationDistance chasing