Lam's Problem

Given an $111\times 111$ Matrix, fill 11 spaces in each row in such a way that all columns also have 11 spaces filled. Furthermore, each pair of rows must have exactly one filled space in the same column. This problem is equivalent to finding a Projective Plane of order 10. Using a computer program, Lam showed that no such arrangement exists.

See also Projective Plane