Question 90
Given a positive integer $m$, determine the smallest integer $n \ge 2$ satisfying the following condition: No matter how the cells of an $n \times n$ array are colored one of $m$ colors, there exist cells $(i, j)$ and $(j, k)$, $i \neq j$ and $j \neq k$, sharing the same color.