Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2022 AMC 12B Problems/Problem 17"

(→‎Problem)
Line 18: Line 18:
  
 
satisfies the condition.
 
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 <math>i \in \left\{ 1, 2, 3 ,4 \right\}</math>, the sum of entries in row <math>i</math> is <math>i</math> and the sum of entries in column <math>i</math> is <math>i</math>, hereafter called as a benchmark matrix.
 +
 +
Second, we observe that there is a unique benchmark matrix, as shown below:
 +
<cmath>
 +
\[
 +
\left[
 +
  \begin{array}{cccc}
 +
    0 & 0 & 0 & 1 \\
 +
    0 & 0 & 1 & 1 \\
 +
    0 & 1 & 1 & 1 \\
 +
    1 & 1 & 1 & 1 \\
 +
  \end{array}
 +
\right]
 +
\]
 +
</cmath>
 +
 +
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 <math>4!</math>.
 +
 +
Step 2: We make a permutation of columns of the matrix obtained after Step 1.
 +
 +
The number of ways is <math>4!</math>.
 +
 +
Following from the rule of product, the total number of feasible matrixes is <math>4! \cdot 4! =
 +
\boxed{\textbf{(D) 576}}</math>.
 +
 +
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
  
 
==Solution==
 
==Solution==
Line 30: Line 68:
  
 
-fidgetboss_4000
 
-fidgetboss_4000
 +
 +
==Video Solution==
 +
 +
https://youtu.be/_dN_ZHiaiko
 +
 +
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)

Revision as of 14:30, 17 November 2022

Problem

How many $4 \times 4$ arrays whose entries are 0s and 1s 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 \[ \left[ \begin{array}{cccc} 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 0 \\ 1 & 1 & 1 & 1 \\ 0 & 1 & 0 & 0 \\ \end{array} \right] \]

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 $i \in \left\{ 1, 2, 3 ,4 \right\}$, the sum of entries in row $i$ is $i$ and the sum of entries in column $i$ is $i$, hereafter called as a benchmark matrix.

Second, we observe that there is a unique benchmark matrix, as shown below: \[ \left[ \begin{array}{cccc} 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 1 \\ 0 & 1 & 1 & 1 \\ 1 & 1 & 1 & 1 \\ \end{array} \right] \]

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 $4!$.

Step 2: We make a permutation of columns of the matrix obtained after Step 1.

The number of ways is $4!$.

Following from the rule of product, the total number of feasible matrixes is $4! \cdot 4! = \boxed{\textbf{(D) 576}}$.

~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)

Solution

Let $S(n)$ be the number of paths of $n$ moves such that the bug never will have been more than $1$ unit away from the starting position. Clearly, by symmetry, there are two possible states here, the bug being on the center and the bug being on one of the vertices of the unit hexagon around the center. Let $C(n)$ be the number of paths with the aforementioned restriction that end on the center. Let $V(n)$ be the number of paths with the aforementioned restriction that end on a vertex of the surrounding unit hexagon. We have $S(n) = 6C(n-1) + 3V(n-1),$ since from the center, there are $6$ possible points to land to and from a vertex there are $3$ possible points to land to (the two adjacent vertices and the center). We also have $C(n) = V(n-1)$, since to get to the center the bug must have come from a vertex, and $V(n) = 2V(n-1) + 6C(n-1),$ since from a vertex there are two vertices to move to, and from the center there are $6$ vertices to move to. We can construct a recursion table using the base cases $V(1) = 6$ and $C(1) = 0$ and our recursive rules for $C(n)$ and $V(n)$ as follows: \[\begin{tabular}{c|c|c} n & V(n) & C(n) \\ \hline 1 & 6 & 0 \\ 2 & 12 & 6 \\ 3 & 60 & 12 \\ 4 & 192 & 60 \\ \end{tabular}\] Then, $S(5) = 6C(4) + 3V(4) = 6 \cdot 60 + 3 \cdot 192 = 936,$ and the desired probability is thus $\frac{936}{6^5} = \boxed{\frac{13}{108}}.$

-fidgetboss_4000

Video Solution

https://youtu.be/_dN_ZHiaiko

~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2022_AMC_12B_Problems/Problem_17&oldid=181872"