Systems of linear equations
In a minute
A system of linear equations asks for values of , and that make every equation true at once. You solve it by eliminating unknowns, by hand with an or with your GDC. Only three outcomes are possible: one solution, none, or infinitely many. You learn to tell them apart and to describe each one.
You'll be able to
- Solve up to three linear equations in three unknowns by elimination and by row reduction.
- Solve a system with your GDC, writing down the system you entered.
- Tell from the reduced system whether there is one solution, no solution or infinitely many.
- Recognise a system with no solution as , and find the parameter values that cause it.
- Write the in terms of a parameter when there are infinitely many solutions.
Before you start2 quick questions on what this builds on
Revise first: 2.1 Straight-line equations
Elimination and row reduction
In 2.1 you worked with straight lines. Two linear equations in and are two lines. Solving them together finds where the lines cross.
With three unknowns, an equation such as describes a plane in 3D space. Solving three of them together finds the points that lie on all three planes. You meet planes properly in 3.17.
The method is elimination, which you already use with two equations. Use one equation to remove from the other two. Then use one of those to remove from the last. One equation in is left: solve it, then substitute back.
Try it first, then reveal one step at a time.
- Label the equations (1), (2) and (3). Remove from (2): (2) (1) gives . Call this (4).
- Remove from (3): (3) (1) gives . Call this (5).
- From (4), . Substitute into (5): , so and .
- Back-substitute: . Then (1) gives .
- Check in (3), which you have not used directly: . It works.
Writing , and on every line is slow. An keeps only the numbers, one row per equation.
Try it first, then reveal one step at a time.
- Write the augmented matrix, swapping and so the first row starts with : .
- Clear the first column. gives , and gives .
- Divide the new by to get . Then the new minus times this row gives .
- Put the rows in staircase order: .
- Back-substitute from the bottom. , so . Then , so . Then , so .
- Check in the first original equation: . It works.
Solving with your GDC
On Paper 2 your GDC's simultaneous-equation solver does this in seconds: you type the row by row, and it returns , and .
Examiners can't see your screen. Write down the system, or its augmented matrix, before the values. That line shows your method.
Try it first, then reveal one step at a time.
- Each equation is already in the form , so you can read the rows straight off.
- Write down what you enter: .
- The solver gives , and
- Round each one to 3 s.f. Keep the zeros in : they show the precision.
- Check with the unrounded values in the third equation: .
If there is no unique solution, the solver says so or answers in terms of a free variable. Show which case it is by row reduction, as the next two sections do.
Many exam questions hide a system inside a context. Give each unknown a letter, write one equation for each fact, then solve.
Try it first, then reveal one step at a time.
- Each point gives one equation. With and : . Call this (1).
- With and : . With and : . Call these (2) and (3).
- Remove , which has coefficient in every equation. (2) (1) gives , so . (3) (2) gives , so .
- Subtract: , so . Then , and (1) gives .
- Check : . It works.
No solution: inconsistent systems
Sometimes row reduction ends with a row such as . Read it as an equation: , that is . No values of , and make that true.
In pictures, the three planes share no point. Either two of them are parallel and distinct, or each pair meets in a line and the three lines are parallel, like the sides of a prism.
Try it first, then reveal one step at a time.
- Write the : .
- gives , and gives .
- Now the new minus the new gives , which says .
- That is impossible, so no satisfies all three equations. The system is inconsistent.
- You can see why: the left side of the third equation is the sum of the first two, but , not .
Exam questions often put a , such as or , into the system. Reduce as usual, carrying the parameter along. Then ask what happens when its coefficient in the last row is zero.
Try it first, then reveal one step at a time.
- Remove . gives , and gives .
- Remove . The new minus the new gives , which says .
- If , you can divide: . Back-substitution then gives one value each for and , so there is a unique solution.
- If , the last row says . That is impossible, so the system is inconsistent.
- The right-hand side is never , so this system never has infinitely many solutions.
Infinitely many solutions: the general solution
Now suppose row reduction ends with a whole row of zeros, . It says : that equation was a combination of the others and adds nothing. If two independent equations are left for three unknowns, one unknown is free and the other two follow from it. There are infinitely many solutions.
In exam questions there are usually two independent equations left. Then exactly one unknown is free, so you need one parameter, , and the solutions form a line.
With only one independent equation left, two unknowns are free, so you need two parameters. If every equation is a multiple of , let and . Then , and the solutions fill a whole plane, not a line.
Here is the method when two independent rows are left. Reduce to . Let the free unknown, usually , equal . Solve the middle row for in terms of , then the top row for .
Try it first, then reveal one step at a time.
- There are two equations and three unknowns, so expect one unknown to be free.
- Remove by adding the equations: , so .
- Let . Then .
- From the first equation, .
- Check in the second equation: . It holds for every .
Each solution is the point . As varies, these points trace the line , where the planes meet. You write lines this way in 3.14, and 3.18 links each case to planes.
Your answer may look different from someone else's, for example if you let instead. Both are right if they describe the same line. Test yours by substituting it into every equation.
Try it first, then reveal one step at a time.
- Remove . gives , and gives .
- Both new rows have in the place and after the bar. Subtracting them leaves , which says .
- If , then , and the other rows fix and : one solution. If , this row is all zeros, so there are infinitely many solutions.
- With , two equations are left: and . Let . The second gives .
- Then . Check in : . It works.
Common mistakes
- Making the last row's coefficient zero and claiming infinitely many solutions. The right-hand side must be zero too; if it is not, there is no solution.
- Calling three planes that meet in a line parallel or coincident. Say they meet in a common line.
- Giving only and in terms of . A general solution states all three unknowns, including .
- Dividing by an expression such as without testing as a separate case.
- Changing the coefficients in a row but not the number after the bar.
Exam tips
- “Solve” on Paper 2: write down the system or augmented matrix you entered, then the solver's values to 3 s.f.
- “Find the value of ”: reduce until the last row holds only and numbers, then test the value of that makes its coefficient zero.
- “Interpret geometrically”: one solution means the three planes meet at a point, infinitely many usually means they meet in a common line (or all three are the same plane), and no solution means they share no point.
Key takeaways
Practise this
3 past-paper questions on 1.16 in the AA HL bank, each with a mark scheme and a worked explanation.