Let a positive integer n.Consider square table 3∗3.One use n
colors to color all cell of table such thateach 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∗3 tableHow many way to color this square table satifies above conditions. geometrygeometric transformationrotationsymmetrycombinatorics unsolvedcombinatorics