RO-TST 2008 Problem 8
Show that each convex pentagon has a vertex from which the distance to the opposite side of the pentagon is strictly less than the sum of the distances from the two adjacent vertices to the same side.
Note. If the pentagon is labeled , the adjacent vertices of are and , the ones of are and etc.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.