Matrix row reduction with variables

[rahian2k]

[deleted]

 

[stapel]

For there to be no solution, you need one of the rows to reduce to nonsense, like "0 0 0 4", so 0x + 0y + 0z = 4, which is, of course, impossible.

Eliz.

 

[stapel]

How did you get answers for "B" and "C"? Reduce the matrix in the same manner as you did for those parts, and then solve a row for values of "m" that give you nonsense.

Eliz.

 

[rahian2k]

[deleted]

 

[stapel]

there is no "C" part of the question.

Sorry; I conflated the (a) and (b) parts of the problem with the (i), (ii), and (iii) parts of (a). I meant parts (ii) and (iii), rather than parts (B) and (C).

Reducing it is the problem im having...

In that case, I'm more confused now than before. How did you do parts (i), (ii), and (iiii) in (b), if you haven't done (a)? Please clarify. Thank you.

Eliz.

 

[pka]

The above is the inverse of the matrix of coefficients.
Note that the inverse does not exist if m=−5 or −1.
This means that of all other values of m there is a unique solution.
For one of those values there is no solution; for one there are many solutions.