Gaussian elimination
Objective. Reduce augmented matrices with controlled row operations.
- 1. Learn
- 2. Worked example
- 3. Practice
- 4. Feedback
- 5. Continue
Learn: the key idea
Gaussian elimination solves a system of linear equations by writing them as an augmented matrix and applying row operations—swapping rows, multiplying a row by a non-zero constant, or adding a multiple of one row to another—to reduce the matrix to row-echelon form, where each row has more leading zeros than the one above. Back-substitution then solves for the unknowns starting from the simplest (last) equation and working upwards. For example, reducing a 3×3 system systematically eliminates one variable per row, leaving a triangular system that is solved step by step from the bottom.
Worked example
Use Gaussian elimination to solve the system x + y + z = 6, 2y + 5z = −4, 2x + 5y − z = 27.
- 1Eliminate x from the third equation: R3 − 2R1 gives 2x+5y−z−2(x+y+z) = 27−12, so 3y−3z=15, i.e. y−z=5
- 2From the second equation, 2y+5z=−4; substitute y=z+5: 2(z+5)+5z=−4, so 7z+10=−4, giving 7z=−14, z=−2
- 3Then y = z+5 = 3
- 4Substitute into the first equation: x+3+(−2)=6, so x=5
Answer: x = 5, y = 3, z = −2
Concept mastery
Based on your past attempts at this lesson — the question types to practise again come first.
Complete a practice set to see your concept breakdown here.
Practice
Practice happens on its own screen, one question at a time. Answers stay hidden until you submit yours, and you can stop and pick up at the same question later.
Start practisingCommon mistake. Students perform row operations inconsistently, such as adding a multiple of one row to another without updating every entry in that row, which corrupts the solution. Always apply the chosen operation to every entry of the row, including the right-hand side constants.
Your progress
Tick each step as you finish it. Your exact reading position is saved automatically, so Continue drops you back on the same line.
0 of 5 steps complete
Your place saves automatically as you read.