olymmath

HMMT 2019 C9

  • Combinatorics
  • Answer

How many ways can one fill a 3×33 \times 3 square grid with nonnegative integers such that no nonzero integer appears more than once in the same row or column and the sum of the numbers in every row and column equals 7 ?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

216

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2019/c9 · Tag 4CK8CE03R3 · Edit this page on GitHub · Keys: j next, k previous