Difference between revisions of "2010 AMC 12B Problems/Problem 17"
(→Solution 1) |
|||
| Line 6: | Line 6: | ||
== Solution 1 == | == Solution 1 == | ||
First, making a chart of ranges of numbers that can exist in each square, observe that all tableaus must have 1s and 9s in the corners, 8s and 2s next to those corner squares, and the middle square having either of 4-6. Also note that each tableau has a valid symmetrical tableau across the top left square to the bottom right square diagonal. Then, the number of charts is double the following cases. | First, making a chart of ranges of numbers that can exist in each square, observe that all tableaus must have 1s and 9s in the corners, 8s and 2s next to those corner squares, and the middle square having either of 4-6. Also note that each tableau has a valid symmetrical tableau across the top left square to the bottom right square diagonal. Then, the number of charts is double the following cases. | ||
| + | |||
*'''Case 1: Center 4''' | *'''Case 1: Center 4''' | ||
| − | With 4 in center, 3 necessarily must be placed <math>\begin{tabular}{|c|c|c|} \hline 1&2&\\ | + | With 4 in center, 3 necessarily must be placed |
| + | |||
| + | <math>\begin{tabular}{|c|c|c|} \hline 1&2&\\ | ||
\hline 3&4&8\\ | \hline 3&4&8\\ | ||
\hline &&9\\ | \hline &&9\\ | ||
| Line 14: | Line 17: | ||
\hline 3&4&\\ | \hline 3&4&\\ | ||
\hline &8&9\\ | \hline &8&9\\ | ||
| − | \hline \end{tabular}</math> | + | \hline \end{tabular}</math>. |
| − | Any number could | + | Any number could fill the isolated square, but the other 2 are then invariant in the remaining slots. Then, there are 3 cases per tableau template and 6 overall cases. Given diagonal symmetry, alternate 2 and 8 placements yield symmetrical cases. <math>2*6=12</math> |
*'''Case 2: Center 5''' | *'''Case 2: Center 5''' | ||
| − | + | Here, no 3s or 7s are assured, but this is only a teensy bit trickier and messier. One more level of casework. | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
<math>\begin{tabular}{|c|c|c|} \hline 1&2&3\\ | <math>\begin{tabular}{|c|c|c|} \hline 1&2&3\\ | ||
| Line 41: | Line 38: | ||
\hline \end{tabular}</math> | \hline \end{tabular}</math> | ||
| − | Remembering that 4 | + | Remembering that <math>4<5</math> and <math>6,7>5</math>, logically see that the numbers of cases are then 2,3,3,1 respectively. By symmetry, <math>2*9=18</math> |
*'''Case 3: Center 6''' | *'''Case 3: Center 6''' | ||
| Line 52: | Line 49: | ||
| − | P.S.: I like the tetris approach used in 2 but found it a bit arbitrary. Solution 3 is the best, but not many would know hook length theorem. | + | P.S.: I like the tetris approach used in 2 but found it a bit arbitrary. Solution 3 is the best, but not many would know hook length theorem. |
| − | |||
== Solution 2== | == Solution 2== | ||
Revision as of 15:35, 28 December 2019
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
First, making a chart of ranges of numbers that can exist in each square, observe that all tableaus must have 1s and 9s in the corners, 8s and 2s next to those corner squares, and the middle square having either of 4-6. Also note that each tableau has a valid symmetrical tableau across the top left square to the bottom right square diagonal. Then, the number of charts is double the following cases.
- Case 1: Center 4
With 4 in center, 3 necessarily must be placed
and 
.
Any number could fill the isolated square, but the other 2 are then invariant in the remaining slots. Then, there are 3 cases per tableau template 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. One more level of casework.
Remembering that 
and 
, 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.
Then, 
~BJHHar
P.S.: I like the tetris approach used in 2 but found it a bit arbitrary. Solution 3 is the best, but not many would know hook length theorem.
Solution 2
The first 4 numbers will form one of 3 tetris "shapes".
First, let's look at the numbers that form a 
block, sometimes called tetris 
:
Second, let's look at the numbers that form a vertical "L", sometimes called tetris 
:
Third, let's look at the numbers that form a horizontal "L", sometimes called tetris 
:
Now, the numbers 6-9 will form similar shapes (rotated by 180 degrees, and anchored in the lower-right corner of the 3x3 grid).
If you match up one tetris shape from the numbers 1-4 and one tetris shape from the numbers 6-9, there is only one place left for the number 5 to be placed.
So what shapes will physically fit in the 3x3 grid, together?
The answer is 
.
Solution 3
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.
See also
| 2010 AMC 12B (Problems • Answer Key • Resources) | |
| Preceded by Problem 16 |
Followed by Problem 18 |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
| All AMC 12 Problems and Solutions | |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
