Given a positive integer . Given a square table of sizes . One uses colors to paint the squares of the table in such a way, that each square is painted by one color. Two ways of painting is considered to be similar if they can be obtained from each other by rotating the table around its center. How many non-similar ways of painting are there?
Solution
Mark the squares of the table as shown below.
In the sequel, the squares that lie symmetric with respect to square are called symmetric; a square that is marked with odd number is called odd square; a square that is marked with even number is called even square.
Let denote the number to be found.
We have the following remarks:
* Remark 1: When rotating the table around its center the square marked by does not move. Hence, denoting by the number of pairwise non-similar ways of painting 8 squares on the border of the table, then .
| 1 | 2 | 3 |
|---|---|---|
| 8 | × | 4 |
| 7 | 6 | 5 |
* Remark 2: There are 4 rotations that move the table to itself: the rotation with angle , the rotation with angle , the rotation with angle and the rotation with angle ; where . Under each such rotation, the squares move as follows:
- the rotation with angle : and .
- the rotation with angle : , , and .
- the rotation with angle : and .
- the rotation with angle : each square comes back to its original place.
Let be the set of ways of painting 8 border squares, such that in each way, each square is painted by one color.
For each , denote the number of ways of painting that are similar to it.
Consider a way of painting . It follows from Remark 2 that:
For each , denote . From the arguments above we have: