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 10B Problems/Problem 18"

(→‎Solution 1 (Casework))
 
(16 intermediate revisions by 6 users not shown)
Line 24: Line 24:
 
   <li><math>M_1=M_2=M_3.</math></li><p>
 
   <li><math>M_1=M_2=M_3.</math></li><p>
 
There are <math>2^3=8</math> options for <math>M_1.</math> Once <math>M_1</math> is chosen, <math>M_2</math> and <math>M_3</math> are uniquely determined. <p>
 
There are <math>2^3=8</math> options for <math>M_1.</math> Once <math>M_1</math> is chosen, <math>M_2</math> and <math>M_3</math> are uniquely determined. <p>
−
<b>In this case, we have <math>\boldsymbol{2^3=8}</math> ordered triples <math>\boldsymbol{(M_1,M_2,M_3).}</math></b><p>  
+
<b>In this case, we have <math>\boldsymbol{8}</math> ordered triples <math>\boldsymbol{(M_1,M_2,M_3).}</math></b><p>  
 
   <li>Exactly two of <math>M_1,M_2,</math> and <math>M_3</math> are equal.</li><p>
 
   <li>Exactly two of <math>M_1,M_2,</math> and <math>M_3</math> are equal.</li><p>
 
For <math>M_1=M_2\neq M_3,</math> there are <math>2^3=8</math> options for <math>M_1.</math> Once <math>M_1</math> is chosen, <math>M_2</math> is uniquely determined, and <math>M_3</math> has <math>2^3-1=7</math> options. So, there are <math>8\cdot7=56</math> ordered triples <math>(M_1,M_2,M_3).</math><p>
 
For <math>M_1=M_2\neq M_3,</math> there are <math>2^3=8</math> options for <math>M_1.</math> Once <math>M_1</math> is chosen, <math>M_2</math> is uniquely determined, and <math>M_3</math> has <math>2^3-1=7</math> options. So, there are <math>8\cdot7=56</math> ordered triples <math>(M_1,M_2,M_3).</math><p>
Line 37: Line 37:
 
<b>In this subcase, we have <math>\boldsymbol{42\cdot3=126}</math> ordered triples <math>\boldsymbol{(M_1,M_2,M_3).}</math></b><p>
 
<b>In this subcase, we have <math>\boldsymbol{42\cdot3=126}</math> ordered triples <math>\boldsymbol{(M_1,M_2,M_3).}</math></b><p>
 
       <li>The sum of two of <math>M_1,M_2,</math> and <math>M_3</math> is equal to the third matrix.</li><p>
 
       <li>The sum of two of <math>M_1,M_2,</math> and <math>M_3</math> is equal to the third matrix.</li><p>
−
XXX
+
For <math>M_1+M_2=M_3:</math>
 +
<ul style="list-style-type:square;">
 +
  <li>If <math>M_1=\begin{bmatrix}1 & 0 & 0\end{bmatrix},</math> then <math>M_2\in\{\begin{bmatrix}0 & 1 & 1\end{bmatrix},\begin{bmatrix}0 & 1 & 0\end{bmatrix},\begin{bmatrix}0 & 0 & 1\end{bmatrix}\}.</math></li><p>
 +
More generally, if <math>M_1</math> consists of one <math>1</math> and two <math>0</math>'s, then <math>M_2</math> has <math>3</math> options, and <math>M_3</math> is uniquely determined. So, there are <math>\binom31\cdot3=9</math> ordered triples <math>(M_1,M_2,M_3).</math><p>
 +
  <li>If <math>M_1=\begin{bmatrix}1 & 1 & 0\end{bmatrix},</math> then <math>M_2=\begin{bmatrix}0 & 0 & 1\end{bmatrix}.</math></li><p>
 +
More generally, if <math>M_1</math> consists of two <math>1</math>'s and one <math>0,</math> then <math>M_2</math> and <math>M_3</math> are uniquely determined. So, there are <math>\binom32=3</math> ordered triples <math>(M_1,M_2,M_3).</math>
 +
</ul><p>
 +
