IB Maths AA HLTopic 1 — Number & AlgebraPaper 1 & 2HL only~10 min read
Number of Solutions to a System
Up to now, every system you’ve solved has had exactly one neat answer. But linear systems don’t always cooperate. Sometimes there’s no solution at all — the equations contradict each other, like saying 0 = 5. Sometimes there are infinitely many solutions — the equations all describe the same line or plane. The good news is that row reduction tells you which case you’re in straight away. The bottom row of the reduced matrix is the giveaway: a row that says “0 = nonzero” means no solution; a row that says “0 = 0” means infinitely many. Once you can spot those patterns, the geometry follows naturally — parallel lines never meet, coincident lines overlap everywhere, and three planes can intersect in a single point, in a line, or not at all.
📘 What you need to know
Every system of linear equations has exactly one, none, or infinitely many solutions. There are no other possibilities.
An inconsistent system has no solutions. Row reduction produces an impossible row like [0 0 0 | 5] — i.e. “0 = 5”.
A consistent system has at least one solution. Either a unique solution (no zero rows) or infinitely many (one or more zero rows).
A dependent system is consistent with infinitely many solutions. Row reduction produces at least one row of all zeros: [0 0 0 | 0] — i.e. “0 = 0”.
The general solution of a dependent system is written using parameters: λ (one parameter) if one row is zero; λ and μ (two parameters) if two rows are zero.
Geometric meaning in 2D: unique → lines cross. None → parallel lines. Infinite → same line drawn twice.
Geometric meaning in 3D: unique → three planes meet at a point. None → planes don’t share a common point. Infinite → planes share a line, or all three coincide.
To find the value of a parameter that makes a system dependent, row reduce until you see the bottom row, then set the constant on the right-hand side equal to 0.
The three cases — unique, none, or infinite
For any system of linear equations, exactly one of the following is true:
Unique solution
consistent
one (x, y, z) satisfies every equation
No solution
inconsistent
equations contradict — no values work
Infinite solutions
consistent & dependent
a whole line or plane of solutions
There are only three cases. You can’t have a system with two solutions, or seven, or 100 — the structure of linear equations forces it to be 1, 0, or ∞. This is one of the cleanest classification results in the whole HL syllabus.
What each case looks like geometrically
For 2×2 systems (two lines in 2D), the three cases are easy to picture:
2×2 systems — three cases visualised
For 3×3 systems (three planes in 3D), the picture is richer but the three cases still apply:
Unique
3 planes meet at a point
one (x, y, z) shared by all three
None
no shared point
at least one plane parallel to another, or planes form a triangular prism
Infinite
share a line or all coincide
a 1-parameter family (line) or a 2-parameter family (plane)
🤔 Why “1-parameter” and “2-parameter” families?
Because the dimension of the solution set tells you how many free variables you need. If three planes share a common line, picking any value for one variable forces the other two — so you need one parameter, λ. If three planes all coincide, picking values for two variables determines the third — so you need two parameters, λ and μ.
Inconsistent systems — when row reduction hits a wall
An inconsistent system is one where the equations contradict each other — no values for the variables can make them all true at once.
Inconsistent system signature
row reduction gives a row of the form [0 0 0 | k] with k ≠ 0
i.e. “k = 0″ where k is non-zero — impossible
The moment you spot such a row, you can stop the row reduction immediately and conclude: no solution. There’s no point continuing the algorithm because the system has no answer to find.
Geometric meaning: in 2D, two parallel lines that never cross. In 3D, planes arranged so no point lies on all of them — for instance, three pairwise-intersecting planes whose three intersection lines don’t meet (a “triangular prism” of intersections).
Dependent systems — when one equation is redundant
A dependent system has at least one equation that’s a combination of the others — it doesn’t add new information. After row reduction, this redundancy shows up as a row where everything is zero, including the right-hand side.
Dependent system signature
row reduction gives at least one row of the form [0 0 0 | 0]
i.e. “0 = 0” — always true, gives no extra constraint
You’d expect three constraints from a 3×3 system, but a “0 = 0” row contributes nothing. So the system is effectively underdetermined, and there are infinitely many solutions.
Writing the general solution using parameters
To express the infinite family of solutions, introduce a parameter (λ) for each missing constraint. The procedure depends on how many zero rows appear:
🧭 Recipe — finding the general solution of a dependent system
Row reduce until you reach echelon form. Count the zero rows.
One zero row → introduce one parameter λ. Set the variable corresponding to the zero row equal to λ.
Two zero rows → introduce two parameters λ and μ. Set the two variables corresponding to the zero rows equal to λ and μ respectively.
Use the remaining (non-zero) rows to express the other variables in terms of λ (and μ).
Write the final answer as x = …, y = …, z = …, all in terms of the parameter(s), and state that λ ∈ ℝ (and μ ∈ ℝ if needed).
A common convention: when only one zero row appears, set z = λ and find y, x in terms of λ. The choice of which variable to parameterise is up to you, but using z usually keeps the algebra cleanest because back-substitution is already going from z upwards.
“Find the value of k” — parameter questions
A common exam style: a 3×3 system contains an unknown constant (often called k), and you’re told the system has either no solution or infinitely many. Your job is to find the value of k that makes that happen.
🧭 Recipe — find k for infinite solutions or no solution
Set up the augmented matrix with k in place.
Row reduce all the way to echelon form. The bottom row will end up looking like [0 0 0 | (something involving k)].
For infinite solutions: set the something equal to 0. Solve for k.
For no solution: state that k is anything except the value that gave 0.
If asked for the general solution, substitute that value of k back in, then apply the parameter recipe above.
Worked examples
WE 1
Identify the type of system from a row-reduced matrix
Each of the following matrices has been row-reduced. State whether the system has a unique solution, no solution, or infinitely many solutions.
(a) [1 2 1 | 4] / [0 1 3 | 5] / [0 0 1 | 2]
(b) [1 0 3 | 7] / [0 1 −2 | 1] / [0 0 0 | 4]
(c) [1 2 3 | 6] / [0 1 1 | 2] / [0 0 0 | 0]
(a) Bottom row: 0x + 0y + z = 2 → z = 2all three rows give clean info, full staircase(a) unique solution(b) Bottom row: 0 = 4 — impossiblecontradictory row(b) no solution (inconsistent)(c) Bottom row: 0 = 0 — always trueredundant row, only 2 real constraints on 3 unknowns(c) infinitely many solutions (dependent)always look at the BOTTOM row first — it tells you which of the three cases you’re in
WE 2
Show that a 2×2 system has no solution
Show that the following system has no solution:
2x + 3y = 5
4x + 6y = 13
Step 1: Augmented matrix[2 3 | 5][4 6 | 13]Step 2: Apply r₂ − 2r₁ → r₂row 2: [4−4, 6−6, 13−10] = [0, 0, 3][2 3 | 5][0 0 | 3]Step 3: Read the bottom row“0x + 0y = 3” — impossibleno solution — the system is inconsistentgeometric: the two equations represent parallel lines (both slope −2/3) with different intercepts, so they never cross
WE 3
Find the general solution of a dependent 2×2 system
Show that the system below has infinitely many solutions, and write the general solution using a parameter λ: x + 2y = 4
3x + 6y = 12
Step 1: Augmented matrix[1 2 | 4][3 6 | 12]Step 2: Apply r₂ − 3r₁ → r₂row 2: [3−3, 6−6, 12−12] = [0, 0, 0][1 2 | 4][0 0 | 0]Step 3: “0 = 0” → infinitely many solutionsonly one constraint left (the top row): x + 2y = 4Step 4: Set y = λ, find x in terms of λx + 2λ = 4 → x = 4 − 2λgeneral solution: x = −2λ + 4, y = λ, for λ ∈ ℝgeometrically, both equations describe the SAME line — every point on it is a solution
WE 4
Show that a 3×3 system has no solution
Determine whether the following system has a solution: x + y + z = 6
2x + 2y + 2z = 10 x + 2y − z = 3
Step 1: Augmented matrix[1 1 1 | 6][2 2 2 | 10][1 2 −1 | 3]Step 2: r₂ − 2r₁ → r₂ and r₃ − r₁ → r₃r₂: [0, 0, 0, 10−12] = [0, 0, 0, −2]r₃: [0, 1, −2, 3−6] = [0, 1, −2, −3][1 1 1 | 6][0 0 0 | −2][0 1 −2 | −3]Step 3: Spot the inconsistent rowrow 2 reads “0 = −2” — impossibleno solution — the system is inconsistentthe second original equation 2x+2y+2z=10 simplifies to x+y+z=5, which contradicts the first equation x+y+z=6 — that’s the source of the conflict
WE 5
Find the general solution of a dependent 3×3 system
Show that the system below has infinitely many solutions, and find the general solution: x + 2y + z = 7 x + y − z = 1
2x + 3y = 8
Step 1: Augmented matrix (note the missing z in row 3 → coefficient 0)[1 2 1 | 7][1 1 −1 | 1][2 3 0 | 8]Step 2: r₂ − r₁ → r₂ and r₃ − 2r₁ → r₃r₂: [0, −1, −2, −6]r₃: [0, −1, −2, −6][1 2 1 | 7][0 −1 −2 | −6][0 −1 −2 | −6]Step 3: r₃ − r₂ → r₃ kills the third row[0, 0, 0, 0][1 2 1 | 7][0 −1 −2 | −6][0 0 0 | 0]Step 4: Negate r₂ to get a clean leading 1[1 2 1 | 7][0 1 2 | 6][0 0 0 | 0]Step 5: One zero row → set z = λy + 2z = 6 → y = 6 − 2λx + 2y + z = 7 → x = 7 − 2(6−2λ) − λ = 7 − 12 + 4λ − λ = 3λ − 5x = 3λ − 5, y = −2λ + 6, z = λ, for λ ∈ ℝverify with eq2: (3λ−5) + (−2λ+6) − λ = 3λ − 2λ − λ + 1 = 0λ + 1 = 1 ✓
WE 6
Find the value of k for infinite solutions, then find the general solution
The system below depends on a real constant k: x + y + z = 4 x + 2y − z = 3 x + 3z = k
(a) Find the value of k for which the system has infinitely many solutions.
(b) For that value of k, find the general solution.
Part (a) — set up matrix with k in place[1 1 1 | 4][1 2 −1 | 3][1 0 3 | k]Apply r₂ − r₁ → r₂ and r₃ − r₁ → r₃[1 1 1 | 4][0 1 −2 | −1][0 −1 2 | k − 4]Apply r₃ + r₂ → r₃[1 1 1 | 4][0 1 −2 | −1][0 0 0 | k − 5]For infinite solutions, the bottom row must read “0 = 0”k − 5 = 0 → k = 5(a) k = 5Part (b) — substitute k = 5 and find general solution[1 1 1 | 4][0 1 −2 | −1][0 0 0 | 0]one zero row → set z = λy − 2z = −1 → y = 2λ − 1x + y + z = 4 → x = 4 − (2λ − 1) − λ = 5 − 3λ(b) x = −3λ + 5, y = 2λ − 1, z = λ, for λ ∈ ℝnotice for any other value of k, the bottom row reads “0 = (nonzero)” — inconsistent → no solution
💡 Top tips
Always check the bottom row first. If it’s “0 = nonzero” → no solution. If it’s “0 = 0” → infinite solutions. Otherwise, unique.
Stop early when you spot inconsistency. The moment a [0 0 0 | nonzero] row appears, conclude “no solution” — there’s no need to finish reducing.
Use λ for one parameter, λ and μ for two. The number of zero rows tells you how many parameters you need.
Always state the parameter range: “for λ ∈ ℝ” at the end of a general solution. Examiners look for it.
Convention: parameterise z first. If the third row is zero, set z = λ — this matches the back-substitution flow naturally.
Verify your general solution by plugging it into the original equations. Each one should reduce to a true statement (with all λ‘s cancelling).
Geometric interpretation can be a separate mark. “Three planes meet in a line” or “two parallel lines” can earn you a method mark — write the geometric phrase explicitly when asked.
⚠ Common mistakes
Confusing inconsistent (0 = nonzero) with dependent (0 = 0). The right-hand side is the giveaway — zero on the right means infinite solutions; nonzero means no solutions.
Reporting a single solution for a dependent system. If a row is all zeros, there are infinitely many solutions, not one specific point. State the full parameterised family.
Dropping the parameter range “λ ∈ ℝ”. Without it, the answer is incomplete — the parameter could be any real number.
Mixing up which variable to parameterise. The variable you set equal to λ should correspond to the column of the zero row. With the standard staircase, this is usually z.
Forgetting to handle the k-as-constant case before deciding. When k is unknown, you must row reduce all the way before you can determine which value of k gives no/infinite/unique solutions.
Saying “k can be anything” for no solution. Be precise: “k ≠ (the value that gave 0)” — name the excluded value.
Trying to solve a contradictory system on a GDC. The calculator usually returns an error or “no solution” — interpret that as the inconsistent case, not as a calculator failure.
And with this, you’ve completed the entirety of Topic 1 — Number & Algebra for IB Maths AA HL — every section, every result, every technique. From standard form and binomial expansion all the way through proof, complex numbers, and now systems of linear equations, you’ve built up a complete algebraic toolkit. The big themes that recur — pattern, structure, generalisation — will keep showing up everywhere in the rest of the syllabus, especially in Calculus and Statistics. For now, take a moment to appreciate how far you’ve come. Topic 1 is the longest in the AA HL syllabus, and you’ve worked through all of it. Onward to Topic 2!
Need help with Number of Solutions?
Get 1-on-1 help from an IB examiner who knows exactly what Paper 1 & 2 are looking for.
