Month: February 2013

The problem: Each cell of an 8×8 chessboard is filled with either a 0 or a 1. Prove that if we compute the sums of the numbers in each row, each column, and each of the two diagonals, at least three of the sums must be equal. I worked on this recently with some middle…