Four. (50 points) Given a square with side length n and (n+1)2 points inside it, where no three points are collinear. Prove: It is possible to select three of these points such that the area of the triangle formed by these three points does not exceed 21.
untranslated part: (No additional text to translate)
Solution
Let the convex hull of these (n+1)2 points be a k-sided polygon. (1) If k⩾4n, then the perimeter of the k-sided polygon does not exceed 4n (since the convex hull is inside the square). Therefore, there exist two consecutive sides whose lengths sum to no more than 2. Then the area of the triangle formed by these two vertices is greater than 21. (2) If k<4n, the convex hull divides the square into k triangles. Since the total area of the square is 1, the average area of these triangles is k1. Given that k<4n, the average area of these triangles is greater than 4n1. Therefore, there must be at least one triangle with an area no greater than 21. Hence, in either case, the original proposition holds.
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.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.