Question 115
Let $n \ge 5$ be a positive integer coprime to $6$. We colour each of the $n$ vertices of a regular $n$-gon with one of three colours so that the number of vertices of each colour is odd. Prove that we can always find three of these $n$ vertices which have pairwise different colours and which form an isosceles triangle.