Prove that in any convex polygon where all pairwise distances between vertices are distinct, there exists a vertex such that the closest vertex of the polygon is adjacent to it. Proposed by D. Shiryayev, S. Berlov
Source: 239 Open MO, 2018, Senior League, Problem 1
Tags: combinatorial geometry, geometry
Prove that in any convex polygon where all pairwise distances between vertices are distinct, there exists a vertex such that the closest vertex of the polygon is adjacent to it. Proposed by D. Shiryayev, S. Berlov