Linear Combination Calculator - Combine and Solve 2x2 Systems

A linear combination calculator solves a 2x2 system by the linear combination method, the textbook synonym for the elimination method. The method multiplies each equation by a chosen scalar and adds the two equations so that one variable cancels, leaving a single equation in one variable that is easy to solve. The tool also shows the multiplier pair it used and a check that (x, y) satisfies both original equations.

• • Pre-algebra and algebra homework: Combine two equations in two unknowns when the prompt says to 'use the linear combination method'.
• • Word-problem cross-check: Convert a two-unknown word problem into a 2x2 system and read off x and y.
• • Cramer's rule sanity check: Verify the (x, y) pair produced by Cramer's rule on the same six coefficients.
• • Decimal and fraction coefficients: The algorithm works for real coefficients. The calculator finds the smallest value that is an exact multiple of both |a1| and |a2| and uses it as the common multiplier.

For integer coefficients the common multiplier is the LCM of |a1| and |a2|: multiply the first equation by L / a1 and the second by -L / a2, then add. The same pattern generalises to decimal inputs by replacing the LCM with the smallest exact common multiple, so the rest of the pipeline is unchanged.

When the same 2x2 system needs to be solved by a different method, the system of equations calculator is the natural companion to this page.

The calculator reads the six coefficients, finds a value L that is an exact multiple of both |a1| and |a2| (LCM for integers, smallest exact common multiple for decimals), builds a multiplier pair that flips the sign of the x term, adds the scaled equations to cancel x, solves for y, then back-substitutes. Each step is shown in the results panel.

• a1, b1, c1: Coefficients and right-hand side of a1*x + b1*y = c1.
• a2, b2, c2: Coefficients and right-hand side of a2*x + b2*y = c2.
• L: Smallest positive value that is an exact multiple of both |a1| and |a2|. For integer inputs this is the LCM; for decimal inputs the same loop finds the smallest exact common multiple. L falls back to |a1| when a2 is zero, and to |a2| when a1 is zero.
• m1, m2: Multiplier pair. m1 = L / a1 scales the first equation so its x coefficient becomes L; m2 = -L / a2 scales the second to -L.
• det = a1*b2 - a2*b1: Coefficient determinant. Unique solution when det is non-zero; when det is zero the cancellation still runs, but the combined equation collapses to 0 = 0 or 0 = non-zero.

For x - 4y = 1 and -2x + 4y = 2, the common multiple of 1 and 2 is 2, so m1 = 2 and m2 = 1. Adding the scaled equations cancels x and gives -4y = 4, so y = -1 and x = -3, giving (x, y) = (-3, -1).

When a1 = 0 or a2 = 0 the step falls back to a single non-zero coefficient. The remaining singularity is a1*b2 = a2*b1: parallel (or identical) lines and the combined equation reduces to 0 = 0 or 0 = non-zero.

According to Wikipedia, a 2x2 system has the unique solution x = (c1*b2 - c2*b1) / (a1*b2 - a2*b1) and y = (a1*c2 - a2*c1) / (a1*b2 - a2*b1) when the coefficient determinant is non-zero, and either no solution or infinitely many solutions otherwise.

For the same 2x2 system solved by the elimination framing rather than the linear combination framing, the elimination method calculator is the row-reduction counterpart to this page.

Four ideas cover the entire pipeline.

For 2x2 systems, the result panel can show every line on one screen, including the 0 = 0 and 0 = non-zero edge cases the determinant picks out.

When the same 2x2 system is easier to solve by substitution than by linear combination, the substitution method calculator is the substitution counterpart to this page.

Type the six coefficients, watch the multiplier pair and the combined equation update on the right, and read the (x, y) solution with a check of both original equations.

1. 1 Type the first equation: Enter a1, b1, and c1 for a1*x + b1*y = c1. Integers and decimals are both accepted.
2. 2 Type the second equation: Enter a2, b2, and c2 for a2*x + b2*y = c2.
3. 3 Read the common multiplier and the multiplier pair: L (LCM for integers, smallest exact common multiple for decimals) is shown next to (m1, m2).
4. 4 Read the combined equation and y: The combined equation in y alone is rendered with the matching y value when the cancellation produces a valid one-variable equation.
5. 5 Read x and the check: The x value is the back-substitution, and the check row shows a1*x + b1*y and a2*x + b2*y next to c1 and c2.
6. 6 Read the determinant message when it fires: When a1*b2 = a2*b1, the cancellation still happens and the panel shows 'infinitely many solutions' or 'no solution'.

For 'sum of two numbers is 12, difference is 4', the equations are x + y = 12 and x - y = 4. L = 1, m1 = 1, m2 = -1, the combined equation is 2y = 8, so y = 4 and x = 8. The check row confirms a1*x + b1*y = 12 and a2*x + b2*y = 4.

When the same 2x2 system needs to be solved through the cofactor and inverse identity on the coefficient matrix, the adjoint matrix calculator is the matrix-based counterpart to this page.

The linear combination method is one of the cleanest ways to solve a 2x2 system by hand, and the calculator keeps every step on one screen.

• • Common multiplier and multiplier pair shown as their own step: L and (m1, m2) are displayed above the combined equation.
• • Combined equation rendered in plain math: The combined equation in y alone is rendered with the y value inline when the cancellation produces a valid one-variable equation.
• • Final (x, y) pair with a check of both equations: The panel shows x, y, and a check of a1*x + b1*y and a2*x + b2*y against c1 and c2.
• • No-solution and infinite-solution messages built in: When a1*b2 - a2*b1 is zero, the calculator reports 'no solution' or 'infinitely many solutions' based on what the cancellation leaves behind.

The result panel runs top to bottom: L and the multiplier pair at the top, the combined equation in the middle, the y value, the x value, and the check of both original equations at the bottom. The same layout works for integer and decimal coefficients.

When the same 2x2 system sits at the bottom of a small normal-equations problem, the linear regression calculator is the next page worth opening.

A handful of input choices decide whether the multiplier pair cancels the x term cleanly, and whether the panel reports a unique solution.

• • The calculator is restricted to a single 2x2 system. For 3x3 and larger, the common-multiplier pattern generalises to Gaussian elimination on the full augmented matrix.
• • The output is rounded for display, so a clean fraction like 1/3 will show as 0.3333.
• • Numerical round-off in the coefficient determinant can hide a true singular system. The calculator treats only an exact zero as singular.

According to Wolfram MathWorld, the linear combination method multiplies each equation by a chosen scalar and adds them to cancel one variable, which is equivalent to Gaussian elimination on the augmented matrix of the system.

According to MIT OpenCourseWare 18.06 (Strang), the elimination step multiplies each equation by a multiplier chosen to make the x coefficients opposite, and the same pattern extends to 3x3 and larger systems through row reduction.

When the same two linear expressions in x and y turn into inequalities instead of equalities, the linear inequality calculator is the next page worth opening.