Difference between revisions of "2008 UNCO Math Contest II Problems/Problem 1"
(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...") |
Mathisfun04 (talk | contribs) (→Solution) |
||
| Line 14: | Line 14: | ||
| − | == Solution == | + | == Solution == |
| − | + | {{solution}} | |
== See Also == | == See Also == | ||
Revision as of 14:30, 26 November 2016
Problem
Determine the number of 
square arrays
whose row and column sums are equal to 
,
using 
as entries. Entries may be
repeated, and not all of 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}\]](http://latex.artofproblemsolving.com/1/9/3/193d3e832a73e50c554943e89689a7720cf0c3fb.png)
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 2008 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
| 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 | ||
