Problem

Source: Tuymadaa Senior P5 2024

Tags: combinatorics, Chessboard, board, Coloring



Given a board with size $25\times 25$. Some $1\times 1$ squares are marked, so that for each $13\times 13$ and $4\times 4$ sub-boards, there are atleast $\frac{1}{2}$ marked parts of the sub-board. Find the least possible amount of marked squares in the entire board.