Difference between revisions of "2010 AMC 12B Problems/Problem 17"
({{solution}}) |
|||
| Line 1: | Line 1: | ||
| − | == Problem | + | {{solution}} |
| + | == Problem == | ||
The entries in a <math>3 \times 3</math> array include all the digits from <math>1</math> through <math>9</math>, arranged so that the entries in every row and column are in increasing order. How many such arrays are there? | The entries in a <math>3 \times 3</math> array include all the digits from <math>1</math> through <math>9</math>, arranged so that the entries in every row and column are in increasing order. How many such arrays are there? | ||
Revision as of 13:59, 31 May 2011
This problem needs a solution. If you have a solution for it, please help us out by adding it.
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
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 | |
