MathDB

In a coordinate plane, consider the set of points with integer cooedinates at least one of which is not divisible by

4

. Prove that these points cannot be partitioned into pairs such that the distance between points in each pair equals

1

. In other words, an infinite chessboard, whose cells with both coordinates divisible by

4

are cut out, cannot be tiled by dominoes.

Problem Statement