I've been trying for a while, but can't get the row reduced form. this is the matrix.
$$\begin{bmatrix} 4 & 8 & 1 & 1 & 6\\ 3 & 6 & 1 & 2 & 5\\ 2 & 4 & 1 & 9 & 10\\ 1 & 2 & 3 & 2 & 0\end{bmatrix}$$
steps I tried:
I subtracted the second row from the first. After doing that I can't get anything after the first row to be 0. I don't know if I should switch the rows or something...
The row reduction algorithm is as follows:
Using the notation $\frac{1}{4}R_1\rightarrow R_1$ to denote multiplying the first row by $\frac{1}{4}$ and storing that as the new first row, $R_2\leftrightarrow R_1$ to denote swapping the first and second rows, and $R_2-3R_1\rightarrow R_2$ to denote subtracting 3 times the first row from the second row to store as the new second row, the first several steps in the row reduction process is as follows:
$$\frac{1}{4}R_1\rightarrow R_1\\ R_2-3R_1\rightarrow R_2\\ R_3-2R_1\rightarrow R_3\\ R_4-R_1\rightarrow R_4$$
At this point the matrix should look like this (assuming I haven't made any mental arithmetic mistakes):
$$\begin{bmatrix} 1 & 2 & \frac{1}{4} & \frac{1}{4} & \frac{3}{2}\\ 0 & 0 & \frac{1}{4} & \frac{5}{4} & \frac{7}{4}\\ 0 & 0 & \frac{1}{2} & \frac{17}{2} & 7\\ 0 & 0 & \frac{11}{4} & \frac{7}{4} & -\frac{3}{2}\end{bmatrix}$$
Notice that there is no way to swap rows with any to get the next diagonal entry to be nonzero. That is okay though! According to our algorithm, if faced with this situation, we may move to the next available pivot point, which will be the second row, third column entry.
Continue the process then with: $4R_2\rightarrow R_2$ and zero out the rest of the third column entries, etcetera.