9. consider a convex 15-vertex with perimeter 21. show that you can choose three different vertices in pairs that form a triangle with area less than 1.
Solution
Solution: Name the 15 sides and define . Consider the sums for . Dann gilt . Using the pusher compartment principle, it follows that there is a exists. The triangle, which has the two side lengths and , can therefore span at most the area , i.e. at most . We therefore want to show that follow, so we are done.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.