There are (2n - 1) rooks on a (2n - 1)×(2n - 1) board placed so that none of them threatens another. Prove that any n×n square contains at least one rook.

|Contact| |Front page| |Contents| |Up|

Copyright © 1996-2018 Alexander BogomolnyThere are (2n - 1) rooks on a (2n - 1)×(2n - 1) board placed so that none of them threatens another. Prove that any n×n square contains at least one rook.

### Solution

Assuming an n×n square is void of the rooks, there remain

(This is Problem 11.5 from the 1993-1994 St Petersburg Regional Mathematical Olympiad, grade 11.)

|Contact| |Front page| |Contents| |Up|

Copyright © 1996-2018 Alexander Bogomolny71061352