I recently watched a movie (A Brilliant Young Mind) in which this problem appeared:
Let the vertices of a regular 72-gon be colored red, blue, and green in equal parts. Show that there are 4 vertices of each color such that the resulting monochromatic quadrilaterals formed are congruent to each other.
I don’t know the solution to this problem, nor do I even know if the problem is actually true (it is from a movie after all). But I would love to see a proof, if one exists, or otherwise a counter-example.
This is essentially Problem #7 from Tournament of the Towns, Fall 2011, Junior A-Level and Problem #2 from USAMO 2012.
Tournament of the Towns, Fall 2011, Junior A-Level, Problem #7. Each vertex of a regular 45-gon is red, yellow or green, and there are 15 vertices of each colour. Prove that we can choose three vertices of each color so that the three triangles formed by the chosen vertices of the same color are congruent to one another.
The official solution is here.
USAMO 2012, Problem #2. A circle is divided into 432 congruent arcs by 432 points. The points are colored in four colors such that some 108 points are colored Red, some 108 points are colored Green, some 108 points are colored Blue, and the remaining 108 points are colored Yellow. Prove that one can choose three points of each color in such a way that the four triangles formed by the chosen points of the same color are congruent.