hard covering problem on infinite grid
Source: Globe Magazine 2008/5 C7
June 1, 2008
searchanalytic geometryvectorprobabilitycombinatorics unsolvedcombinatorics
Problem Statement
Real numbers are written on the squares of an infinite grid. Two figures consisting of finitely many squares are given. They may be translated anywhere on the grid as long as their squares coincide with those of the grid. It is known that wherever the first figure is translated, the sum of numbers it covers is positive. Prove that the second figure can be translated so that the sum of the numbers it covers is also positive.