1994 AJHSME Problem 24
Source:
July 9, 2011
Problem Statement
A by square is divided into four by 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.