Question

A $2$ by $2$ square is divided into four $1$ by $1$ squares. Each of the small squares is to be painted either green or red. In how many different ways can the painting be accomplished so that no green square shares its top or right side with any red square? There may be as few as zero or as many as four small green squares.

$4$

$6$

$7$

$8$

$16$

Solution:

The rule says a green square cannot have a red square on its top or right side, so any green square forces the squares above and to its right to be green as well. The green squares must therefore cluster toward the top-right corner.

The valid colorings are: all four red; only the top-right green; the whole top row green; the whole right column green; all green except the bottom-left; and all four green. That is $6$ colorings.

Thus, the correct answer is B .

1994 AMC 8 Problem 24

Solution:

Problem 24 in Other Years