Maths Olympiad Prep

Track / Stage 7 / 113 of 300 #1993 of 2444

Problem 1993

National Olympiad second round; IMO P1/P4
Combinatorics Difficulty 7.2 Prove it Vietnamese Mathematical Olympiad · Vietnam

Given a positive integer nn. Given a square table of sizes 3×33 \times 3. One uses nn 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?

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Mark the squares of the table as shown below.
In the sequel, the squares that lie symmetric with respect to square xx 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 ss denote the number to be found.
We have the following remarks:

* Remark 1: When rotating the table around its center the square marked by xx does not move. Hence, denoting by s0s_0 the number of pairwise non-similar ways of painting 8 squares on the border of the table, then s=ns0s = n s_0.

123
8×4
765

* Remark 2: There are 4 rotations that move the table to itself: the rotation with angle α\alpha, the rotation with angle 2α2\alpha, the rotation with angle 3α3\alpha and the rotation with angle 4α4\alpha; where α=π2\alpha = \frac{\pi}{2}. Under each such rotation, the squares move as follows:
- the rotation with angle α\alpha: 135711 \to 3 \to 5 \to 7 \to 1 and 246822 \to 4 \to 6 \to 8 \to 2.
- the rotation with angle 2α2\alpha: 1511 \to 5 \to 1, 2622 \to 6 \to 2, 3733 \to 7 \to 3 and 4844 \to 8 \to 4.
- the rotation with angle 3α3\alpha: 175311 \to 7 \to 5 \to 3 \to 1 and 286422 \to 8 \to 6 \to 4 \to 2.
- the rotation with angle 4α4\alpha: each square comes back to its original place.

Let TT be the set of ways of painting 8 border squares, such that in each way, each square is painted by one color.
For each tTt \in T, denote k(t)k(t) the number of ways of painting that are similar to it.
Consider a way of painting tTt \in T. It follows from Remark 2 that:

+ k(t)=1 if and only if the odd squares are painted by the same color. +\ k(t) = 1 \text{ if and only if the odd squares are painted by the same color.}
+ k(t)=2 if and only if symmetric squares are painted by the same color, and 4 odd squares or 4 even squares are not painted by the same color. +\ k(t) = 2 \text{ if and only if symmetric squares are painted by the same color, and 4 odd squares or 4 even squares are not painted by the same color.}
+ k(t)=4 otherwise. +\ k(t) = 4 \text{ otherwise.}

For each i{1;2}i \in \{1; 2\}, denote Ti={tTk(t)=i}T_i = \{t \in T \mid k(t) = i\}. From the arguments above we have:
T1=n2andT2=n4n2. |T_1| = n^2 \quad \text{and} \quad |T_2| = n^4 - n^2.
Hence: s0=TT1T24+T22+T1=T+3T1+T24=n8+n4+2n24. \text{Hence:}\ s_0 = \frac{|T| - |T_1| - |T_2|}{4} + \frac{|T_2|}{2} + |T_1| = \frac{|T| + 3|T_1| + |T_2|}{4} = \frac{n^8 + n^4 + 2n^2}{4}.
Thus: s=ns0=n3(n6+n2+2)4. \text{Thus:}\ s = n \cdot s_0 = \frac{n^3(n^6 + n^2 + 2)}{4}.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.