Write the system as an augmented matrix and use row operations to clear every entry below the pivots. The result is a staircase (echelon form) whose last equation has one unknown, so you solve from the bottom up.
| Step | On | |
|---|---|---|
| 1 | Write the augmented matrix. One row per equation, one column per unknown, the constants behind the bar (augmented matrix). Line up the unknowns in the same order in every row. | |
| 2 | Get a nonzero pivot in the top-left position. If the entry is , swap in a row below that has a nonzero entry in that column. | pivot already in place |
| 3 | Clear every entry below the pivot. For each lower row use , constants included.Elementary row operations ↗ | : rows , |
| 4 | Move one row down and one column right, and repeat. Stop when every row has been used or the rest are zero rows. A row with means no solution. | : |
| 5 | Back-substitute and check. Solve the last row, then work upward (back substitution). Put the answer into the original equations. | ; check ✓ |