There are <math>9+3=12</math> ordered triples <math>(M_1,M_2,M_3).</math> <p>
 +
Similarly, for each of <math>M_1+M_3=M_2</math> and <math>M_2+M_3=M_1,</math> there are <math>12</math> ordered triples <math>(M_1,M_2,M_3).</math><p>
 +
<b>In this subcase, we have <math>\boldsymbol{12\cdot3=36}</math> ordered triples <math>\boldsymbol{(M_1,M_2,M_3).}</math></b><p>
 
     </ol>
 
     </ol>
 
</ol>
 
</ol>
Line 70: Line 79:
 
<math>8^3 = 512</math> total systems. Note that no two equations by themselves can force <math>x = y = z = 0</math>. Therefore no system with Equation 1 or with repeated equations can force <math>x = y = z = 0</math>.
 
<math>8^3 = 512</math> total systems. Note that no two equations by themselves can force <math>x = y = z = 0</math>. Therefore no system with Equation 1 or with repeated equations can force <math>x = y = z = 0</math>.
  
−
<math>\textbf{Case 1:}</math> Equation 8 (<math>x + y + z = 0</math>) is present.
+
'''Case 1:''' Equation 8 (<math>x + y + z = 0</math>) is present.
  
−
Case <math>1^a</math>: Equation 8, and two equations from <math>\{5, 6, 7\}</math>.
+
Case 1a: Equation 8, and two equations from <math>\{5, 6, 7\}</math>.
  
 
There are <math>\binom{3}{2} = 3</math> ways to choose two equations from <math>\{5, 6, 7\}</math> and <math>3! = 6</math> ways to arrange each case. The number of options that force <math>x = y = z = 0</math> is <math>3 \cdot 3! = 18</math>.
 
There are <math>\binom{3}{2} = 3</math> ways to choose two equations from <math>\{5, 6, 7\}</math> and <math>3! = 6</math> ways to arrange each case. The number of options that force <math>x = y = z = 0</math> is <math>3 \cdot 3! = 18</math>.
  
−
Case <math>1^b</math>: Equation 8, one equation from <math>\{5, 6, 7\}</math>, and one equation from <math>\{2, 3, 4\}</math>.
+
Case 1b: Equation 8, one equation from <math>\{5, 6, 7\}</math>, and one equation from <math>\{2, 3, 4\}</math>.
  
 
There are <math>\binom{3}{1} = 3</math> ways to choose one equation from <math>\{5, 6, 7\}</math>. WLOG let us choose Equation 7. Given <math>x + y + z = 0</math> and <math>y + z = 0</math>, we conclude that <math>x = 0</math>. The third equation can be either <math>y = 0</math> or <math>z = 0</math>. There are <math>3!</math> ways to arrange each case. The number of options that force <math>x = y = z = 0</math> is <math>3 \cdot 2 \cdot 3! = 36</math>.
 
There are <math>\binom{3}{1} = 3</math> ways to choose one equation from <math>\{5, 6, 7\}</math>. WLOG let us choose Equation 7. Given <math>x + y + z = 0</math> and <math>y + z = 0</math>, we conclude that <math>x = 0</math>. The third equation can be either <math>y = 0</math> or <math>z = 0</math>. There are <math>3!</math> ways to arrange each case. The number of options that force <math>x = y = z = 0</math> is <math>3 \cdot 2 \cdot 3! = 36</math>.
  
−
Case <math>1^c</math>: Equation 8, and two equations from <math>\{2, 3, 4\}</math>.
+
Case 1c: Equation 8, and two equations from <math>\{2, 3, 4\}</math>.
  
 
There are <math>\binom{3}{2} = 3</math> ways to choose two equations from <math>\{2, 3, 4\}</math> and <math>3! = 6</math> ways to arrange each case. Each of these cases forces <math>x = y = z = 0</math>. <math>3 \cdot 3! = 18</math> total options.
 
There are <math>\binom{3}{2} = 3</math> ways to choose two equations from <math>\{2, 3, 4\}</math> and <math>3! = 6</math> ways to arrange each case. Each of these cases forces <math>x = y = z = 0</math>. <math>3 \cdot 3! = 18</math> total options.
  
