2010 AMC 12B Problems/Problem 17

The following problem is from both the 2010 AMC 12B #17 and 2010 AMC 10B #23, so both problems redirect to this page.

Problem

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

Solution 1

Observe that all tables must have 1s and 9s in the corners, 8s and 2s next to those corner squares, and 4-6 in the middle square. Also note that for each table, there exists a valid table diagonally symmetrical across the diagonal extending from the top left to the bottom right.

• Case 1: Center 4

3 necessarily must be placed as above. Any number could fill the isolated square, but the other 2 are then invariant. So, there are 3 cases each and 6 overall cases. Given diagonal symmetry, alternate 2 and 8 placements yield symmetrical cases.

• Case 2: Center 5

Here, no 3s or 7s are assured, but this is only a teensy bit trickier and messier. WLOG, casework with 3 instead of 7 as above. Remembering that , logically see that the numbers of cases are then 2,3,3,1 respectively. By symmetry,

• Case 3: Center 6

By inspection, realize that this is symmetrical to case 1 except that the 7s instead of the 3s are assured.

~BJHHar

Solution 2

This solution is trivial by the hook length theorem. The hooks look like this:

So, the answer is =

P.S. The hook length formula is a formula to calculate the number of standard Young tableaux of a Young diagram. Numberphile has an easy-to-understand video about it here: https://www.youtube.com/watch?v=vgZhrEs4tuk The full proof is quite complicated and is not given in the video, although the video hints at possible proofs.

Hook length theorem: take any shape made out of congruent squares and say the rules are just like the problem described. Now if you count how many squares are to the right and to the down of it, INCLUDING THE NUMBER ITSELF, then multiply the numbers that have been written down, that is the denominator of the fraction. The numerator is simpler: the factorial of the number of squares. Ex:

Therefore answer will be 6!/(4 * 3 * 3 * 2 * 2)

~edits by glowworm

Solution 3 (Doesn't require the hook length formula, similar to Solution 1)

1 and 9 must go on top left and top right Middle must be 4, 5, or 6 because there must be two numbers less than it to fill top middle and left middle squares (so 2, 3 dont work) or 2 more (until 9, so 7 and 8 don’t work) For middle is 5, the numbers 2, 3, and 4 will fill in spaces until the diagonal with 5, and either the top right or bottom left square will be left blank (no blanks before that because the box must increase). So there are 2 choices which one to leave blank. There are 3 choices for the box (either 2, 3, or 4) immediately next to the blank box and the other 2 numbers (from 2, 3, or 4) will sort themselves. Now there are 2 empty spaces in one horizontal or vertical row with 9, and 1 empty space in the middle of the other row with 9 and a value of 2, 3, or 4. Pick either 6, 7, or 8 to fil that box and the other row will sort itself with the remaining two numbers. Thus, there are 2x3x3=18 ways. For middle is 4, the numbers 2 and 3 must go in the middle top and the middle left boxes because those are the only boxes smaller than 4. For the rightmost row, choose 2 from 4 to fill in that row, and on the bottommost row the other two numbers will sort themselves. So there are 4C2 = 6. 6x2 = 12 For middle is 6, it is symmetric to the middle being 4 because 7 or 8 must be in the middle bottom or middle right. Then 4C2 for one of the symmetric other part of the row with 9, and then the numbers wil sort themselves. 6x2 = 12 18+12+12=42

Video Solution by Pi Academy (Fast and Easy)

https://youtu.be/3gwxQ1fjxQM?si=oL0HxnoYSgyl1Rh6

~ Pi Academy

Video Solution 2

https://youtu.be/ZfnxbpdFKjU?t=422

~IceMatrix

See also

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.