olymmath

VMO 2010 Problem 5

    Let a positive integer nn .Consider square table 3∗33*3 .One use nn colors to color all cell of table such that

    each cell is colored by exactly one color.

    Two colored table is same if we can receive them from other by a rotation through center of 3∗33*3 table

    How many way to color this square table satifies above conditions.

    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 vn-vmo/2010/p5 · Tag Y4AFH9XZS3 · Edit this page on GitHub · Keys: j next, k previous