−
<math>\textbf{Case 2:}</math> Equation 8 is <math>\textbf{not}</math> present, at least one equation from <math>\{5, 6, 7\}</math> is present.
+
'''Case 2:''' Equation 8 is <math>\textbf{not}</math> present, at least one equation from <math>\{5, 6, 7\}</math> is present.
  
−
Case <math>2^a</math>: Equations <math>\{5, 6, 7\}</math> are all present.
+
Case 2a: Equations <math>\{5, 6, 7\}</math> are all present.
  
 
There are <math>3!</math> ways to arrange the three equations. <math>6</math> options.
 
There are <math>3!</math> ways to arrange the three equations. <math>6</math> options.
  
−
Case <math>2^b</math>: Two equations from <math>\{5, 6, 7\}</math> are present. One equation from <math>\{2, 3, 4\}</math> is present.
+
Case 2b: Two equations from <math>\{5, 6, 7\}</math> are present. One equation from <math>\{2, 3, 4\}</math> is present.
  
 
There are <math>\binom{3}{2}</math> ways to choose two equations from <math>\{5, 6, 7\}</math>. WLOG let Equations 5 and 6 be in our system: <math>x + y = 0</math> and <math>x + z = 0</math>. Any equation from <math>\{2, 3, 4\}</math> will force <math>x = y = z = 0</math>. There are <math>3!</math> ways to arrange the equations. The number of options that force <math>x = y = z = 0</math> is <math>\binom{3}{2} \cdot \binom{3}{1} \cdot 3! = 54</math>.
 
There are <math>\binom{3}{2}</math> ways to choose two equations from <math>\{5, 6, 7\}</math>. WLOG let Equations 5 and 6 be in our system: <math>x + y = 0</math> and <math>x + z = 0</math>. Any equation from <math>\{2, 3, 4\}</math> will force <math>x = y = z = 0</math>. There are <math>3!</math> ways to arrange the equations. The number of options that force <math>x = y = z = 0</math> is <math>\binom{3}{2} \cdot \binom{3}{1} \cdot 3! = 54</math>.
  
−
Case <math>2^c</math>: One equation from <math>\{5, 6, 7\}</math> is present. Two equations from <math>\{2, 3, 4\}</math> are present.
+
Case 2c: One equation from <math>\{5, 6, 7\}</math> is present. Two equations from <math>\{2, 3, 4\}</math> are present.
  
 
There are <math>\binom{3}{1}</math> ways to choose one equation from <math>\{5, 6, 7\}</math>. WLOG let Equation 5 (<math>x + y = 0</math>) be present. One of the two equations from <math>\{2, 3, 4\}</math> must be Equation 4, <math>z = 0</math>, since it is the only equation that restricts <math>z</math>. The last equation can be either 2 or 3. There are <math>3!</math> ways to arrange the equations. The number of options that force <math>x = y = z = 0</math> is <math>\binom{3}{1} \cdot \binom{2}{1} \cdot 3! = 36</math>.
 
There are <math>\binom{3}{1}</math> ways to choose one equation from <math>\{5, 6, 7\}</math>. WLOG let Equation 5 (<math>x + y = 0</math>) be present. One of the two equations from <math>\{2, 3, 4\}</math> must be Equation 4, <math>z = 0</math>, since it is the only equation that restricts <math>z</math>. The last equation can be either 2 or 3. There are <math>3!</math> ways to arrange the equations. The number of options that force <math>x = y = z = 0</math> is <math>\binom{3}{1} \cdot \binom{2}{1} \cdot 3! = 36</math>.
  
−
<math>\textbf{Case 3:}</math> Only equations <math>\{2, 3, 4\}</math> are present.
+
'''Case 3:''' Only equations <math>\{2, 3, 4\}</math> are present.
  
 
There are <math>3!</math> ways to arrange the three equations. <math>6</math> options.
 
There are <math>3!</math> ways to arrange the three equations. <math>6</math> options.
Line 106: Line 115:
 
