Question 10
Let $k \gt 1$ be an integer. Determine the smallest positive integer $n$ such that some cells of an $n \times n$ board can be colored black with exactly $k$ black cells in every row and column, and with no two black cells sharing a side or a vertex.
**Clarification:** Express $n$ in terms of $k$.
**Clarification:** Express $n$ in terms of $k$.