MathDB
11st ibmo - costa rica 1996/q3.

Source: Spanish Communities

April 23, 2006
geometryrectanglecombinatorics unsolvedcombinatorics

Problem Statement

We have a grid of k2k+1k^2-k+1 rows and k2k+1k^2-k+1 columns, where k=p+1k=p+1 and pp is prime. For each prime pp, give a method to put the numbers 0 and 1, one number for each square in the grid, such that on each row there are exactly kk 0's, on each column there are exactly kk 0's, and there is no rectangle with sides parallel to the sides of the grid with 0s on each four vertices.