~numerophile
 
~numerophile
  
−
==Solution 3 (Complementary Counting, Linear Dependence, Vector Analysis)==
+
==Solution 3 (Complementary Counting)==
 +
 
 +
The total number of possible systems is <math>2^9 = 512</math>, with <math>8</math> possible sets of coefficients per equation. We will use complementary counting to find the number of systems which only have the solution <math>(0, 0, 0)</math> and subtract that from the total. Similar to what is observed in Solution 2, if any equation is repeated or <math>0x + 0y + 0z = 0</math>, there will only be two or fewer equations for three variables, making one unique solution impossible. Therefore, we must choose <math>3</math> different equations from <math>7</math> possible ones, giving <math>7 \cdot 6 \cdot 5 = 210</math> systems. However, there are two exceptions to consider, which will have more than one solution. The first is of the form <math>x + y + z = 0</math>, <math>x + y = 0</math>, <math>z = 0</math>; the second is of the form <math>x = 0</math>, <math>y = 0</math>, <math>x + y = 0</math>. In both cases, there are <math>3</math> ways to choose the variables in the equations, and then <math>6</math> ways to arrange them, giving <math>2 \cdot 3 \cdot 6 = 36</math> exceptions. Subtracting this gives <math>210 - 36 = 174</math> systems with only one solution, and the answer is then <math>512 - 174 = \boxed{\textbf{(B)}\ 338}</math>.
 +
 
 +
~phillipzeng
 +
 
 +
==Solution 4 (Complementary Counting, Linear Dependence, Vector Analysis)==
  
 
Denote vector <math>\overrightarrow{i} = \left( i_1, i_2, i_3 \right)^T</math> for <math>i \in \left\{ a, b, c \right\}</math>.
 
Denote vector <math>\overrightarrow{i} = \left( i_1, i_2, i_3 \right)^T</math> for <math>i \in \left\{ a, b, c \right\}</math>.
Line 179: Line 194:
 
\]
 
\]
 
</cmath>
 
</cmath>
−
 
 
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
 
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
  
Line 192: Line 206:
  
 
~ pi_is_3.14
 
~ pi_is_3.14
 +
==Video Solution by Interstigation==
 +
https://youtu.be/Z9qYTUEn3Ig
 +
 +
~Interstigation
  
 
== See Also ==
 
== See Also ==
 
{{AMC10 box|year=2022|ab=B|num-b=17|num-a=19}}
 
