Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

How to Tell How Many Solutions a System Has

Every linear system has exactly one solution, no solution, or infinitely many. Row-reduce the augmented matrix: a row that reads 0=d0 = d with d≠0d \neq 0 means none; otherwise the number of pivots decides between one and infinitely many.

Recognize the task

Questions such as "is the system consistent?", "does it have a unique solution?", "for which kk does it have no solution?", or any system you are about to solve. Typical forms: square systems, systems with a parameter kk, more equations than unknowns, more unknowns than equations. Test: you need the number of solutions, not necessarily the solutions themselves.
The conditions are proved in the solvability lesson.

Two ways to do it

Reduce and compare ranksany system
rank⁡(A)=rank⁡[A∣b]=r: r=n⇒one, r<n⇒∞\operatorname{rank}(A) = \operatorname{rank}[A \mid \mathbf{b}] = r: \ r = n \Rightarrow \text{one}, \ r < n \Rightarrow \infty
Works for every shape; this is the Rouché–Capelli theorem.
Determinant testsquare only
det⁡(A)≠0  ⇒  exactly one solution\det(A) \neq 0 \;\Rightarrow\; \text{exactly one solution}
Quick for a 2×22 \times 2 or 3×33 \times 3 coefficient matrix (invertible matrix theorem). If det⁡(A)=0\det(A) = 0, reduce to tell none from infinitely many.

Steps

StepOn x+y+z=2, x+2y+3z=5, 2x+3y+4z=8x + y + z = 2,\ x + 2y + 3z = 5,\ 2x + 3y + 4z = 8
1Write the augmented matrix. Keep the constants; they decide whether a solution exists.[111212352348]\left[\begin{array}{ccc|c} 1 & 1 & 1 & 2 \\ 1 & 2 & 3 & 5 \\ 2 & 3 & 4 & 8 \end{array}\right]
2Reduce to echelon form. The forward pass of Gaussian elimination is enough; no back substitution needed.R2−R1, R3−2R1, R3−R2R_2 - R_1,\ R_3 - 2R_1,\ R_3 - R_2: last row [0 0 0∣1][0\ 0\ 0 \mid 1]
3Look for a contradictory row. A row [0⋯0∣d][0 \cdots 0 \mid d] with d≠0d \neq 0 says 0=d0 = d: no solution. A full zero row [0⋯0∣0][0 \cdots 0 \mid 0] is harmless.0=10 = 1: no solution
4Otherwise count the pivots of A. The count rr is the rank. Compare it with the number of unknowns nn.here rank⁡(A)=2<rank⁡[A∣b]=3\operatorname{rank}(A) = 2 < \operatorname{rank}[A \mid \mathbf{b}] = 3
5State the answer. r=nr = n: exactly one solution. r<nr < n: infinitely many, with n−rn - r free parameters (free variables count).inconsistent: no solution

Worked examples

Example 1 · one solution

rank = n
x+2y=4, 3x−y=5x + 2y = 4,\ 3x - y = 5
R2−3R1R_2 - 3R_1: [0 −7∣−7][0\ {-7} \mid {-7}]
no contradiction
22 pivots, 22 unknowns: exactly one (x=2, y=1x = 2,\ y = 1)
rank equals nn

Example 2 · infinitely many

rank < n
x+y+z=2, x+2y+3z=5, 2x+3y+4z=7x + y + z = 2,\ x + 2y + 3z = 5,\ 2x + 3y + 4z = 7
last constant now 77
reduction ends in [0 0 0∣0][0\ 0\ 0 \mid 0]
harmless zero row
r=2<3r = 2 < 3: infinitely many, 11 free parameter
n−r=1n - r = 1

Example 3 · a parameter

for which k and h?
x+y=1, 2x+ky=hx + y = 1,\ 2x + ky = h
R2−2R1R_2 - 2R_1: [0  k−2∣h−2][0\ \ k - 2 \mid h - 2]
everything hangs on this row
k≠2k \neq 2: a pivot, so exactly one solution
k=2, h≠2k = 2,\ h \neq 2: none; k=2, h=2k = 2,\ h = 2: infinitely many
0=h−20 = h - 2
See the three cases as lines and planes in the linear system solutions visualizer.

See it happen

Two equations in two unknowns are two lines: they cross once, are parallel, or are the same line. Row reduction detects which. Parallel lines reduce to 0=d0 = d, the same line reduces to a zero row and leaves a free variable, and crossing lines give a pivot in every column. Planes in three dimensions behave the same way.

Common mistakes

A zero row read as no solution

✗ [0 0 0∣0][0\ 0\ 0 \mid 0]: "inconsistent"
✓ it says 0=00 = 0; only [0 0 0∣d][0\ 0\ 0 \mid d] with d≠0d \neq 0 is a contradiction

Counting the pivot in the constant column

✗ 33 pivots in [A∣b][A \mid \mathbf{b}] and 33 unknowns: "unique"
✓ a pivot in the last column is the row 0=d0 = d: no solution

Zero determinant read as no solution

✗ x+y=1, 2x+2y=2x + y = 1,\ 2x + 2y = 2: det⁡=0\det = 0, "no solution"
✓ det⁡=0\det = 0 only rules out exactly one; here there are infinitely many

More equations than unknowns means no solution

✗ x+y=3, x−y=1, 2x+y=5x + y = 3,\ x - y = 1,\ 2x + y = 5: "overdetermined, inconsistent"
✓ reduce first: x=2, y=1x = 2,\ y = 1 satisfies all three