## MATH1002 Quizzes

Quiz 6: Reduced row echelon form
Question 1 Questions
Which of the following matrices are in reduced row echelon form? (Zero or more options can be correct)
 a) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 3\hfill & \hfill 5\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]$ b) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 3\hfill & \hfill 0\hfill & \hfill 5\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]$ c) $\left[\begin{array}{cccc}\hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]$ d) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 3\hfill & \hfill 0\hfill & \hfill 5\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]$ e) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 9\hfill & \hfill -1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]$

There is at least one mistake.
For example, choice (a) should be False.
The leading 1 in row 2 is not the only non-zero entry in its column (column 3).
There is at least one mistake.
For example, choice (b) should be False.
The leading 1 in row 3 also has a non-zero in its column (column 4).
There is at least one mistake.
For example, choice (c) should be False.
This matrix contains a row of zeros with a non–zero row below it and, in addition, the leading 1 in row 4 has a non–zero entry in its column (column 4).
There is at least one mistake.
For example, choice (d) should be True.
The entries above and below each leading 1 are all zero.
There is at least one mistake.
For example, choice (e) should be False.
This matrix contains a row of zeros with a non–zero row below it.
Correct!
1. False The leading 1 in row 2 is not the only non-zero entry in its column (column 3).
2. False The leading 1 in row 3 also has a non-zero in its column (column 4).
3. False This matrix contains a row of zeros with a non–zero row below it and, in addition, the leading 1 in row 4 has a non–zero entry in its column (column 4).
4. True The entries above and below each leading 1 are all zero.
5. False This matrix contains a row of zeros with a non–zero row below it.
Which of the following matrices are in reduced row echelon form? (Zero or more options can be correct)
 a) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 4\hfill & \hfill 0\hfill & \hfill 5\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]$ b) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 4\hfill & \hfill -7\hfill & \hfill 5\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]$ c) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 4\hfill & \hfill 0\hfill & \hfill 5\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 7\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]$ d) $\left[\begin{array}{cccc}\hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]$

There is at least one mistake.
For example, choice (a) should be True.
This is in row echelon form and the entries above and below each leading 1 and in the same column all zero.
There is at least one mistake.
For example, choice (b) should be True.
This is in row echelon form and the entries above and below each leading 1 and in the same column all zero.
There is at least one mistake.
For example, choice (c) should be True.
This is in row echelon form and the entries above and below each leading 1 and in the same column all zero.
There is at least one mistake.
For example, choice (d) should be True.
This is in row echelon form and the entries above and below each leading 1 and in the same column all zero.
Correct!
1. True This is in row echelon form and the entries above and below each leading 1 and in the same column all zero.
2. True This is in row echelon form and the entries above and below each leading 1 and in the same column all zero.
3. True This is in row echelon form and the entries above and below each leading 1 and in the same column all zero.
4. True This is in row echelon form and the entries above and below each leading 1 and in the same column all zero.
Let $A=\left[\begin{array}{cccc}\hfill 2& \hfill 6& \hfill 1& \hfill -7\\ \hfill 1& \hfill 3& \hfill 1& \hfill -3\\ \hfill 1& \hfill 3& \hfill 4& \hfill 0\end{array}\right]$ Which of the following sequences of elementary row operations transforms $A$ into row echelon form? (More than one answer may be correct.) (Zero or more options can be correct)
 a) ${R}_{1}:={R}_{1}-{R}_{3}$, ${R}_{2}:={R}_{2}-{R}_{1}$, ${R}_{3}:={R}_{3}-{R}_{1}$ and ${R}_{2}:=\frac{1}{4}{R}_{2}$. b) ${R}_{1}↔{R}_{2}$, ${R}_{2}:={R}_{2}-2{R}_{1}$, ${R}_{3}:={R}_{3}-{R}_{1}$, ${R}_{2}:=-{R}_{2}$ and ${R}_{3}={R}_{3}-3{R}_{2}$. c) ${R}_{1}:=\frac{1}{2}{R}_{1}$, ${R}_{2}:={R}_{2}\phantom{\rule{0.3em}{0ex}}-\phantom{\rule{0.3em}{0ex}}{R}_{1}$, ${R}_{3}={R}_{3}\phantom{\rule{0.3em}{0ex}}-\phantom{\rule{0.3em}{0ex}}{R}_{1}$, ${R}_{3}:={R}_{3}\phantom{\rule{0.3em}{0ex}}-\phantom{\rule{0.3em}{0ex}}7{R}_{2}$ and ${R}_{2}:=2{R}_{2}$.

