olymmath

AUSTRIAN-POLISH 2000 Problem 5

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

    Dataset text AI-MO AoPS. 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.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator austrian-polish/2000/p5 · Tag CPW8N068HF · Edit this page on GitHub · Keys: j next, k previous