MathDB

Each vertex of an

m\times n

grid is colored blue, green or red in such a way that all the boundary vertices are red. We say that a unit square of the grid is properly colored if:

(i)

all the three colors occur at the vertices of the square, and

(ii)

one side of the square has the endpoints of the same color. Show that the number of properly colored squares is even.

Problem Statement