There is at least one mistake.
For example, choice (a) should be False.
This sequence of operations transforms $A$ into the matrix $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 3\hfill & \hfill -3\hfill & \hfill -7\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 7\hfill & \hfill 7\hfill \end{array}\right]$
There is at least one mistake.
For example, choice (b) should be True.
This sequence of operations transforms $A$ into the matrix $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 3\hfill & \hfill 1\hfill & \hfill -3\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]$
There is at least one mistake.
For example, choice (c) should be True.
This sequence of operations transforms $A$ into the matrix $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 3\hfill & \hfill \frac{1}{2}\hfill & \hfill -\frac{7}{2}\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right].$
Correct!
1. False This sequence of operations transforms $A$ into the matrix $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 3\hfill & \hfill -3\hfill & \hfill -7\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 7\hfill & \hfill 7\hfill \end{array}\right]$
2. True This sequence of operations transforms $A$ into the matrix $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 3\hfill & \hfill 1\hfill & \hfill -3\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]$
3. True This sequence of operations transforms $A$ into the matrix $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 3\hfill & \hfill \frac{1}{2}\hfill & \hfill -\frac{7}{2}\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right].$
What is the reduced row echelon form of the matrix $\left[\begin{array}{cccc}\hfill 2\hfill & \hfill 4\hfill & \hfill 6\hfill & \hfill -8\hfill \\ \hfill 3\hfill & \hfill 6\hfill & \hfill 7\hfill & \hfill 10\hfill \end{array}\right]$ ? Exactly one option must be correct)
 a) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 2\hfill & \hfill 3\hfill & \hfill -4\hfill \\ \hfill 1\hfill & \hfill 2\hfill & \hfill \frac{7}{3}\hfill & \hfill \frac{10}{3}\hfill \end{array}\right]$ b) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 3\hfill & \hfill -4\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill -2\hfill & \hfill 22\hfill \end{array}\right]$ c) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 2\hfill & \hfill 0\hfill & \hfill 29\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill -11\hfill \end{array}\right]$ d) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 2\hfill & \hfill 0\hfill & \hfill 37\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill -11\hfill \end{array}\right]$ e) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 2\hfill & \hfill 3\hfill & \hfill -4\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill -11\hfill \end{array}\right]$

Choice (a) is incorrect
This matrix is not even is row echelon form!
Choice (b) is incorrect
Check your sequence of row operations.
Choice (c) is correct!
The following sequence of elementary row operations: ${R}_{1}:=\frac{1}{2}{R}_{1},\phantom{\rule{1em}{0ex}}{R}_{2}:={R}_{2}-3{R}_{1},\phantom{\rule{1em}{0ex}}{R}_{2}:=-\frac{1}{2}{R}_{2}\phantom{\rule{1em}{0ex}}\text{and}\phantom{\rule{1em}{0ex}}{R}_{1}:={R}_{2}-3{R}_{2}$ applied to the matrix in the question gives this matrix.
Choice (d) is incorrect
Check your sequence of row operations.
Choice (e) is incorrect
This matrix is not even is row echelon form!
The matrix $\left[\begin{array}{cccccc}\hfill 0& \hfill 1& \hfill -2& \hfill 3& \hfill 5& \hfill -7\\ \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 1& \hfill 10\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\end{array}\right]$ is the augmented matrix of a system of linear equations. How many free parameters are needed for the solution of this system of equations?

Correct!
The augmented matrix is already in echelon form, so the number of free parameters needed for the general solution is equal to the number of columns in the augmented matrix which do not contain a leading $1$ for some row (in this case, columns 1, 4 and 5). You can also see this by looking at the corresponding system of equations. Let the variables be ${x}_{1}$, ${x}_{2}$, ${x}_{3}$, ${x}_{4}$ and ${x}_{5}$ then the corresponding system of equations is: $\begin{array}{rcll}0{x}_{1}+1{x}_{2}-2{x}_{3}+3{x}_{4}+5{x}_{5}& =-7& & \text{}\\ 0{x}_{1}+0{x}_{2}+1{x}_{3}+0{x}_{4}+1{x}_{5}& =10& & \text{}\\ 0{x}_{1}+0{x}_{2}+0{x}_{3}+0{x}_{4}+0{x}_{5}& =\phantom{\rule{2.77695pt}{0ex}}0& & \text{}\end{array}$

Consequently, there are 3 free parameters; namely, ${x}_{1}$, ${x}_{4}$ and ${x}_{5}$. Setting ${x}_{1}=p$, ${x}_{4}=q$, ${x}_{5}=r$, we obtain the complete solution by back substitution:

