VMO 1995 Problem 6
How many ways are there of coloring the vertices of a regular 2n-gon with n colors, such that each vertex is given one color, and every color is used for two non-adjacent vertices? Colorings are regarded as the same if one is obtained from the other by rotation.
Community text Kalva (prase.cz mirror). 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.