Optional three-variable examples
One solution: x + y + z = 6, 2x − y + z = 3, and x + 2y − z = 2 give x = 1, y = 2, z = 3. Check: 1 + 2 + 3 = 6; 2 − 2 + 3 = 3; 1 + 4 − 3 = 2. Select Three variables and Try an example to load this system.
Infinitely many solutions: x + y + z = 6, 2x + 2y + 2z = 12, and x − y = 0 give x = 3 − z/2 and y = 3 − z/2, with any real z. For example, z = 2 gives (2, 2, 2), while z = 0 gives (3, 3, 0).
No solution: x + y + z = 6, 2x + 2y + 2z = 13, and x − y = 0 are inconsistent: subtracting twice the first equation from the second gives 0 = 1.
Row reduction for three variables
The optional mode uses exact Gauss–Jordan elimination on the three coefficient rows and their right-hand values. It swaps rows when needed, divides by nonzero pivots, and eliminates the other entries in each pivot column. The steps show these operations.
Three independent coefficient rows give a unique triple. A contradictory zero row gives no solution. Otherwise, the result expresses pivot variables in terms of the free variables, which can vary independently. Coefficient rank counts the independent variable conditions; augmented rank also includes the right-hand column. Unequal ranks mean the system is inconsistent.
Further reading: OpenStax, Solving Systems with Gaussian Elimination.
Determinants and Cramer's rule
For a × x + b × y = c and d × x + e × y = f, calculate D = a × e − b × d. If D is nonzero, x = (c × e − b × f) ÷ D and y = (a × f − c × d) ÷ D. The calculator verifies both equations using those exact answers.
When D is zero, division by D cannot be used. The calculator checks for contradictory zero rows and compares the remaining coefficient and constant relationships to distinguish no solution from infinitely many solutions.
Further reading: OpenStax, Systems of Linear Equations: Two Variables and Solving Systems with Cramer's Rule.