$\begin{array}{llll}\hfill {x}_{3}& =10-{x}_{5}=10-r\phantom{\rule{2em}{0ex}}& \hfill & \phantom{\rule{2em}{0ex}}\\ \hfill {x}_{2}& =-7+2{x}_{3}-3{x}_{4}-5{x}_{5}=-7+2\left(10-r\right)-3q-5r\phantom{\rule{2em}{0ex}}& \hfill & \phantom{\rule{2em}{0ex}}\\ \hfill & =13-3q-7r\phantom{\rule{2em}{0ex}}& \hfill & \phantom{\rule{2em}{0ex}}\\ \hfill & \phantom{\rule{2em}{0ex}}& \hfill \end{array}$

That is, $\left({x}_{1},{x}_{2},{x}_{3},{x}_{4},{x}_{5}\right)=\left(p,13-3q-7r,10-r,q,r\right)$.

Incorrect. Please try again.
Find the echelon form of the augmented matrix.
Let $A$ be the augmented matrix of the following system of equations.

$\begin{array}{llll}\hfill x+y+z& =2,\phantom{\rule{2em}{0ex}}& \hfill & \phantom{\rule{2em}{0ex}}\\ \hfill x+2y+az& =4,\phantom{\rule{2em}{0ex}}& \hfill & \phantom{\rule{2em}{0ex}}\\ \hfill 2x+3ay+2z& =6,\phantom{\rule{2em}{0ex}}& \hfill & \phantom{\rule{2em}{0ex}}\end{array}$ where $a$ is some real number. Using elementary row operations, the matrix $A$ can be reduced to the following matrix:
$\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 1\hfill & \hfill 2\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill a-1\hfill & \hfill 2\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill \left(1-a\right)\left(3a-2\right)\hfill & \hfill 6\left(a-1\right)\hfill \end{array}\right]$
Which of the following statements are correct? (More than one answer may be correct.) (Zero or more options can be correct)
 a) There is exactly one value of $a$ for which the original system of equations has a unique solution. b) There are exactly two values of $a$ for which the original system of equations has a unique solution. c) There is exactly one value for $a$ for which the original system of equations does not have a unique solution. d) There are exactly two values for $a$ for which the original system of equations does not have a unique solution. e) There is exactly one value of $a$ for which the original system of equations is inconsistent. f) There are exactly two values of $a$ for which the original system of equations is inconsistent.

There is at least one mistake.
For example, choice (a) should be False.
This system of equations has a unique solution for all values of $a$ other than $1$ or $2∕3$.
There is at least one mistake.
For example, choice (b) should be False.
This system of equations has a unique solution for all values of $a$ other than $1$ or $2∕3$.
There is at least one mistake.
For example, choice (c) should be False.
When $a=1$ the system has an infinite number of solutions and when $a=2∕3$ there are no solutions (the system is inconsistent).
There is at least one mistake.
For example, choice (d) should be True.
When $a=1$ the system has an infinite number of solutions and when $a=2∕3$ there are no solutions (the system is inconsistent). For all other values of $a$ the system has a unique solution.
There is at least one mistake.
For example, choice (e) should be True.
If $a=2∕3$ then the reduced augmented matrix becomes
$\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 1\hfill & \hfill 2\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 2\hfill & \hfill 2\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 2\hfill \end{array}\right]$
So the system of equations is inconsistent. For all other values of $a$ the system is consistent.
There is at least one mistake.
For example, choice (f) should be False.
The system is inconsistent only if $a=2∕3$.
Correct!
1. False This system of equations has a unique solution for all values of $a$ other than $1$ or $2∕3$.
2. False This system of equations has a unique solution for all values of $a$ other than $1$ or $2∕3$.
3. False When $a=1$ the system has an infinite number of solutions and when $a=2∕3$ there are no solutions (the system is inconsistent).
4. True When $a=1$ the system has an infinite number of solutions and when $a=2∕3$ there are no solutions (the system is inconsistent). For all other values of $a$ the system has a unique solution.
5. True If $a=2∕3$ then the reduced augmented matrix becomes
$\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 1\hfill & \hfill 2\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 2\hfill & \hfill 2\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 2\hfill \end{array}\right]$
So the system of equations is inconsistent. For all other values of $a$ the system is consistent.
6. False The system is inconsistent only if $a=2∕3$.
A matrix is a binary matrix if all of its entries are $0$ or $1$. For example, these two matrices $\left[\begin{array}{ccc}\hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\phantom{\rule{1em}{0ex}}\text{and}\phantom{\rule{1em}{0ex}}\left[\begin{array}{ccc}\hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \end{array}\right]$ are binary matrices, wheres the matrix $\left[\begin{array}{ccc}\hfill 0\hfill & \hfill -1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill -1\hfill & \hfill 1\hfill \end{array}\right]$ is not binary. How many binary 2 by 3 row echelon matrices are there ?

Correct!
The 22 binary row echelon matrices are:
$\begin{array}{cccccc}\hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill \\ & & & & & \\ \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \end{array}\right]\hfill \\ & & & & & \\ \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]\hfill \\ & & & & & \\ \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right].\hfill \end{array}$

