Problem

Source: Iran 3rd round 2013- Combinatorics exam problem 2

Tags: modular arithmetic, combinatorics unsolved, combinatorics



How many rooks can be placed in an $n\times n$ chessboard such that each rook is threatened by at most $2k$ rooks? (15 points) Proposed by Mostafa Einollah zadeh