{{AMC10 box|year=2022|ab=B|num-b=17|num-a=19}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Latest revision as of 00:22, 24 September 2024

Problem

Consider systems of three linear equations with unknowns $x$, $y$, and $z$, \begin{align*} a_1 x + b_1 y + c_1 z & = 0 \\ a_2 x + b_2 y + c_2 z & = 0 \\ a_3 x + b_3 y + c_3 z & = 0 \end{align*} where each of the coefficients is either $0$ or $1$ and the system has a solution other than $x=y=z=0$. For example, one such system is \[\{ 1x + 1y + 0z = 0, 0x + 1y + 1z = 0, 0x + 0y + 0z = 0 \}\] with a nonzero solution of $\{x,y,z\} = \{1, -1, 1\}$. How many such systems of equations are there? (The equations in a system need not be distinct, and two systems containing the same equations in a different order are considered different.)

$\textbf{(A)}\ 302 \qquad\textbf{(B)}\ 338 \qquad\textbf{(C)}\ 340 \qquad\textbf{(D)}\ 343 \qquad\textbf{(E)}\ 344$

Solution 1 (Casework)

Let $M_1=\begin{bmatrix}a_1 & b_1 & c_1\end{bmatrix}, M_2=\begin{bmatrix}a_2 & b_2 & c_2\end{bmatrix},$ and $M_3=\begin{bmatrix}a_3 & b_3 & c_3\end{bmatrix}.$

We wish to count the ordered triples $(M_1,M_2,M_3)$ of row matrices. We perform casework:

  1. $M_1=M_2=M_3.$

    2. There are $2^3=8$ options for $M_1.$ Once $M_1$ is chosen, $M_2$ and $M_3$ are uniquely determined.

    In this case, we have $\boldsymbol{8}$ ordered triples $\boldsymbol{(M_1,M_2,M_3).}$

  2. Exactly two of $M_1,M_2,$ and $M_3$ are equal.

    3. For $M_1=M_2\neq M_3,$ there are $2^3=8$ options for $M_1.$ Once $M_1$ is chosen, $M_2$ is uniquely determined, and $M_3$ has $2^3-1=7$ options. So, there are $8\cdot7=56$ ordered triples $(M_1,M_2,M_3).$

    Similarly, for each of $M_1=M_3\neq M_2$ and $M_2=M_3\neq M_1,$ there are $56$ ordered triples $(M_1,M_2,M_3).$

    In this case, we have $\boldsymbol{56\cdot3=168}$ ordered triples $\boldsymbol{(M_1,M_2,M_3).}$

  3. All of $M_1,M_2,$ and $M_3$ are different.

    4. There are two subcases:

    1. Exactly one of $M_1,M_2,$ and $M_3$ is $\begin{bmatrix}0 & 0 & 0\end{bmatrix}.$

      2. For $M_1=\begin{bmatrix}0 & 0 & 0\end{bmatrix},$ there are $2^3-1=7$ options for $M_2$ and $2^3-2=6$ options for $M_3.$ So, there are $7\cdot6=42$ ordered triples $(M_1,M_2,M_3).$

      Similarly, for each of $M_2=\begin{bmatrix}0 & 0 & 0\end{bmatrix}$ and $M_3=\begin{bmatrix}0 & 0 & 0\end{bmatrix},$ there are $42$ ordered triples $(M_1,M_2,M_3).$

      In this subcase, we have $\boldsymbol{42\cdot3=126}$ ordered triples $\boldsymbol{(M_1,M_2,M_3).}$

    2. The sum of two of $M_1,M_2,$ and $M_3$ is equal to the third matrix.

      3. For $M_1+M_2=M_3:$

      • If $M_1=\begin{bmatrix}1 & 0 & 0\end{bmatrix},$ then $M_2\in\{\begin{bmatrix}0 & 1 & 1\end{bmatrix},\begin{bmatrix}0 & 1 & 0\end{bmatrix},\begin{bmatrix}0 & 0 & 1\end{bmatrix}\}.$

        • More generally, if $M_1$ consists of one $1$ and two $0$'s, then $M_2$ has $3$ options, and $M_3$ is uniquely determined. So, there are $\binom31\cdot3=9$ ordered triples $(M_1,M_2,M_3).$

      • If $M_1=\begin{bmatrix}1 & 1 & 0\end{bmatrix},$ then $M_2=\begin{bmatrix}0 & 0 & 1\end{bmatrix}.$

        • More generally, if $M_1$ consists of two $1$'s and one $0,$ then $M_2$ and $M_3$ are uniquely determined. So, there are $\binom32=3$ ordered triples $(M_1,M_2,M_3).$

      There are $9+3=12$ ordered triples $(M_1,M_2,M_3).$

      Similarly, for each of $M_1+M_3=M_2$ and $M_2+M_3=M_1,$ there are $12$ ordered triples $(M_1,M_2,M_3).$

      In this subcase, we have $\boldsymbol{12\cdot3=36}$ ordered triples $\boldsymbol{(M_1,M_2,M_3).}$

Together, the answer is $8+168+126+36=\boxed{\textbf{(B)}\ 338}.$

~MRENTHUSIASM

Solution 2 (Complementary Counting)

We will use complementary counting and do casework on the equations.

There are $8$ possible equations:

Equation 1: $0 = 0$

Equation 2: $x = 0$

Equation 3: $y = 0$

Equation 4: $z = 0$

Equation 5: $x + y = 0$

Equation 6: $x + z = 0$

Equation 7: $y + z = 0$

Equation 8: $x + y + z = 0$

We will continue to refer to the equations by their number on this list.

$8^3 = 512$ total systems. Note that no two equations by themselves can force $x = y = z = 0$. Therefore no system with Equation 1 or with repeated equations can force $x = y = z = 0$.

Case 1: Equation 8 ($x + y + z = 0$) is present.

Case 1a: Equation 8, and two equations from $\{5, 6, 7\}$.

There are $\binom{3}{2} = 3$ ways to choose two equations from $\{5, 6, 7\}$ and $3! = 6$ ways to arrange each case. The number of options that force $x = y = z = 0$ is $3 \cdot 3! = 18$.

Case 1b: Equation 8, one equation from $\{5, 6, 7\}$, and one equation from $\{2, 3, 4\}$.

There are $\binom{3}{1} = 3$ ways to choose one equation from $\{5, 6, 7\}$. WLOG let us choose Equation 7. Given $x + y + z = 0$ and $y + z = 0$, we conclude that $x = 0$. The third equation can be either $y = 0$ or $z = 0$. There are $3!$ ways to arrange each case. The number of options that force $x = y = z = 0$ is $3 \cdot 2 \cdot 3! = 36$.

Case 1c: Equation 8, and two equations from $\{2, 3, 4\}$.

There are $\binom{3}{2} = 3$ ways to choose two equations from $\{2, 3, 4\}$ and $3! = 6$ ways to arrange each case. Each of these cases forces $x = y = z = 0$. $3 \cdot 3! = 18$ total options.

Case 2: Equation 8 is $\textbf{not}$ present, at least one equation from $\{5, 6, 7\}$ is present.

Case 2a: Equations $\{5, 6, 7\}$ are all present.

There are $3!$ ways to arrange the three equations. $6$ options.

Case 2b: Two equations from $\{5, 6, 7\}$ are present. One equation from $\{2, 3, 4\}$ is present.

There are $\binom{3}{2}$ ways to choose two equations from $\{5, 6, 7\}$. WLOG let Equations 5 and 6 be in our system: $x + y = 0$ and $x + z = 0$. Any equation from $\{2, 3, 4\}$ will force $x = y = z = 0$. There are $3!$ ways to arrange the equations. The number of options that force $x = y = z = 0$ is $\binom{3}{2} \cdot \binom{3}{1} \cdot 3! = 54$.

Case 2c: One equation from $\{5, 6, 7\}$ is present. Two equations from $\{2, 3, 4\}$ are present.

There are $\binom{3}{1}$ ways to choose one equation from $\{5, 6, 7\}$. WLOG let Equation 5 ($x + y = 0$) be present. One of the two equations from $\{2, 3, 4\}$ must be Equation 4, $z = 0$, since it is the only equation that restricts $z$. The last equation can be either 2 or 3. There are $3!$ ways to arrange the equations. The number of options that force $x = y = z = 0$ is $\binom{3}{1} \cdot \binom{2}{1} \cdot 3! = 36$.

Case 3: Only equations $\{2, 3, 4\}$ are present.

There are $3!$ ways to arrange the three equations. $6$ options.

We add up the cases: $18 + 36 + 18 + 6 + 54 + 36 + 6 = 174$ total systems force $x = y = z = 0$. Thus $512 - 174 = \boxed{\textbf{(B)}\ 338}$ do not.

~numerophile

Solution 3 (Complementary Counting)

The total number of possible systems is $2^9 = 512$, with $8$ possible sets of coefficients per equation. We will use complementary counting to find the number of systems which only have the solution $(0, 0, 0)$ and subtract that from the total. Similar to what is observed in Solution 2, if any equation is repeated or $0x + 0y + 0z = 0$, there will only be two or fewer equations for three variables, making one unique solution impossible. Therefore, we must choose $3$ different equations from $7$ possible ones, giving $7 \cdot 6 \cdot 5 = 210$ systems. However, there are two exceptions to consider, which will have more than one solution. The first is of the form $x + y + z = 0$, $x + y = 0$, $z = 0$; the second is of the form $x = 0$, $y = 0$, $x + y = 0$. In both cases, there are $3$ ways to choose the variables in the equations, and then $6$ ways to arrange them, giving $2 \cdot 3 \cdot 6 = 36$ exceptions. Subtracting this gives $210 - 36 = 174$ systems with only one solution, and the answer is then $512 - 174 = \boxed{\textbf{(B)}\ 338}$.

~phillipzeng

Solution 4 (Complementary Counting, Linear Dependence, Vector Analysis)

Denote vector $\overrightarrow{i} = \left( i_1, i_2, i_3 \right)^T$ for $i \in \left\{ a, b, c \right\}$. Thus, we need to count how many vector tuples $\left( \overrightarrow{a} , \overrightarrow{b} , \overrightarrow{c} \right)$ are linearly dependent.

We do complementary counting.

First, the total number of vector tuples $\left( \overrightarrow{a} , \overrightarrow{b} , \overrightarrow{c} \right)$ is $\left( 2^3 \right)^3 = 512$.

Second, we count how many many vector tuples $\left( \overrightarrow{a} , \overrightarrow{b} , \overrightarrow{c} \right)$ are linearly independent.

To meet this condition, no vector can be a zero vector $\overrightarrow{0} = \left( 0, 0, 0 \right)^T$.

Next, we do the casework analysis.

Case $1^c$: Three vectors are all on axes.

In this case, the number of $\left( \overrightarrow{a} , \overrightarrow{b} , \overrightarrow{c} \right)$ is $3!$.

Case $2^c$: Two vectors are on axes and the third vector is not.

We construct such an instance in the following steps.

Step 1: We determine which two vectors lie on axes.

The number of ways is $3$.

Step 2: For two vectors selected in Step 1, we determine which two axes they lie on.

The number of ways is $3 \cdot 2$.

Step 3: For the third unselected vector, we determine its value.

To make three vectors linear independent, the third vector cannot be on the plane formed by the first two vectors. So the number of ways is $3$.

Following from the rule of product, the number of $\left( \overrightarrow{a} , \overrightarrow{b} , \overrightarrow{c} \right)$ in this case is $3 \cdot 3 \cdot 2 \cdot 3$.

Case $3^c$: One vector is on an axis and the other two are not.

We construct such an instance in the following steps.

Step 1: We determine which vector lies on an axis.

The number of ways is $3$.

Step 2: For the selected vector, we determine which axis it lies on.

The number of ways is $3$.

Step 3: We determine the values of the two unselected vectors.

First, to be linearly independent, these two vectors are distinct. Second, to be linearly independent, we cannot have one vector $(1,1,1)$ and another one that is a diagonal vector on the plane that is perpendicular to the first selected vector.

Thus, the number or ways in this step is $4 \cdot 3-2 = 10$.

Following from the rule of product, the number of $\left( \overrightarrow{a} , \overrightarrow{b} , \overrightarrow{c} \right)$ in this case is $3 \cdot 3 \cdot 10$.

Case $(4.4)^c$: No vector is on any axis.

In this case, any three distinct vectors are linearly independent. So the number of $\left( \overrightarrow{a} , \overrightarrow{b} , \overrightarrow{c} \right)$ in this case is $4 \cdot 3 \cdot 2$.

Putting all cases together, the number of vector tuples $\left( \overrightarrow{a} , \overrightarrow{b} , \overrightarrow{c} \right)$ that are linearly independent is \[ 8^3 - 3! - 3 \cdot 3 \cdot 2 \cdot 3 - 3 \cdot 3 \cdot 10 - 4 \cdot 3 \cdot 2 = \boxed{\textbf{(B)}\ 338}. \] ~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)

Video Solution

https://youtu.be/pDYFn26LND0

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

Video Solution by OmegaLearn Using Casework

https://youtu.be/caM35PDT0bM

~ pi_is_3.14

Video Solution by Interstigation

https://youtu.be/Z9qYTUEn3Ig

~Interstigation

See Also

2022 AMC 10B (Problems • Answer Key • Resources)
Preceded by
Problem 17 		Followed by
Problem 19
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 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2022_AMC_10B_Problems/Problem_18&oldid=227917"