Skip to main content
OlympiadHQ

Browse · MathNet

Print

China Western Mathematical Olympiad

China counting and probability

Problem

All the grids of an chessboard () are colored either red or blue. Two adjacent grids (with a common side) are called a good couple if they are of different colors. Suppose that there are good couples, explain how to determine whether is odd or even. Does it depend on certain specific color grids? (Reasoning is required.) (posed by Feng Yuefeng)
Solution
Solution I Classify all grids into three parts: the grids at the four corners, the grids along the borderlines (not including four corners), and the other grids. Fill all red grids with label number , all blue grids with label number . Denote the label numbers filled in the grids in the first part by , , and , in the second part by , and in the third part by . For any two adjacent grids we write a label number which is the product of two label numbers of the two grids on their common edge. Let be the product of all label numbers on common edges.

There are adjacent grids for every grid in the first part, thus its label number appears twice in . There are adjacent grids for every grid in the second part, thus its label number appears three times in . There are adjacent grids for every grid in the third part, thus its label number appears four times in . Therefore, If , then , and in this case there are even good couples. If , then , and in this case there are odd good couples. It shows that whether is even or odd is determined by colors of the grids in the second part. Moreover, when there are odd blue grids among the grids in the second part, is odd. Otherwise is even.

Solution II Classify all grids into three parts: the grids at the four corners, the grids along the borderlines (not containing four corners), and the other grids.

If all grids are red, then , which is even. If there are blue grids we pick any one of them, say , and change into a red one. We call this changing a transformation.

(1) is a grid in the first part. Suppose that there are red grids and blue grids among 's two adjacent grids. After changing into a red one, the number of good couples increases by . It follows that the parity even or odd of is unchanged.

(2) is a grid in the second part. Suppose that there are red grids and blue grids among 's three adjacent grids. After changing into a red one, the number of good couples increases by . It follows that the parity of is changed.

(3) is a grid in the third part. Suppose that there are red grids and blue grids among 's four adjacent grids. After changing into a red one, the number of good couples increases by . It follows that the parity of is unchanged.

If there are still blue grids on the chessboard after above transformation, we continue doing the transformation over and over again until no blue grid left on the chessboard. Now is changed into .

Clearly, changes its parity odd times if there are odd blue grids among the second part of grids. Similarly, changes its parity even times if there are even blue grids among the second part of grids. It implies that the parity of is determined by the coloring of the second part of grids. When there exist odd blue grids among the second part of grids, is odd. When there exist even blue grids among the second part of grids, is even.
Final answer
The parity of S depends only on the non-corner border squares: S is odd if and only if there are an odd number of blue border (non-corner) squares; otherwise S is even.

Techniques

Invariants / monovariantsColoring schemes, extremal arguments