Incorrect. Please try again.
You can list the row echelon binary matrices systematically as they all have one of the following forms:

$\begin{array}{cccc}\hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill \ast \hfill & \hfill \ast \hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill \ast \hfill & \hfill \ast \hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill \ast \hfill & \hfill \ast \hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill \ast \hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 1\hfill & \hfill \ast \hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill \\ & & & \\ \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 1\hfill & \hfill \ast \hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill \end{array}$

where the *’s are either $0$ or $1$.

As in question 7, call a matrix binary if all of its entries are $0$ or $1$. (See question 7 for some examples.) How many binary 2 by 3 reduced row echelon matrices are there ?

Correct!
The 15 reduced echelon binary matrices are

$\begin{array}{cccccc}\hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill \\ & & & & & \\ \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill 1\hfill \end{array}\right]\hfill \\ & & & & & \\ \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right].\hfill \end{array}$

Incorrect. Please try again.
You can list the row echelon binary matrices systematically as they all have one of the following forms:

$\begin{array}{cccc}\hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill \ast \hfill & \hfill \ast \hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill \ast \hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 1\hfill & \hfill 0\hfill & \hfill \ast \hfill \\ \hfill 0\hfill & \hfill 1\hfill & \hfill \ast \hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 1\hfill & \hfill \ast \hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill \\ & & & \\ \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{ccc}\hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \end{array}\right]\hfill \end{array}$

where the *’s are either $0$ or $1$.

The (unbalanced) following chemical equation

${Cu}_{2}\phantom{\rule{0.3em}{0ex}}S+{O}_{2}+C\to {SO}_{2}+Cu+CO.$
describes how copper (Cu) can be extracted from chalcocite (${\text{Cu}}_{2}\text{S}$) by combining it with carbon (C) and oxygen (${\text{O}}_{2}$) to produce copper (Cu), sulfur dioxide (${\text{SO}}_{2}$) and carbon monoxide (CO).
The chemical equation above is unbalanced because, for example, there are two copper atoms on the left hand side and only one copper atom on the right hand side. Which of the following augmented matrices corresponds to the system of linear equations that you would use in order to balance the equation above? Exactly one option must be correct)
 a) $\left[\begin{array}{ccccccc}\hfill 2\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 2\hfill & \hfill 0\hfill & \hfill 2\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \end{array}\right]$ b) $\left[\begin{array}{ccccccc}\hfill 2\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill -1\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill -1\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 2\hfill & \hfill 0\hfill & \hfill -2\hfill & \hfill 0\hfill & \hfill -1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill -1\hfill & \hfill 0\hfill \end{array}\right]$ c) $\left[\begin{array}{ccccccc}\hfill 2\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 2\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]$ d) $\left[\begin{array}{ccc}\hfill 2\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 1\hfill & \hfill 0\hfill & \hfill 1\hfill \\ \hfill 2\hfill & \hfill -2\hfill & \hfill 1\hfill \\ \hfill 1\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]$

