1.16 Systems of linear equations
Studying this course? Keep your progress in one place.
Key facts
- Up to three equations in three unknowns have a unique solution, infinitely many solutions or no solution.
- Solve by elimination (row reduction) by hand, and with the GDC.
- A row with means the system is inconsistent: no solution.
- A row gives infinitely many solutions: set a parameter and write the general solution.
- With an unknown coefficient, reduce to and split into cases.
Three types of solution
A system has exactly one of: a unique solution, infinitely many solutions, or none.
Each equation is a plane, which gives a geometric picture of the three cases. A row does not mean "no solution": it means one equation depended on the others, so there are infinitely many solutions (if nothing else is contradictory).
A unique solution gives one value of each unknown; an inconsistent system has no solution.
Unique solution
- Values for , ,
- Planes meet at one point
Infinitely many
- A row
- Planes meet in a line, or are the same plane
No solution
- A row ,
- No point on all three planes
Row reduction leads to the row . What does this tell you?
Elimination
Use one equation to eliminate from the other two, then eliminate , then back-substitute.
This is row reduction. Aim for zeros below the leading diagonal of the augmented matrix, then back-substitute.
Label the equations (1), (2), (3) and write the operation each time, such as (2) 2×(1). It earns method marks and prevents sign slips. Check the answer in all three original equations.
- 1
Eliminate
From equations (2) and (3)
- 2
Eliminate
From the resulting pair
- 3
Solve for
One equation left
- 4
Back-substitute
Find , then
- 5
Check
In all three originals
Worked example
Solve (1), (2), (3).
- 1
(2) 2×(1): (4).
- 2
(3) (1): (5).
- 3
(4) 3×(5): , so .
- 4
(5): . (1): .
- 5
Check: , , .
After finding by elimination, what is the next step?
Using technology
On Paper 2 use the GDC solver, write down the system you entered, then the answer.
Use the simultaneous equation solver or matrix row reduction. For , and you get , , .
A GDC will report an error or give a "free" variable when there is no unique solution. You must then work algebraically to decide between infinitely many solutions and none.
- 1
Enter
Type the system into the solver
- 2
Read
Write the system and the answer
- 3
Error?
No unique solution
- 4
Work by hand
Reduce to decide: infinitely many or none
Your GDC reports an error for a system of three equations. What should you do?
General solution
Set one unknown equal to a parameter and express the others in terms of it.
When reduction leaves two independent equations in three unknowns, set . The general solution describes a line, and every point on it satisfies all the equations.
Check it by substituting into every original equation: the parameter must cancel completely.
- (the parameter)
Worked example
Solve and .
- 1
Let .
- 2
From : .
- 3
From the first: .
For , what is ?
Unknown coefficients
Reduce until one equation reads , then split into cases.
When a coefficient or constant is unknown, reduce to a form such as and consider each case.
Do not divide by before dealing with the case separately.
- 1
Reduce
until the last row reads (a − 4)z = b − 7
- 2
a ≠ 4
divide by (a − 4): unique solution
- 3
a = 4 and b = 7
0 = 0: infinitely many solutions
- 4
a = 4 and b ≠ 7
0 = b − 7 ≠ 0: no solution
- Unique solution
,
- Infinitely many solutions
,
- No solution
A system reduces to . For which values is there no solution?
Try an exam question
Solve the system , , .
[4 marks]
- [1]Eliminates to get .
- [1]Obtains a second equation in and : .
- [1]Solves to find and .
- [1]Back-substitutes to find .
That's the notes covered.
Carry on to the next subtopic.
Try a question
Which equation in and only is obtained by eliminating from equations (1) and (2)?
1 mark, marked against the mark scheme
Which equation in and only is obtained by eliminating from equations (1) and (2)?
1 mark, marked against the mark scheme