|
|
| (8 intermediate revisions by 4 users not shown) |
| Line 1: |
Line 1: |
| − | ==Problem==
| + | #redirect [[2010 AMC 12B Problems/Problem 17]] |
| − | | |
| − | The entries in a <math>3 \times 3</math> array include all the digits from 1 through 9, arranged so that the entries in every row and column are in increasing order. How many such arrays are there?
| |
| − | | |
| − | <math> \textbf{(A)}\ 18\qquad\textbf{(B)}\ 24 \qquad\textbf{(C)}\ 36\qquad\textbf{(D)}\ 42\qquad\textbf{(E)}\ 60 </math>
| |
| − | | |
| − | ==Notes==
| |
| − | In fact, there is a general formula (coming from the fields of [[combinatorics]] and [[representation theory]]) to answer problems of this form; it is known as the [http://en.wikipedia.org/wiki/Young_tableau#Dimension_of_a_representation hook-length formula].
| |
| − | | |
| − | == See also ==
| |
| − | {{AMC10 box|year=2010|ab=B|num-b=22|num-a=24}}
| |
| − | {{MAA Notice}}
| |
