Compute
Reduce before expanding. A blind cofactor expansion of a needs four determinants. Adding a multiple of one row to another leaves the determinant unchanged, so it is far cheaper to first create a column with a single nonzero entry.
Clear the first column using row 3. Row starts with , and the other first-column entries are , and , so
gives
Expand along the first column. Only the entry in position survives, and its cofactor sign is :
(The minor keeps rows and columns of the reduced matrix.)
Evaluate the 3×3 minor. Subtract row from row to get , then expand along that row:
Multiply back.
Check by direct cofactor expansion along the third row. Expanding the original matrix along gives with the appropriate signs; carrying that out also returns . The agreement of two independent routes is the check that no row operation was mis-signed.
Need to solve a different problem like this? Open the solver →