1997 AIME Problems/Problem 8
From AoPSWiki
Problem
How many different 
arrays whose entries are all 1's and -1's have the property that the sum of the entries in each row is 0 and the sum of the entires in each column is 0?
Contents |
Solution
Solution 1
- For more detailed explanations, see related problem (AIME I 2007, 10).
The problem is asking us for all configurations of grids with 2 1's and 2 -1's in each row and column. We do casework upon the first two columns:
- The first two columns share no two numbers in the same row. There are
ways to pick two 1's in the first column, and the second column is determined. For the third and fourth columns, no two numbers can be in the same row (to make the sum of each row 0), so again there are 
ways. This gives 
.
- The first two columns share one number in the same row. There are
ways to pick the position of the shared 1, then 
ways to pick the locations for the next two 1s, and then 
ways to orient the 1s. For the third and fourth columns, the two rows with shared 1s or -1s are fixed, so the only things that can be changed is the orientation of the mixed rows, in ways. This gives 
.
- The first two columns share two numbers in th same row. There are
ways to pick the position of the shared 1s. Everything is then fixed.
Adding these cases up, we get 
.
See also
- 2007 AIME I Problems/Problem 10 - the same problem, but with a
| 1997 AIME (Problems • Resources) | ||
| Preceded by Problem 7 | Followed by Problem 9 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
