System of Equations Calculator

A system of equations is a set of two or more equations that share the same unknowns. The goal is to find values for each variable that satisfy every equation simultaneously. In two dimensions, each equation represents a straight line, and solving the system means finding the point where those lines intersect.

A 2×2 system has two equations and two unknowns (x and y). Geometrically, it asks: where do two lines cross? A 3×3 system has three equations and three unknowns (x, y, z) — it asks where three planes intersect in three-dimensional space.

Systems of equations appear everywhere in applied mathematics: balancing chemical reactions, solving circuit problems using Kirchhoff's laws, finding break-even points in business, and modelling supply-and-demand equilibria. Mastering them is a foundational step in algebra, physics, and engineering.

Elimination (also called the addition method) is the most reliable approach for 2×2 systems and scales naturally to 3×3. The idea is to combine equations to cancel out one variable at a time.

Step 1 — choose the target variable. Pick whichever variable has the simplest coefficients across both equations.

Step 2 — multiply to match coefficients. Scale one or both equations so the chosen variable has equal (or opposite) coefficients in both rows.

Step 3 — subtract (or add) to eliminate. Combine the two equations to produce a single equation with only one unknown.

Step 4 — solve and back-substitute. Solve the single-variable equation, then substitute its value back into any original equation to find the remaining variable.

A 3×3 system requires two passes of elimination. The process is formally called Gaussian elimination and works on the augmented matrix — the coefficient matrix with the right-hand-side constants appended as an extra column.

Pass 1 — forward elimination. Use the first equation to eliminate x from both the second and third equations. Multiply the first row by an appropriate factor and subtract it from each of the other rows. After this pass, only the first equation still contains x.

Pass 2 — second forward elimination. Use the modified second equation to eliminate y from the third equation. After this pass, the third equation contains only z (or is a contradiction / identity, indicating no solution or infinite solutions).

Back-substitution. Solve for z from the third equation, substitute into the second to find y, then substitute both into the first to find x.

Partial pivoting is a practical refinement: before each elimination pass, swap rows to move the row with the largest absolute pivot value to the top. This prevents division by small numbers and reduces floating-point rounding errors.

Not every system has a unique solution. Two special cases arise when the equations are linearly dependent or contradictory.

No solution (inconsistent system) — the equations describe parallel lines (2×2) or parallel planes (3×3) that never intersect. During elimination, this produces a row of the form 0 = nonzero, which is a mathematical impossibility. Example: x + y = 3 and x + y = 5 are the same line shifted — they can never be equal simultaneously.

Infinitely many solutions (dependent system) — at least two equations are multiples of each other and convey the same information. Elimination produces a row of the form 0 = 0, which is always true. The system is under-determined: one variable is free to take any value.

Substitution isolates one variable in one equation and substitutes the expression into the other. It works well for 2×2 systems where one equation already has a single isolated variable (e.g. y = 2x + 1). However, substituting into a 3×3 system quickly creates messy nested expressions.

Elimination (Gaussian) is generally faster for 3×3 and larger systems because each row operation cancels an entire variable with simple arithmetic. It also has a natural matrix representation, making it the foundation for computer algorithms that solve N×N systems.

Cramer's rule uses determinants and provides a closed-form answer without row operations. It is elegant for 2×2 systems but becomes computationally expensive for 3×3 or larger. Our solver uses Gaussian elimination with partial pivoting — the most numerically stable approach.