On a TI-84 Plus CE
- Enter a matrix with 2nd → MATRX → EDIT. Determinant: det([A]); inverse: [A] then the x⁻¹ key.
- Solve A x = b by computing [A]⁻¹[b].
Tip: If det(A) = 0 there is no unique solution - the system has no solution or infinitely many.
Inverses, determinants and solving linear systems are quick and reliable on the GDC.
In short: Matrix operations on a GDC include adding, multiplying, finding the determinant and the inverse, and solving systems of equations. You enter each matrix in the matrix menu and combine them using the names you gave them. Check that the dimensions match before multiplying, and use the inverse or row reduction to solve linear systems.
| TI-84 Plus CE | Casio fx-CG50 and fx-CG100 | TI-Nspire CX | |
|---|---|---|---|
| Key sequence | Enter a matrix with 2nd → MATRX → EDIT. Determinant: det([A]); inverse: [A] then the x⁻¹ key. | Run-Matrix → MAT/VCT (F3) to enter a matrix; use Det and the x⁻¹ key. | Use the matrix template (or menu → Matrix & Vector). det(), and ^-1 for the inverse. |
Tip: If det(A) = 0 there is no unique solution - the system has no solution or infinitely many.
Tip: If det(A) = 0 there is no unique solution - the system has no solution or infinitely many.
Tip: If det(A) = 0 there is no unique solution - the system has no solution or infinitely many.
Here's a real IB-style question that uses exactly this technique.
Given A = [[2, 1], [1, 3]] and b = [5, 10], find A⁻¹ and use it to solve Ax = b.
Inverses, determinants and solving linear systems are quick and reliable on the GDC. Finding the inverse or determinant of a matrix quickly, without expanding by hand. Solving a linear system written in matrix form, Ax = b.
1. Enter a matrix with 2nd → MATRX → EDIT. Determinant: det([A]); inverse: [A] then the x⁻¹ key. 2. Solve A x = b by computing [A]⁻¹[b].
1. Run-Matrix → MAT/VCT (F3) to enter a matrix; use Det and the x⁻¹ key. 2. Solve A x = b by computing [A]⁻¹[b].
1. Use the matrix template (or menu → Matrix & Vector). det(), and ^-1 for the inverse. 2. Solve A x = b by computing [A]⁻¹[b].
If det(A) = 0 there is no unique solution - the system has no solution or infinitely many.
In the worked example on this page (4 marks, Paper 2), the marks are: M1: Find A⁻¹; M1: Compute A⁻¹b; A1: x = 1, y = 3.
Questions that need this technique link back to this guide. Try one in practice mode, or see every GDC guide.