Problem

Source: Moldova TST 2021

Tags: combinatorics



Let $n$ be a positive integer. A panel of dimenisions $2n\times2n$ is divided in $4n^2$ squares with dimensions $1\times1$. What is the highest possible number of diagonals that can be drawn in $1\times1$ squares, such that each two diagonals have no common points.