MathDB
color the vertices of a regular n-gon using at most 6 colors

Source: Austrian - Polish 2000 APMC

May 4, 2020
Coloringregular polygoncombinatorics

Problem Statement

For which integers n≥5n \ge 5 is it possible to color the vertices of a regularn n-gon using at most 66 colors in such a way that any 55 consecutive vertices have different colors?
Back to ProblemsView on AoPS