AMC 10 Step by Step

2010 AMC 10B Problem 23

P21-25~8 minPrint

The entries in a 3×33 \times 3 array include all the digits from 11 through 99 , arranged so that the entries in every row and column are in increasing order. How many such arrays are there?

Log in to save your progress.
Show solution without answering

Key insight

1 and 9 are stuck in opposite corners. The center must be 4, 5 or 6; in each case the leftover cells split into small pieces you can count.

Solution

Name the cells with letters:

11aabb
ccmmdd
eeff99

Why 11 and 99 go in those corners. Every cell except the top-left has a cell to its left or above it that is smaller. The digit 11 has nothing smaller, so it must go top-left. In the same way, 99 has nothing larger, so it must go bottom-right.

The rules left to check are: rows a<ba < b, c<m<dc < m < d, e<fe < f, and columns c<ec < e, a<m<fa < m < f, b<db < d.

The center mm is the busiest cell, so start there. It is larger than 11, aa and cc, so it is at least 44. It is smaller than dd, ff and 99, so it is at most 66. So mm is 44, 55 or 66.

Case m=4m = 4.

  1. aa and cc are less than 44, so they are 22 and 33 in some order: 22 ways.
  2. The cells b,d,e,fb, d, e, f get 5,6,7,85, 6, 7, 8. The only rules left among them are b<db < d and e<fe < f (all the others hold automatically). Choose which two of the four digits go to bb and dd: 66 ways. The smaller one goes to bb, and the other two digits go to e<fe < f.
  3. Total: 2⋅6=122 \cdot 6 = 12.

Case m=6m = 6.

  1. dd and ff are more than 66, so they are 77 and 88 in some order: 22 ways.
  2. The cells a,b,c,ea, b, c, e get 2,3,4,52, 3, 4, 5 with the rules a<ba < b and c<ec < e. Choose the two digits for aa and bb: 66 ways.
  3. Total: 2⋅6=122 \cdot 6 = 12.

Case m=5m = 5.

  1. The small digits 2,3,42, 3, 4 must fill aa, cc, and one more cell. That cell cannot be dd or ff (they are bigger than 55), so it is bb or ee.
  2. Say bb is small. Then the top row is 1,a,b1, a, b and cc is the third small digit. Choose cc from 2,3,42, 3, 4 (33 ways); the other two go to a<ba < b in order. The big digits 6,7,86, 7, 8 fill d,e,fd, e, f with only the rule e<fe < f: choose dd (33 ways), and the other two go to e<fe < f. That is 3⋅3=93 \cdot 3 = 9 arrays.
  3. If instead ee is small, flip the grid over the diagonal from 11 to 99 (rows become columns). This matches each array of step 8 with one here, so there are 99 more.
  4. Total: 1818.

Altogether: 12+12+18=4212 + 12 + 18 = 42.

The answer is (D) 42\boxed{\textbf{(D)}\ 42}.

Why this works

When a grid has "increasing" rules, start with the cell that has the most rules on it. Here the center is larger than three cells and smaller than three others, so it has only three possible values. Fixing it splits the other digits into a small group and a big group, and each group can be counted on its own. Flipping the grid over its diagonal is a quick way to reuse a count you already did.

Alternative approach

There is a known formula for counting such grids, called the hook length formula (it goes beyond the usual school topics). For each cell, count the cells directly to its right, the cells directly below it, and the cell itself:

554433
443322
332211

The number of grids is 9!9! divided by the product of these numbers:
3628805⋅4⋅3⋅4⋅3⋅2⋅3⋅2⋅1=3628808640=42.\frac{362880}{5 \cdot 4 \cdot 3 \cdot 4 \cdot 3 \cdot 2 \cdot 3 \cdot 2 \cdot 1} = \frac{362880}{8640} = 42.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Write the cell in row ii, column jj as (i,j)(i,j). Clearly 11 is at (1,1)(1,1) and 99 at (3,3)(3,3). The center (2,2)(2,2) exceeds (1,1),(1,2),(2,1)(1,1), (1,2), (2,1) and is below (2,3),(3,2),(3,3)(2,3), (3,2), (3,3), so the center is 44, 55, or 66.

Center 44. Then {2,3}\{2, 3\} fill (1,2)(1,2) and (2,1)(2,1) in 22 ways. The digits 5,6,7,85, 6, 7, 8 go to (1,3),(2,3),(3,1),(3,2)(1,3), (2,3), (3,1), (3,2) with only the constraints (1,3)<(2,3)(1,3) < (2,3) and (3,1)<(3,2)(3,1) < (3,2): choose which two digits go to the top-right pair, (42)=6\binom42 = 6 ways. Total 2⋅6=122 \cdot 6 = 12.

Center 66. Replacing each entry xx by 10−x10 - x and rotating 180∘180^\circ swaps this case with center 44: also 1212.

Center 55. Three of {2,3,4}\{2,3,4\} must fill (1,2),(2,1)(1,2), (2,1) and one of the corners (1,3)(1,3) or (3,1)(3,1); the other corner gets a digit from {6,7,8}\{6,7,8\}. Say (1,3)<5(1,3) < 5: then (2,1)(2,1) can be any of 2,3,42, 3, 4 (33 ways) and the other two fill row 11 in increasing order. The digits 6,7,86, 7, 8 go to (2,3),(3,1),(3,2)(2,3), (3,1), (3,2) with (3,1)<(3,2)(3,1) < (3,2): choose the digit for (2,3)(2,3), 33 ways. That is 99 arrays; by the transpose symmetry, (3,1)<5(3,1) < 5 gives 99 more. Total 1818.

Altogether 12+18+12=4212 + 18 + 12 = 42.

The answer is (D) 42\boxed{\textbf{(D)}\ 42}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.