Answer:
If k = −1 then the system has no solutions.
If k = 2 then the system has infinitely many solutions.
The system cannot have unique solution.
Step-by-step explanation:
We have the following system of equations

The augmented matrix is
![\left[\begin{array}{cccc}1&-2&3&2\\1&1&1&k\\2&-1&4&k^2\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bcccc%7D1%26-2%263%262%5C%5C1%261%261%26k%5C%5C2%26-1%264%26k%5E2%5Cend%7Barray%7D%5Cright%5D)
The reduction of this matrix to row-echelon form is outlined below.

![\left[\begin{array}{cccc}1&-2&3&2\\0&3&-2&k-2\\2&-1&4&k^2\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bcccc%7D1%26-2%263%262%5C%5C0%263%26-2%26k-2%5C%5C2%26-1%264%26k%5E2%5Cend%7Barray%7D%5Cright%5D)

![\left[\begin{array}{cccc}1&-2&3&2\\0&3&-2&k-2\\0&3&-2&k^2-4\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bcccc%7D1%26-2%263%262%5C%5C0%263%26-2%26k-2%5C%5C0%263%26-2%26k%5E2-4%5Cend%7Barray%7D%5Cright%5D)

![\left[\begin{array}{cccc}1&-2&3&2\\0&3&-2&k-2\\0&0&0&k^2-k-2\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bcccc%7D1%26-2%263%262%5C%5C0%263%26-2%26k-2%5C%5C0%260%260%26k%5E2-k-2%5Cend%7Barray%7D%5Cright%5D)
The last row determines, if there are solutions or not. To be consistent, we must have k such that


Case k = −1:
![\left[\begin{array}{ccc|c}1&-2&3&2\\0&3&-2&-1-2\\0&0&0&(-1)^2-(-1)-2\end{array}\right] \rightarrow \left[\begin{array}{ccc|c}1&-2&3&2\\0&3&-2&-3\\0&0&0&-2\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7Cc%7D1%26-2%263%262%5C%5C0%263%26-2%26-1-2%5C%5C0%260%260%26%28-1%29%5E2-%28-1%29-2%5Cend%7Barray%7D%5Cright%5D%20%5Crightarrow%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7Cc%7D1%26-2%263%262%5C%5C0%263%26-2%26-3%5C%5C0%260%260%26-2%5Cend%7Barray%7D%5Cright%5D)
If k = −1 then the last equation becomes 0 = −2 which is impossible.Therefore, the system has no solutions.
Case k = 2:
![\left[\begin{array}{ccc|c}1&-2&3&2\\0&3&-2&2-2\\0&0&0&(2)^2-(2)-2\end{array}\right] \rightarrow \left[\begin{array}{ccc|c}1&-2&3&2\\0&3&-2&0\\0&0&0&0\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7Cc%7D1%26-2%263%262%5C%5C0%263%26-2%262-2%5C%5C0%260%260%26%282%29%5E2-%282%29-2%5Cend%7Barray%7D%5Cright%5D%20%5Crightarrow%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7Cc%7D1%26-2%263%262%5C%5C0%263%26-2%260%5C%5C0%260%260%260%5Cend%7Barray%7D%5Cright%5D)
This gives the infinite many solution.
Answer:
The equation is always false
Step-by-step explanation:
The third graph represents a function.
In a function, every input (x value) has <em>exactly</em> one output (y value). If even a single input has zero or two outputs, the graph does not represent a function.
A good way of testing this is using a vertical line. As you move a vertical line from left to right across a graph, it should always be touching exactly one point on the graphed line.
In this case, every graph fails this vertical line test except for the third graph, so the third graph represents a function.
Answer:
1/3 and 1.5
Step-by-step explanation:
1,2,3,4,5,6,7,8,9,10,11,12,13,14,15
There are 5 Multiples of 3 on the Spinner and 3 multiples of four.
5/15 is the probability for a multiple of 3 which can be simplified to 1/3
3/15 is the probability for a multiple of 4 which can be simplified to 1/5
Hope this Helps!
Answer:
The answer is 6!!!
Step-by-step explanation: