February 12–February 18, 2008
Problem
Given a (2m+1) x (2n+1) checkerboard in which the four corners are black squares, show that if one removes any one red square and any two black squares, the remaining board is coverable with dominoes (that is, by 1 x 2 rectangles).
Solution
here.
List of solvers
Steve Wilmarth (undergrad), Dustin Moody (grad), Lloyd Sakazaki, Mike Goodman (outside)
The winner this week is Steve Wilmarth!