AIME 1996 · 第 7 题

Solution 1 (Generalized)

There are ${49 \choose 2}$ possible ways to select two squares to be painted yellow. There are four possible ways to rotate each board. Given an arbitrary pair of yellow squares, these four rotations will either yield two or four equivalent but distinct boards.

For most pairs, there will be three other equivalent boards.

For those symmetric about the center, there is only one other.

Note that a pair of yellow squares will only yield $2$ distinct boards upon rotation iff the yellow squares are rotationally symmetric about the center square; there are $\frac{49-1}{2}=24$ such pairs. There are then ${49 \choose 2}-24$ pairs that yield $4$ distinct boards upon rotation; in other words, for each of the ${49 \choose 2}-24$ pairs, there are three other pairs that yield an equivalent board.

Thus, the number of inequivalent boards is $\frac{{49 \choose 2} - 24}{4} + \frac{24}{2} = \boxed{300}$. For a $(2n+1) \times (2n+1)$ board, this argument generalizes to $n(n+1)(2n^2+2n+1)$ inequivalent configurations.

Solution 2 (Casework)

There are 4 cases: 1. The center square is occupied, in which there are $12$ cases. 2. The center square isn't occupied and the two squares that are opposite to each other with respect to the center square, in which there are $12$ cases. 3. The center square isn't occupied and the two squares can rotate to each other with a $90^{\circ}$ rotation with each other and with respect to the center square, in which case there are $12$ cases. 4. And finally, the two squares can't rotate to each other with respect to the center square in which case there are $\dbinom{12}{2} \cdot \frac{16}{4} = 264$ cases. Add up all the values for each case to get $\boxed{300}$ as your answer.

~First

Solution 3 (Burnside’s Lemma)

Consider the group $G=\mathbb{Z}/4\mathbb{Z}$ with addition acting on set $X$, where $X$ is the set of color schemes on the checkerboard. We now apply Burnside’s Lemma. Since $\mathbb{Z}/4\mathbb{Z}=\langle r \mid r^4=1\rangle$, we only need to consider 4 cases for $g$ an element of $\mathbb{Z}/4\mathbb{Z}$.

1. $g=1$. There are clearly ${49 \choose 2}$ cases.

2. $g=r$. Since this is a $90$ degree rotation, there are no fixed points under this transformation.

3. $g=r^2$. There are $24$ cases (which can be manually checked).

4. $g=r^3$. There are no cases since this is just Case $2$ but with a $-90$ degree rotation.

Therefore, by Burnside’s Lemma there are $\frac{1176+24+0+0}{|G|}=\frac{1200}{4}=\boxed{300}$ inequivalent configurations (also known as orbits in group-theoretic terms).