0
$\begingroup$

Let $A$ be an $m \times n$ matrix with entries from $\{1,2,...,k\}$. What is the minimum $k$ (as a function of $m$ and $n$) needed so that we can fill $A$ where no two columns are identical.

Thank you.

1 Answers 1