olymmath

IMO 2014 Problem 2

Let n≥2n \ge 2 be an integer. Consider an n×nn \times n chessboard consisting of n2n^2 unit squares. A configuration of nn rooks on this board is peaceful if every row and every column contains exactly one rook. Find the greatest positive integer kk such that, for each peaceful configuration of nn rooks, there is a k×kk \times k square which does not contain a rook on any of its k2k^2 unit squares.

Official text Transcription from AI-MO AoPS, checked word for word against the official paper. Quoted with source.

Official text: IMO 2014 official English paper, page 1.

Also ISL 2014 C3.

Show the answer

\lfloor\sqrt{n-1}\rfloor

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator imo/2014/p2 · Tag 26P4N9Q5E1 · Edit this page on GitHub · Keys: j next, k previous