Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2008 UNCO Math Contest II Problems/Problem 1"
m (→‎Solution)
 
Line 15: Line 15:
  
 
== Solution ==  
 
== Solution ==  
−
{{solution}}
 
−
 
 
Case 1: The numbers include <math>0,1,2</math>
 
Case 1: The numbers include <math>0,1,2</math>
  
Line 68: Line 66:
  
 
This gives us a total of <math>3+3+3+6+6=\boxed{21}</math> ways.
 
This gives us a total of <math>3+3+3+6+6=\boxed{21}</math> ways.
−
 
−
 
−
 
−
 
  
 
== See Also ==
 
== See Also ==

Latest revision as of 12:53, 11 January 2019

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

Case 1: The numbers include $0,1,2$

Row 1: $0 1 1$

Row 2: $2 0 0$

Row 3: $0 1 1$

There are 3 rows to choose where to place Row 2, giving us $\boxed3$ cases.

Case 2: The numbers include $0,1,2$

Row 1: $1 0 1$

Row 2: $0 2 0$

Row 3: $1 0 1$

There are 3 rows to choose where to place Row 2, giving us $\boxed3$ cases.

Case 3: The numbers include $0, 1, 2$

Row 1: $1 1 0$

Row 2: $0 0 2$

Row 3: $1 1 0$

There are 3 rows to choose where to place Row 2, giving us $\boxed3$ cases.

Case 4: The numbers include $0, 2$

Row 1: $0 0 2$

Row 2: $0 2 0$

Row 3: $2 0 0$

There are 3 rows to choose where to place Row 2, and Row 1 can go on either top or bottom, giving us $3\times2=\boxed6$ cases.

Case 5: The numbers include $0, 1$

Row 1: $0 1 1$

Row 2: $1 0 1$

Row 3: $1 1 0$

There are 3 rows to choose where to place Row 2, and Row 1 can go on either top or bottom, giving us $3\times2=\boxed6$ cases.

This gives us a total of $3+3+3+6+6=\boxed{21}$ ways.

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
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2008_UNCO_Math_Contest_II_Problems/Problem_1&oldid=100265"