Every linear system has exactly one solution, no solution, or infinitely many. Row-reduce the augmented matrix: a row that reads with means none; otherwise the number of pivots decides between one and infinitely many.
| Step | On | |
|---|---|---|
| 1 | Write the augmented matrix. Keep the constants; they decide whether a solution exists. | |
| 2 | Reduce to echelon form. The forward pass of Gaussian elimination is enough; no back substitution needed. | : last row |
| 3 | Look for a contradictory row. A row with says : no solution. A full zero row is harmless. | : no solution |
| 4 | Otherwise count the pivots of A. The count is the rank. Compare it with the number of unknowns . | here |
| 5 | State the answer. : exactly one solution. : infinitely many, with free parameters (free variables count). | inconsistent: no solution |