## IMO 2014 Problem 2

Let be an integer. Consider a chessboard consisting of unit squares. A configuration of rooks on this board is *peaceful* 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 unit squares.

**IMO 2014 Problem 2 (Day 1)**

Advertisements

Categories: Combinatorics, IMO, Olympiad, Problem Solving
Combinatorics

Comments (0)
Trackbacks (0)
Leave a comment
Trackback