Solve systems of linear equations with exact fraction arithmetic. RREF, parametric solutions, and step‑by‑step precision.
Gaussian elimination (or row reduction) is a method for solving systems of linear equations. It was named after Carl Friedrich Gauss, although it was known in China as early as 179 AD (described in The Nine Chapters on the Mathematical Art).
Elementary Row Operations (do not change the solution set):
A matrix is in RREF if:
Once a matrix is in RREF, the solution can be read directly:
[0 ... 0 | b] with b≠0 appears, the system is inconsistent (no solution).
Each equation represents a plane (in 3D) or a line (in 2D). The solution is the intersection of these geometric objects. Gaussian elimination systematically reduces the system to reveal this intersection.
Floating‑point arithmetic can introduce rounding errors that hide the true nature of a system (e.g., a system that is actually inconsistent might appear consistent due to tiny residuals). Using exact fractions guarantees that the output is mathematically correct.
Did you know? The method of elimination was used in ancient China to solve problems like: “Three sheafs of good crop, two sheafs of medium crop, and one sheaf of bad crop yield 39 dou of grain…” – exactly the kind of system this calculator solves!
/ for fractions, e.g., 2/3.1.5 are also accepted.