MathDB
color k cells of nxn table, n tokens

Source: P2 Francophone Math Olympiad Junior 2022

May 23, 2022
combinatoricscombinatorial geometryColoring

Problem Statement

We consider an n×nn \times n table, with n≥1n\ge1. Aya wishes to color kk cells of this table so that that there is a unique way to place nn tokens on colored squares without two tokens are not in the same row or column. What is the maximum value of kk for which Aya's wish is achievable?
Back to ProblemsView on AoPS