LINEAR ALGEBRA HOMEWORK CENTER

Linear Systems Calculator & Homework Helper

Solve systems of linear equations, see every row operation, understand why the method works, and practice the skills used in linear algebra homework.

Ready for a challenge? The page also holds three Zul'Elkoen mission challenges that turn linear systems into navigation, engineering and reactor problems.

CALCULATOR

Solve a Linear System

ENTRY MODE

SIZE

Use variables like x, y, z, w. Example: 2x + y - z = 8

METHOD

MODE

APPLIED LINEAR ALGEBRA

Real-World Examples

TWO WAYS TO LEARN

Quick Solve vs. Homework Mode

Quick Solve shows the full calculation and the completed answer immediately — perfect for checking your work.

Homework Mode reveals the solution one row operation at a time. Press Next Step to advance, then Show Final Answer once every operation is visible. This trains you to perform each step yourself before seeing the result.

THE THEORY

Why This Works

A system of linear equations is a set of equations where each equation is a straight line (or plane, or hyperplane). Solving the system means finding every point that lies on all of those surfaces at once.

The key insight is that three elementary row operations — swapping two rows, multiplying a row by a nonzero scalar, and adding a multiple of one row to another — produce a system with exactly the same solutions as the original. By applying these operations we reshape the augmented matrix $[A \mid b]$ into reduced row echelon form (RREF), where the solution can be read off directly.

Row echelon form (REF): each pivot is 1, with zeros below it.

Reduced row echelon form (RREF): each pivot is 1, with zeros both above and below.

WORKED EXAMPLES

Walk Through the Process

Unique Solution (3×3)

Solve the system with Gaussian elimination.

Augmented matrix

\left[\begin{array}{ccc|c} 2 & 1 & -1 & 8 \\ -3 & -1 & 2 & -11 \\ -2 & 1 & 2 & -3 \end{array}\right]

After row reduction the RREF is the identity, giving the unique solution x = 2, y = 3, z = −1.

Inconsistent System (No Solution)

A system where two equations contradict each other.

Augmented matrix

\left[\begin{array}{cc|c} 1 & 1 & 3 \\ 1 & 1 & 3 \\ 1 & 1 & 4 \end{array}\right]

Row reduction produces a row [0 0 | 1], which represents 0 = 1 — an impossibility. The system has no solution.

Infinitely Many Solutions

Two equations that describe the same line.

Augmented matrix

\left[\begin{array}{cc|c} 1 & 2 & 4 \\ 2 & 4 & 8 \end{array}\right]

The second row is a multiple of the first, so there is only one pivot and one free variable. The solution is a line: y = (4 − x)/2.

CHECK ON LEARNING

Reading Reduced Matrices

1.An RREF augmented matrix is $\left[\begin{array}{cc|c}1 & 0 & 5 \\ 0 & 1 & -2 \end{array}\right]$

2.An RREF augmented matrix is $\left[\begin{array}{ccc|c}1 & 0 & 3 & 1 \\ 0 & 1 & -1 & 4 \\ 0 & 0 & 0 & 0 \end{array}\right]$

3.An RREF augmented matrix is $\left[\begin{array}{cc|c}1 & 2 & 4 \\ 0 & 0 & 1 \end{array}\right]$

CORE CONCEPTS

Key Terms and Methods

Coefficient & Augmented Matrix

The coefficient matrix $A$ holds the variable coefficients. Appending the constants $b$ as a final column gives the augmented matrix $[A \mid b]$ .

Pivot Position

A pivot is the first nonzero entry in a row of a matrix in echelon form. The column containing a pivot is a pivot column; the corresponding variable is a basic (pivot) variable.

Free Variables

A variable whose column has no pivot. Free variables can take any value, and each choice gives a different solution — the hallmark of infinitely many solutions.

Consistent vs. Inconsistent

A consistent system has at least one solution. An inconsistent system has none — signaled by a row $[0\ 0\ \cdots \mid c],\ c \ne 0$ .

Gaussian vs. Gauss-Jordan

