Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

share|cite|improve this question

This looks like homework.

Hint 1: If there are $m$ rows and $k$ symbols, how many possible distinct columns are there?

Hint 2: If the answer to hint 1 must be greater then or equal to the actual number of columns $n$, what does this mean that $k$ must be greater than or equal to?

Bonus hint: How might you deal with a fractional answer to hint 2?

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.