Q.Solve the following system of linear equations using the matrix method:
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →We solve the system by writing it in matrix form , finding using the adjoint method, and then computing . The unique solution is , , .
The matrix method turns a system of linear equations into a single compact equation: , where is the coefficient matrix, is the column of variables, and is the column of constants. If is invertible (determinant non-zero), we can multiply both sides by to get . This gives the solution directly, provided we can compute the inverse correctly.
Let’s set it up.
-
Write the system in matrix form.
The equations are:
Notice the third equation has no term — that’s fine; we just put a 0 in the coefficient matrix. So:
- Check if is invertible — compute . Expand along the first row:
Compute each:
- First:
- Second:
- Third:
So .
Since , exists.
-
Find the adjoint of .
The adjoint is the transpose of the cofactor matrix. Compute each cofactor , where is the minor (determinant after removing row , column ).
So the cofactor matrix is:
The adjoint (transpose) is: …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.