Label the vertices of a regular -gon from 1 to . Draw all the diagonals. Show that if is odd then we can label each side and diagonal with a number from 1 to different from the labels of its endpoints so that at each vertex the sides and diagonals all have different labels.
Solution
Labeling the diagonal/side between and as (reduced if necessary mod ) almost works. The labels for all the lines at a given vertex will be different. But the line between i and will have label i, the same as one endpoint. However, we are not using the label 2i for the lines from vertex i. So for the line between and we use instead of . The only points that need checking are (1) whether a line from to has a label different from , and (2) whether all the lines at have different labels. Both points are ok because is odd.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.