Systems of Equations Solver

A system of linear equations is a set of two or more equations, each of which is linear (no squared or higher-power terms), with the same unknowns. A 2×2 system has two equations and two unknowns (x and y). The solution is the set of values that satisfy all equations simultaneously. Geometrically, each equation represents a line in 2D, and the solution is the intersection point.

Cramer's Rule solves a 2×2 system a₁x + b₁y = c₁ and a₂x + b₂y = c₂ using determinants. The coefficient determinant is D = a₁b₂ − a₂b₁. Then x = Dₓ/D where Dₓ = c₁b₂ − c₂b₁, and y = Dy/D where Dy = a₁c₂ − a₂c₁. If D = 0, the system has no unique solution (the lines are parallel or identical). Cramer's Rule extends to 3×3 and larger systems but becomes less efficient than Gaussian elimination for large n.

Gaussian elimination is an algorithm for solving linear systems by applying row operations to the augmented matrix (coefficients plus constants) to reduce it to row echelon form (upper triangular). The operations are: swap two rows, multiply a row by a non-zero scalar, and add a multiple of one row to another. Once in echelon form, back substitution gives the solution. The method works for any size system and also detects dependent and inconsistent systems.

A system has no solution when the equations are inconsistent - they contradict each other. Geometrically in 2D, the two lines are parallel: they have the same slope but different y-intercepts. In Cramer's Rule, D = 0 but at least one of Dₓ or Dy is non-zero. In Gaussian elimination, a row of all zeros except in the constant column (e.g., 0 0 | 5) indicates inconsistency.

A system has infinitely many solutions when the equations are dependent - one is a multiple of the other, so they represent the same geometric object. In 2D, both equations describe the same line, and every point on that line is a solution. In Cramer's Rule, D = Dₓ = Dy = 0. In Gaussian elimination, a zero row appears (0 0 | 0). The solution set is a line (in 2D) or a plane (in 3D).

Substitute the computed values (x, y) into every original equation and verify that both sides are equal. For the 2×2 system: check a₁x + b₁y = c₁ and a₂x + b₂y = c₂. This calculator performs this verification automatically and shows it in the steps. Any discrepancy (beyond floating-point rounding, typically < 10⁻¹⁰) indicates an error.

The substitution method solves one equation for one variable, then substitutes that expression into the other equation to get a one-variable equation. Example: from 2x + y = 7 → y = 7 − 2x, then substitute into 3x − y = 2: 3x − (7 − 2x) = 2 → 5x = 9 → x = 9/5. Back-substitute to find y. Cramer's Rule and Gaussian elimination are more systematic for larger systems.

The elimination method multiplies equations by scalars so that adding or subtracting them eliminates one variable. Example: multiply eq1 by 2 and eq2 by 3, then subtract to eliminate x. This is essentially what Gaussian elimination formalizes. It is equivalent to Cramer's Rule in the 2×2 case and always gives the same answer when a unique solution exists.

Systems of equations model any situation with multiple interdependent constraints: (1) Economics - supply and demand equilibrium, input-output analysis. (2) Engineering - circuit analysis (Kirchhoff's laws give a system for branch currents), structural force balance. (3) Chemistry - balancing chemical equations requires solving a system for stoichiometric coefficients. (4) Navigation - GPS triangulation uses a system of distance equations. (5) Computer graphics - intersection of lines, planes, and surfaces.

Use Cramer's Rule for 2×2 systems - it's fast and gives explicit formulas for x and y in terms of determinants. For 3×3 and larger systems, Gaussian elimination is more efficient and numerically stable. Cramer's Rule for 3×3 requires computing four 3×3 determinants (each with six multiplications), while Gaussian elimination on a 3×3 augmented matrix needs fewer operations and handles degenerate cases more cleanly.