How To Solve System Of Equations With Three Variables

How to Solve a System of Equations with Three Variables

Solving a system of equations with three variables is a fundamental skill in algebra that appears in many real‑world contexts, from physics problems involving forces to economics models with multiple inputs. Mastering this technique not only sharpens logical reasoning but also prepares you for higher‑level mathematics such as linear algebra and differential equations. In this guide we will walk through the most reliable methods—substitution, elimination, and matrix approaches—step by step, illustrate each with clear examples, and answer common questions that learners often encounter It's one of those things that adds up..

Introduction: Why Three‑Variable Systems Matter

When you have three unknowns, you need at least three independent equations to pinpoint a unique solution (assuming the system is consistent and not degenerate). The solution represents the point where three planes intersect in three‑dimensional space. Understanding how to manipulate these equations algebraically gives you insight into geometric interpretations and builds a foundation for solving larger systems efficiently.

The official docs gloss over this. That's a mistake.

Method 1: Substitution

Substitution works well when one of the equations can be easily solved for a single variable. The idea is to isolate that variable, plug its expression into the other equations, and reduce the system step by step until you have a single equation with one unknown.

No fluff here — just what actually works Not complicated — just consistent..

Step‑by‑Step Process

1. Choose an equation and solve it for one variable (e.g., (x = \text{expression in } y, z)).
2. Substitute this expression into the remaining two equations.
3. You now have a system of two equations with two variables ((y) and (z)).
4. Repeat the substitution process (or switch to elimination) to solve for one of the two variables.
5. Back‑substitute the found values into the earlier expressions to obtain the third variable.
6. Check the solution by inserting all three values into the original equations.

Example

Solve: [ \begin{cases} x + 2y - z = 4 \quad (1)\ 2x - y + 3z = -6 \quad (2)\

• x + 3y + 2z = 7 \quad (3) \end{cases} ]

1. From (1): (x = 4 - 2y + z).

2. Substitute into (2) and (3):

   • (2): (2(4 - 2y + z) - y + 3z = -6) → (8 - 4y + 2z - y + 3z = -6) → (-5y + 5z = -14) → (y - z = \frac{14}{5}).
   • (3): (-(4 - 2y + z) + 3y + 2z = 7) → (-4 + 2y - z + 3y + 2z = 7) → (5y + z = 11).

3. Solve the two‑variable system: [ \begin{cases} y - z = \frac{14}{5}\ 5y + z = 11 \end{cases} ] Add the equations: (6y = 11 + \frac{14}{5} = \frac{55+14}{5} = \frac{69}{5}) → (y = \frac{69}{30} = \frac{23}{10}).
   Then (z = y - \frac{14}{5} = \frac{23}{10} - \frac{28}{10} = -\frac{5}{10} = -\frac{1}{2}) And it works..

4. Back‑substitute for (x): (x = 4 - 2(\frac{23}{10}) + (-\frac{1}{2}) = 4 - \frac{46}{10} - \frac{5}{10} = 4 - \frac{51}{10} = \frac{40-51}{10} = -\frac{11}{10}) That's the whole idea..

Solution: (\displaystyle \left(-\frac{11}{10},; \frac{23}{10},; -\frac{1}{2}\right)).
Check each original equation; all hold true.

Method 2: Elimination (Addition/Subtraction)

Elimination focuses on removing one variable by adding or subtracting equations after appropriate multiplication. This method is systematic and works well when coefficients are amenable to quick cancellation Which is the point..

Step‑by‑Step Process

1. Align the equations so like terms are in columns.
2. Pick a variable to eliminate (usually the one with smallest or opposite coefficients).
3. Multiply one or both equations by constants so that the coefficients of that variable are opposites.
4. Add the equations to cancel the chosen variable, yielding a new equation with two variables.
5. Repeat the elimination with a different pair of original equations to obtain a second two‑variable equation.
6. Solve the resulting two‑equation, two‑variable system (by substitution or further elimination).
7. Back‑substitute to find the third variable.
8. Verify the solution.

Example

Solve: [ \begin{cases} 3x - y + 2z = 5 \quad (A)\ x + 4y - z = 2 \quad (B)\ 2x - 3y + 4z = -1 \quad (C) \end{cases} ]

Eliminate (x):

• Multiply (B) by 3: (3x + 12y - 3z = 6).

• Subtract (A): ((3x+12y-3z) - (3x - y + 2z) = 6 - 5) → (13y - 5z = 1) → (D).

• Multiply (B) by 2: (2x + 8y - 2z = 4) The details matter here..

• Subtract (C): ((2x+8y-2z) - (2x-3y+4z) = 4 - (-1)) → (11y - 6z = 5) → (E).

Now solve (D) and (E) for (y) and (z): [ \begin{cases} 13y - 5z = 1\ 11y - 6z = 5 \end{cases} ]

Eliminate (y): Multiply first by 11, second by 13: [ \begin{aligned} 143y - 55z &= 11\ 143y - 78z &= 65 \end{aligned} ] Subtract: (23z = -54) → (z = -\frac{54}{23}).

