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

How many ways to fill the $4 \times 4$ board by nonnegative integers, such that sum of the numbers of each row and each column is $3$?

I wrote a brute-force and got $2008$ which seems to be the right answer. I was wondering what is the combinatorial way of solving this one? How about the general problem of $N\times N$ or $N\times K$ with sum a $R$?

share|cite|improve this question
@deinst: What do you mean? – Quixotic Apr 2 '12 at 15:20
@Fool The problem you ask (in the NxN case) is counting the number of lattice points in a Birkhoff polytope. The number is a polynomial in the row/column sum. They computed this polynomial for N up to 10. – deinst Apr 2 '12 at 15:24
For a simpler approach see… – deinst Apr 2 '12 at 15:26

Your Answer


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

Browse other questions tagged or ask your own question.