释义 |
Lam's ProblemGiven an Matrix, fill 11 spaces in each row in such a way that all columns also have 11 spacesfilled. Furthermore, each pair of rows must have exactly one filled space in the same column. This problem is equivalentto finding a Projective Plane of order 10. Using a computer program, Lam showed that no such arrangementexists. See also Projective Plane
|