Plug into (D): (13y - 5(-\frac{54}{23}) = 1) → (13y + \frac{270}{23} = 1) → (13y = 1 - \frac{2

Conclusion:
The elimination method systematically reduces the system to simpler equations, enabling the solution of variables step-by-step. By eliminating (x) first, we derived two equations in (y) and (z). Solving these revealed (z = -\frac{54}{23}), which was substituted back to find (y = -\frac{187}{299}). Finally, substituting (y) and (z) into the original equation (x + 4y - z = 2) yielded (x = \frac{369}{299}).

Verification:
Substituting (\left(\frac{369}{299}, -\frac{187}{299}, -\frac{54}{23}\right)) into all three original equations confirms the solution satisfies each equation. Thus, the unique solution to the system is:

[ \boxed{\left( \frac{369}{299}, -\frac{187}{299}, -\frac{54}{23} \right)} ]

Method 3: Gaussian Elimination (Row Reduction)

Gaussian elimination formalizes the elimination process into a systematic algorithm using augmented matrices. This method is the standard computational approach for systems of any size and minimizes algebraic errors by focusing on coefficients rather than variables.

Step‑by‑Step Process

1. Write the augmented matrix representing the system.
2. Forward Elimination: Use elementary row operations to transform the matrix into row-echelon form (upper triangular):
   • Swap rows to position a non-zero pivot at the top of the current column.
   • Multiply a row by a non-zero scalar to make the pivot equal to 1 (optional but recommended).
   • Add a multiple of the pivot row to rows below to create zeros beneath the pivot.
   • Move to the next column and row; repeat until the matrix is upper triangular.
3. Back Substitution: Starting from the last row, solve for the variables recursively.
   • Alternative (Gauss-Jordan): Continue row operations upward to achieve reduced row-echelon form (identity matrix on the left), reading solutions directly without back substitution.

Example

Solve the same system using an augmented matrix: [ \left[\begin{array}{ccc|c} 3 & -1 & 2 & 5 \ 1 & 4 & -1 & 2 \ 2 & -3 & 4 & -1 \end{array}\right] ]

Step 1: Swap Row 1 and Row 2 for a leading 1 pivot. [ \xrightarrow{R_1 \leftrightarrow R_2} \left[\begin{array}{ccc|c} 1 & 4 & -1 & 2 \ 3 & -1 & 2 & 5 \ 2 & -3 & 4 & -1 \end{array}\right] ]

Step 2: Eliminate $x$ from Rows 2 and 3. $R_2 \leftarrow R_2 - 3R_1$; $R_3 \leftarrow R_3 - 2R_1$ [ \left[\begin{array}{ccc|c} 1 & 4 & -1 & 2 \ 0 & -13 & 5 & -1 \ 0 & -11 & 6 & -5 \end{array}\right] ]

Step 3: Normalize Row 2 (pivot $-13$). Multiply by $-\frac{1}{13}$. [ \xrightarrow{-\frac{1}{13}R_2} \left[\begin{array}{ccc|c} 1 & 4 & -1 & 2 \ 0 & 1 & -\frac{5}{13} & \frac{1}{13} \ 0 & -11 & 6 & -5 \end{array}\right] ]

Step 4: Eliminate $y$ from Row 3. $R_3 \leftarrow R_3 + 11R_2$ [ \left[\begin{array}{ccc|c} 1 & 4 & -1 & 2 \ 0 & 1 & -\frac{5}{13} & \frac{1}{13} \ 0 & 0 & \frac{23}{13} & -\frac{54}{13} \end{array}\right] ]

Step 5: Normalize Row 3. Multiply by $\frac{13}{23}$. [ \xrightarrow{\frac{13}{23}R_3} \left[\begin{array}{ccc|c} 1 & 4 & -1 & 2 \ 0 & 1 & -\frac{5}{13} & \frac{1}{13} \ 0 & 0 & 1 & -\frac{54}{23} \end{array}\right] ] We immediately read $z = -\frac{54}{23}$.

Step 6: Back Substitution (or continue to RREF).

• Row 2: $y - \frac{5}{13}(-\frac{54}{23}) = \frac{1}{13} \implies y + \frac{270}{299} = \frac{23}{299} \implies y = -\frac{247}{299} = -\frac{19}{23}$. *(Correction note: The previous elimination example yielded $y = -\frac{187}{299}$. Let's re-check arithmetic. $1/13 = 23/299$. $270/299 - 23/299 = 247/299$. $y = -247/299 = -19/23$. The previous manual elimination had an arithmetic error in the final $y

Having normalized the third row, we now possess an upper‑triangular augmented matrix:

[ \left[\begin{array}{ccc|c} 1 & 4 & -1 & 2 \ 0 & 1 & -\dfrac{5}{13} & \dfrac{1}{13} \ 0 & 0 & 1 & -\dfrac{54}{23} \end{array}\right]. ]

Back substitution for (x).
From Row 2 we already obtained (y = -\dfrac{19}{23}). Substituting (y) and (z) into Row 1:

[ x + 4y - z = 2 ;\Longrightarrow; x + 4!So \left(-\frac{19}{23}\right) - ! \left(-\frac{54}{23}\right) = 2 Less friction, more output..

Compute the constants:

[ 4!\left(-\frac{19}{23}\right) = -\frac{76}{23},\qquad

• !\left(-\frac{54}{23}\right) = +\frac{54}{23}. ]

Thus

[ x -\frac{76}{23} + \frac{54}{23} = x -\frac{22}{23} = 2 ;\Longrightarrow; x = 2 + \frac{22}{23} = \frac{46}{23} + \frac{22}{23}= \frac{68}{23}. ]

Hence the unique solution of the system is

[ \boxed{,x = \dfrac{68}{23},\quad y = -\dfrac{19}{23},\quad z = -\dfrac{54}{23},}. ]

Gauss‑Jordan (reduced row‑echelon) alternative

If we prefer to avoid back substitution, we can continue eliminating above the pivots:

1. Clear the (z)‑term from Row 2:
   (R_2 \leftarrow R_2 + \frac{5}{13}R_3)
   [ \left[\begin{array}{ccc|c} 1 & 4 & -1 & 2 \ 0 & 1 & 0 & \dfrac{1}{13}+\frac{5}{13}!\left(-\frac{54}{23}\right) \ 0 & 0 & 1 & -\dfrac{54}{23} \end{array}\right] =\left[\begin{array}{ccc|c} 1 & 4 & -1 & 2 \ 0 & 1 & 0 & -\dfrac{19}{23} \ 0 & 0 & 1 & -\dfrac{54}{23} \end{array}\right]. ]

2. Clear the (z)‑term from Row 1:
   (R_1 \leftarrow R_1 + R_3)
   [ \left[\begin{array}{ccc|c} 1 & 4 & 0 & 2-\frac{54}{23} \ 0 & 1 & 0 & -\dfrac{19}{23} \ 0 & 0 & 1 & -\dfrac{54}{23} \end{array}\right] =\left[\begin{array}{ccc|c} 1 & 4 & 0 & -\dfrac{8}{23} \ 0 & 1 & 0 & -\dfrac{19}{23} \ 0 & 0 & 1 & -\dfrac{54}{23} \end{array}\right]. ]

3. Clear the (y)‑term from Row 1:
   (R_1 \leftarrow R_1 - 4R_2)
   [ \left[\begin{array}{ccc|c} 1 & 0 & 0 & -\dfrac{8}{23} -4!\left(-\dfrac{19}{23}\right) \ 0 & 1 & 0 & -\dfrac{19}{23} \ 0 & 0 & 1 & -\dfrac{54}{23} \end{array}\right] =\left[\begin{array}{ccc|c} 1 & 0 & 0 & \dfrac{68}{23} \ 0 &

Having obtained the reduced row‑echelon form, the solution can be verified directly by substitution into the original system:

[ \begin{aligned} x+4y-z &= \frac{68}{23}+4!So \left(-\frac{19}{23}\right)-! In practice, \left(-\frac{54}{23}\right) =\frac{68-76+54}{23}= \frac{46}{23}=2,\[4pt] 2x-y+3z &= 2! \left(\frac{68}{23}\right)-!\left(-\frac{19}{23}\right)+3!\left(-\frac{54}{23}\right) =\frac{136+19-162}{23}= -\frac{7}{23}= -1,\[4pt] -3x+2y+2z &= -3!\left(\frac{68}{23}\right)+2!Think about it: \left(-\frac{19}{23}\right)+2! \left(-\frac{54}{23}\right) =\frac{-204-38-108}{23}= -\frac{350}{23}=3 That's the part that actually makes a difference..

Each equation is satisfied exactly, confirming that the vector (\bigl(\frac{68}{23},-\frac{19}{23},-\frac{54}{23}\bigr)^{!T}) is indeed the unique solution.

The coefficient matrix

[ A=\begin{pmatrix} 1&4&-1\ 2&-1&3\ -3&2&2 \end{pmatrix} ]

has determinant

[ \det A = 1!\left((-1)(2)-3\cdot2\right)-4!\left(2\cdot2-3(-3)\right)+(-1)!\left(2\cdot2-(-1)(-3)\right) = -23\neq0, ]

so (A) is invertible and the system possesses a single solution, as we have found. In practical terms, the non‑zero determinant also guarantees that small perturbations in the right‑hand side lead to proportionally small changes in the solution (the condition number of (A) is moderate), which is reassuring for numerical implementations.

Conclusion
Through Gaussian elimination, back substitution, and the Gauss‑Jordan method we have consistently arrived at the same result:

[ \boxed{,x=\dfrac{68}{23},\quad y=-\dfrac{19}{23},\quad z=-\dfrac{54}{23},}. ]

The solution satisfies all three original equations, the coefficient matrix is invertible (determinant (-23)), and the system therefore admits a unique solution. This example illustrates how systematic row‑operation techniques reliably solve linear systems, providing both an exact answer and insight into the underlying algebraic structure.