Difference between revisions of "2022 AMC 12B Problems/Problem 17"
(→Problem) |
Mathboy100 (talk | contribs) (→Alternate Solution (From outside to inside)) |
||
Line 62: | Line 62: | ||
Since exactly <math>1</math> row sum is <math>4</math> and exactly <math>1</math> column sum is <math>4</math>, there is a unique entry in the array such that it, and every other entry in the same row or column, is a <math>1.</math> Since there are <math>16</math> total entries in the array, there are <math>16</math> ways to choose the entry with only <math>1</math>s in its row and column. | Since exactly <math>1</math> row sum is <math>4</math> and exactly <math>1</math> column sum is <math>4</math>, there is a unique entry in the array such that it, and every other entry in the same row or column, is a <math>1.</math> Since there are <math>16</math> total entries in the array, there are <math>16</math> ways to choose the entry with only <math>1</math>s in its row and column. | ||
− | WLOG, let that entry be in the top-left corner of the square. Note that there is already <math>1</math> entry numbered <math>1</math> in each unfilled row, and <math>1</math> entry numbered <math>1</math> in each unfilled column. Since exactly <math>1</math> row sum is <math>1</math> and exactly <math>1</math> column sum is <math>1</math>, there is a unique entry in the <math>3 | + | WLOG, let that entry be in the top-left corner of the square. Note that there is already <math>1</math> entry numbered <math>1</math> in each unfilled row, and <math>1</math> entry numbered <math>1</math> in each unfilled column. Since exactly <math>1</math> row sum is <math>1</math> and exactly <math>1</math> column sum is <math>1</math>, there is a unique entry in the <math>3\textrm{x}3</math> array of the empty squares such that it, and every other entry in the same row or column in the <math>3\textrm{x}3</math> array is a <math>0.</math> Using a process similar to what we used in the first paragraph, we can see that there are <math>9</math> ways to choose the entry with only <math>0</math> in its row and column (in the <math>3\textrm{x}3</math> array). |
− | WLOG, let that entry be in the bottom right corner of the square. Then, the remaining empty squares are the <math>4</math> center squares. Of these, one of the columns of the empty <math>2 | + | WLOG, let that entry be in the bottom right corner of the square. Then, the remaining empty squares are the <math>4</math> center squares. Of these, one of the columns of the empty <math>2\textrm{x}2</math> array will have <math>2</math> <math>1</math>s and the other column will have <math>1</math> <math>1.</math> That happens if and only if exactly <math>1</math> of the remaining squares is filled with a <math>0</math>, and there are <math>4</math> ways to choose that square. Filling that square with a <math>0</math> and the other <math>3</math> squares with <math>1</math>s completes the grid. |
All in all, there are <math>4*9*16=\boxed{576}</math> ways to complete the grid. | All in all, there are <math>4*9*16=\boxed{576}</math> ways to complete the grid. | ||
pianoboy. | pianoboy. | ||
+ | ~mathboy100 (minor LaTeX fix) | ||
+ | |||
==Video Solution== | ==Video Solution== | ||
Revision as of 13:52, 20 November 2022
Contents
Problem
How many arrays whose entries are
s and
s are there such that the row sums (the sum of the
entries in each row) are 1, 2, 3, and 4, in some order, and the column sums (the sum of the entries in
each column) are also 1, 2, 3, and 4, in some order? For example, the array
satisfies the condition.
Solution (Linear transformation, permutation)
In this problem, we call a matrix that satisfies all constraints given in the problem a feasible matrix.
First, we observe that if a matrix is feasible, and we swap two rows or two columns to get a new matrix, then this new matrix is still feasible.
Therefore, any feasible matrix can be obtained through a sequence of such swapping operations from a feasible matrix where for all , the sum of entries in row
is
and the sum of entries in column
is
, hereafter called as a benchmark matrix.
Second, we observe that there is a unique benchmark matrix, as shown below:
With above observations, we now count the number of feasible matrixes. We construct a feasible matrix in the following steps.
Step 1: We make a permutation of rows of the benchmark matrix.
The number of ways is .
Step 2: We make a permutation of columns of the matrix obtained after Step 1.
The number of ways is .
Following from the rule of product, the total number of feasible matrixes is .
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
Alternate Solution (From outside to inside)
Since exactly row sum is
and exactly
column sum is
, there is a unique entry in the array such that it, and every other entry in the same row or column, is a
Since there are
total entries in the array, there are
ways to choose the entry with only
s in its row and column.
WLOG, let that entry be in the top-left corner of the square. Note that there is already entry numbered
in each unfilled row, and
entry numbered
in each unfilled column. Since exactly
row sum is
and exactly
column sum is
, there is a unique entry in the
array of the empty squares such that it, and every other entry in the same row or column in the
array is a
Using a process similar to what we used in the first paragraph, we can see that there are
ways to choose the entry with only
in its row and column (in the
array).
WLOG, let that entry be in the bottom right corner of the square. Then, the remaining empty squares are the center squares. Of these, one of the columns of the empty
array will have
s and the other column will have
That happens if and only if exactly
of the remaining squares is filled with a
, and there are
ways to choose that square. Filling that square with a
and the other
squares with
s completes the grid.
All in all, there are ways to complete the grid.
pianoboy. ~mathboy100 (minor LaTeX fix)
Video Solution
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
See Also
2022 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.