The original equations were:
$$x+y+z = 1$$ $$y-z=1$$ $$2x+3y+z(a+2)=b+3 \text{ where $a,b \in \mathbb{R}$}$$ \begin{array}{ccc|c} 1 & 1 & 1 & 1 \\ 0 &1 & -1 & 1 \\ 2 & 3 & a+2 &b+2 \\ \end{array}
Performing a series of row operations, I get down to:
\begin{array}{ccc|c} 1 & 0 & 0 & \frac{-2b}{a+1} \\ 0 &1 & 0 & \frac{a+b+1}{a+1} \\ 0 & 0 & 1 &\frac{b}{a+1} \\ \end{array}
I am asked to find the solutions of $a,b$, such that the matrix has no solutions, one solution, and infinitely many.
A matrix has $no$ solutions if there is a row of $0$ before the partition, and a non-zero number after the partition.
A matrix has one solution (the trivial solution), if all the pivots equal $0$.
A matrix has infintely many solutions if there exists a column without a pivot.
Knowing this, how can I find values of $a,b$? Since all the columns have pivots, can there even be a solution for infinity? or no solutions?