MathDB
TOT 241 1989 Autumn A S5 100 points, N convex N-gon, 100-N interior

Source:

March 12, 2021
combinatorial geometrycombinatoricsgeometryconvex polygonpolygon

Problem Statement

We are given 100100 points. NN of these are vertices of a convex NN-gon and the other 100āˆ’N100 - N of these are inside this NN-gon. The labels of these points make it impossible to tell whether or not they are vertices of the NN-gon. It is known that no three points are collinear and that no 44 points belong to two parallel lines. It has been decided to ask questions of the following type: What is the area of the triangle XYZXYZ, where X,YX, Y and ZZ are labels representing three of the 100100 given points? Prove that 300300 such questions are sufficient in order to clarify which points are vertices and to determine the area of the NN-gon.
(D. Fomin, Leningrad)