RU-ALLRUSSIAN 1985 Problem 4
Call a side or diagonal of a regular n- gon a segment. How many colors are required to paint all the segments of a regular n- gon, so that each segment has a single color and every two segments with a vertex in common have different colors.
Dataset text NuminaMath olympiads. 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.