# Filling $1..mn$ into a $m×n$ rectangle such that every number $<mn$ is dominated

This is a problem from my professor, who claimed that it's open:

Combinatorial problem.

Fill $$1,2,...,mn$$ into a rectangle of size $$m\times n$$, such that for every number other than $$mn$$, there is a larger number which is in the same row or column.

Prove there are $$\frac{(mn)!m!n!}{(m+n-1)!}$$ ways to fill.

It is said that the problem is from a high school student.

I would like to know:

Is the problem really open?

If it's open, are there any references? Is it from a high school student, as claimed?

There's no need to answer the problem to any extent.

• I have rolled the title back to the wording of the OP, which is consistent with the wording of the question being quoted by the OP, rather than the pernickety change of title made by the edit-happy user @user64494 – Yemon Choi Jun 29 at 13:56
• @Yemon Choi: As far as I know it, the rectangle is a geometric term. I have never before seen rows and columns of a rectangle. Also the use of the notation $<$ in a title does not make a good impression. – user64494 Jun 29 at 17:45
• @user64494 for example, "Latin rectangles" have rows and columns, and they are matrices/boards/tableaux filled with prescribed numbers, just as in this question. The word "matrix" is more algebraic-flavoured, as for me. – Fedor Petrov Jun 30 at 7:05