2014 IMO Problems/Problem 2
Problem
Let be an integer. Consider an chessboard consisting of unit squares. A configuration of rooks on this board is if every row and every column contains exactly one rook. Find the greatest positive integer such that, for each peaceful configuration of rooks, there is a square which does not contain a rook on any of its squares.
Solution
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
See Also
1972 IMO (Problems) • Resources | ||
Preceded by Problem 1 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 2 |
All IMO Problems and Solutions |