CMOQR 2018 Problem 2
We call a pair of polygons, and , nesting if we can draw one inside the other, possibly after rotation and/or reflection; otherwise we call them non-nesting.
Let and be polygons. Prove that if we can find a polygon , which is similar to , such that and are non-nesting if and only if and are not similar.
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.