Gaussian elimination reaches REF (back-substitution needed). Gauss-Jordan continues to RREF so the solution is read directly.

Cramer's Rule & Inverse Method

Both require a square, nonsingular coefficient matrix ( $\det(A) \ne 0$ ). Cramer uses ratios of determinants; the inverse method computes $x = A^{-1}b$ .

COMMON MISTAKES

Avoid These Errors

Operating on only part of a row

INCORRECT

Multiplying just the left side of an augmented row by 2 but forgetting the constant column.

CORRECT

Every elementary row operation applies to the entire row, including the augmented constant.

Why: An augmented row represents a full equation. Changing only the coefficients breaks the equality.

Forgetting the augmented column

INCORRECT

Row-reducing only the coefficient matrix A and ignoring the constants b.

CORRECT

Always row-reduce the full augmented matrix [A | b] so the constants transform with the equations.

Why: The constants are part of each equation; leaving them out produces the solution to a different system.

Confusing REF and RREF

INCORRECT

Stopping at upper-triangular (REF) and reading off the answer as if pivots were the only nonzero entries.

CORRECT

Gauss-Jordan continues eliminating above each pivot to reach RREF, where every pivot column has a single 1.

Why: REF still requires back-substitution; only RREF lets you read solutions directly.

Dividing by zero

INCORRECT

Using a 0 entry as a pivot and dividing the row by it.

CORRECT

If the prospective pivot is 0, swap with a lower row that has a nonzero entry in that column (partial pivoting).

Why: Division by zero is undefined and breaks the computation. A swap is a valid elementary operation.

Misidentifying free variables

INCORRECT

Calling a column a free variable just because it contains a zero in one row.

CORRECT

A variable is free only if its column contains no pivot position in the RREF.

Why: Free variables are determined by pivot columns, not by individual zero entries.

Misreading 0 = 0

INCORRECT

Treating an all-zero row [0 0 … | 0] as 'no solution'.

CORRECT

An all-zero row means 0 = 0, which is always true — it is a redundant equation, not a contradiction.

Why: Only a row [0 0 … | nonzero] (0 = nonzero) signals inconsistency. 0 = 0 just removes an equation.

Using Cramer's Rule when det(A) = 0

INCORRECT

Applying Cramer's Rule to a singular coefficient matrix.

CORRECT

Cramer's Rule requires a square coefficient matrix with a nonzero determinant. Otherwise use Gaussian elimination.

Why: Cramer's Rule divides by det(A); when det(A) = 0 the division is undefined.

Using an inverse that doesn't exist

INCORRECT

Solving via x = A⁻¹b when A is singular.

CORRECT

Check det(A) ≠ 0 first. If det(A) = 0, A has no inverse — use row reduction to classify the system.

Why: A singular matrix has no inverse by definition, so A⁻¹ does not exist.

CHECK ON LEARNING

How Many Solutions?

1.RREF: $\left[\begin{array}{cc|c}1 & 0 & 3 \\ 0 & 1 & 7 \end{array}\right]$

2.RREF: $\left[\begin{array}{cc|c}1 & 1 & 5 \\ 0 & 0 & 2 \end{array}\right]$

3.RREF: $\left[\begin{array}{cc|c}1 & 2 & 6 \\ 0 & 0 & 0 \end{array}\right]$

KNOWLEDGE CHECK

Linear Algebra Quiz

Q1.Which operation is a valid elementary row operation?

Q2.A reduced augmented matrix contains the row [0 0 0 | 7]. What does this indicate?

Q3.What is the primary goal of Gauss-Jordan elimination?

Q4.A variable corresponding to a column without a pivot is usually called:

Q5.Cramer's Rule requires a square coefficient matrix and:

Q6.What does a row consisting entirely of zeros represent?

Q7.Which method checks a calculated solution most directly?

Back to Serious Calculations

Linear Systems Calculator & Homework Helper

Solve a Linear System

Real-World Examples

Quick Solve vs. Homework Mode

Why This Works