BALTIC-WAY 2014 Problem 9

Answer

What is the least possible number of cells that can be marked on an $n \times n$ board such that for each $m>\frac{n}{2}$ both diagonals of any $m \times m$ sub-board contain a marked cell?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator baltic-way/2014/p9 · Tag F5S9EFV5C2 · Edit this page on GitHub · Keys: j next, k previous