I have the system of linear equations where $k$ is the parameter: $$ \begin{cases} x+ky+z = 0 \\ kx+y+kz=0 \\ (k+1)x-y+z=0 \end{cases} $$
For which the matrix is: $$ \begin{bmatrix} 1 & k & 1 \\ k & 1 & k \\ k+1 & -1 & 1 \end{bmatrix} $$
I managed to reduce the matrix to: $$ \begin{bmatrix} 1 & k & 1 \\ 0 & 1-k^2 & 0 \\ 0 & 2+k & k \end{bmatrix} $$
However, I don't see how this can be reduced further. As far as I know I need the echelon form to be able to determine how many solutions exist. Should I just plug in $k=-2$ in order to reduce it further? If yes then what can be said about the number of solutions if $k \neq =2$?
EDIT: I'm only beginning linear math course so I can't use any advanced techniques (like determinants etc.)
Case 1: Assume that $1-k^2 \not=0$ (i.e., $k \not=1, k \not=-1$). Then we can add $\frac{-(2+k)}{1-k^2}$ times the second row to the third row. This leads to: $$ \begin{bmatrix} 1 & k & 1 \\ 0 & 1-k^2 & 0 \\ 0 & 0 & k \end{bmatrix} $$
Case 2: If $1-k^2=0$ (i.e. $k= \pm 1$) then what you have above is equal to $$ \begin{bmatrix} 1 & k & 1 \\ 0 & 0 & 0 \\ 0 & 2+k & k \end{bmatrix} \to \begin{bmatrix} 1 & k & 1 \\ 0 & 2+k & k \\ 0 & 0 & 0 \end{bmatrix} $$
Can you take it from here in both cases?