JAPANESE 2001
Source: Japanese MO Finals 2001
April 16, 2005
combinatorics unsolvedcombinatorics
Problem Statement
Each square of an chessboard is painted black or white in such a way that for every black square, the number of black squares adjacent to it is odd (two squares are adjacent if they share one edge). Prove that the number of black squares is even.