inequalities in areas by chords of a non convex polygon
Source: TOT 419 1994 Spring A S7 - Tournament of Towns
June 12, 2024
inequalitiesgeometry
Problem Statement
Consider an arbitrary “figure” (non convex polygon). A chord of is defined to be a segment which lies entirely within and whose ends are on its boundary.(a) Does there always exist a chord of that divides its area in half?
(b) Prove that for any there exists a chord such that the area of each of the two parts of is not less than of the area of .
(c) Can the number in (b) be changed to a greater one?(V Proizvolov)