Some cells of an infinite chessboard (infinite in all directions) are coloured blue so that at least one of the 100 cells in any 10×10 rectangular grid is blue. Prove that, for any positive integer n, it is possible to select n rows and n columns so that all of the n2 cells in their intersections are blue. combinatoricsinfinite grid