2008 UNCO Math Contest II Problems/Problem 1

Revision as of 22:52, 19 October 2014 by Timneh (talk | contribs) (Created page with "== Problem == Determine the number of <math>3 \times 3</math> square arrays whose row and column sums are equal to <math>2</math>, using <math>0, 1, 2</math> as entries. Entries...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Determine the number of $3 \times 3$ square arrays whose row and column sums are equal to $2$, using $0, 1, 2$ as entries. Entries may be repeated, and not all of $0, 1, 2$ need be used as the two examples show.

\[\begin{tabular}{c c c c c c c c c} 1 & 1 & 0 & & & & 0 & 1 & 1 \\ 0 & 0 & 2 & & & & 1 & 1 & 0 \\ 1 & 1 & 0 & & & & 1 & 0 & 1 \\ \end{tabular}\]


Solution

See Also

2008 UNCO Math Contest II (ProblemsAnswer KeyResources)
Preceded by
First Question
Followed by
Problem 2
1 2 3 4 5 6 7 8 9 10
All UNCO Math Contest Problems and Solutions