There is a regular 17-gon P and its circumcircle Y on the plane.
The vertices of P are coloured in such a way that A,B∈P are of different colour, if the shorter arc connecting A and B on Y has 2k+1 vertices, for some k∈N, including A and B.
What is the least number of colours which suffices? geometrycircumcirclemodular arithmeticcombinatorics unsolvedcombinatorics