Choice (a) is incorrect
We you to find integers ${n}_{1}$, ${n}_{2},\dots ,{n}_{6}$ such that
${n}_{1}{Cu}_{2}S+{n}_{2}{O}_{2}+{n}_{3}C\to {n}_{4}{SO}_{2}+{n}_{5}Cu+{n}_{6}CO.$
To balance the equation we need the same number of copper atoms on both sides so $2{n}_{1}={n}_{5}$, etc.
Choice (b) is correct!
We need to find integers ${n}_{1}$, ${n}_{2},\dots ,{n}_{6}$ such that
${n}_{1}{Cu}_{2}S+{n}_{2}{O}_{2}+{n}_{3}C\to {n}_{4}{SO}_{2}+{n}_{5}Cu+{n}_{6}CO$
In order to balance each element we need to have the same number of atoms of each type on both the left and right hand side of the equation. That is, the following equations must hold: For the augmented matrix we need the variables on the left and the constants on the right. That is, we have the equations: $\begin{array}{llll}\hfill 2{n}_{1}-{n}_{5}& =0\phantom{\rule{2em}{0ex}}& \hfill & \phantom{\rule{2em}{0ex}}\\ \hfill {n}_{1}-{n}_{4}& =0\phantom{\rule{2em}{0ex}}& \hfill & \phantom{\rule{2em}{0ex}}\\ \hfill 2{n}_{2}-2{n}_{4}-{n}_{6}& =0\phantom{\rule{2em}{0ex}}& \hfill & \phantom{\rule{2em}{0ex}}\\ \hfill {n}_{3}-{n}_{6}& =0\phantom{\rule{2em}{0ex}}& \hfill & \phantom{\rule{2em}{0ex}}\end{array}$ Using the augmented matrix easy to see that one way to balance this equation is
${Cu}_{2}S+2{O}_{2}+2C\to {SO}_{2}+2Cu+2CO$
Choice (c) is incorrect
We you to find integers ${n}_{1}$, ${n}_{2},\dots ,{n}_{6}$ such that
${n}_{1}{Cu}_{2}S+{n}_{2}{O}_{2}+{n}_{3}C\to {n}_{4}{SO}_{2}+{n}_{5}Cu+{n}_{6}CO.$
To balance the equation we need the same number of copper atoms on both sides so $2{n}_{1}={n}_{5}$, etc.
Choice (d) is incorrect
We you to find integers ${n}_{1}$, ${n}_{2},\dots ,{n}_{6}$ such that
${n}_{1}{Cu}_{2}S+{n}_{2}{O}_{2}+{n}_{3}C\to {n}_{4}{SO}_{2}+{n}_{5}Cu+{n}_{6}CO.$
To balance the equation we need the same number of copper atoms on both sides so $2{n}_{1}={n}_{5}$, etc.
Find the augmented matrices associated with finding the currents ${I}_{1}$, ${I}_{2}$ and ${I}_{3}$ in the circuit below.
Hints :
1. The total current flowing into a node equals the total current flowing out.
2. In each loop the sum of the voltage drops across the circuit elements is zero.
3. The voltage drop across a resistor with resistance $R$ and with a current $I$ passing through it is $V=IR$.
Exactly one option must be correct)
 a) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 1\hfill & \hfill -1\hfill & \hfill 0\hfill \\ \hfill 30\hfill & \hfill 0\hfill & \hfill 41\hfill & \hfill 45\hfill \\ \hfill 30\hfill & \hfill 21\hfill & \hfill 0\hfill & \hfill 80\hfill \end{array}\right]$ b) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 1\hfill & \hfill -1\hfill & \hfill 0\hfill \\ \hfill 30\hfill & \hfill 0\hfill & \hfill 41\hfill & \hfill 45\hfill \\ \hfill 30\hfill & \hfill -21\hfill & \hfill 0\hfill & \hfill 80\hfill \end{array}\right]$ c) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill -1\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 30\hfill & \hfill 0\hfill & \hfill 41\hfill & \hfill -45\hfill \\ \hfill 30\hfill & \hfill 21\hfill & \hfill 0\hfill & \hfill 80\hfill \end{array}\right]$ d) $\left[\begin{array}{cccc}\hfill 1\hfill & \hfill -1\hfill & \hfill -1\hfill & \hfill 0\hfill \\ \hfill 30\hfill & \hfill 0\hfill & \hfill 21\hfill & \hfill 45\hfill \\ \hfill 0\hfill & \hfill 21\hfill & \hfill 41\hfill & \hfill 35\hfill \end{array}\right]$

Choice (a) is incorrect
Choice (b) is correct!
The current into node $A$ is ${I}_{3}$ and the current out is ${I}_{1}+{I}_{2}$ so
${I}_{1}+{I}_{2}-{I}_{3}=0.$
In the top loop the voltage drop is zero so ${I}_{3}+40{I}_{3}+30{I}_{1}-45=0$ implying
$30{I}_{1}+41{I}_{3}=45.$
In the bottom loop the voltage drop is also zero implying
$-80+{I}_{2}+20{I}_{2}-30{I}_{1}=0$
(be careful with the direction of the current). The voltage drop across the 30$\Omega$ resistor is negative since the current is labelled in the opposite direction thus
$30{I}_{1}-21{I}_{2}-80=0.$
Hence an augmented matrix is
$\left[\begin{array}{cccc}\hfill 1\hfill & \hfill 1\hfill & \hfill -1\hfill & \hfill 0\hfill \\ \hfill 30\hfill & \hfill 0\hfill & \hfill 41\hfill & \hfill 45\hfill \\ \hfill 30\hfill & \hfill -21\hfill & \hfill 0\hfill & \hfill 80\hfill \end{array}\right]$
Choice (c) is incorrect
Choice (d) is incorrect