Cramer’s rule
Our editors will review what you’ve submitted and determine whether to revise the article.
- CORE - Application of the Cramer rule in the solution of sparse systems of linear algebraic equations
- Mathematics LibreTexts - Determinants and Cramer’s Rule
- BCcampus Open Publishing - Intermediate Algebra - Solve systems of equations using determinants
- Story of Mathematics - Cramer’s Rule – Explanation and Examples
- Academia - Cramer's Rule and Inverse Matrix
- Al-Mustaqbal University - Solution by Cramer’s Rule
- University of Utah - Department of Mathematics - Determinants and Cramer’s Rule
- Cornell University - Department of Mathematics - Inverse of a matrix and Cramer’s rule
- Open Library Publishing Platform - Solving Systems with Cramer’s Rule
- University of Alaska Anchorage - Alaska Digital Texts - Determinants and Cramer’s Rule
- Calvin University - Cramer’s Rule
Cramer’s rule, in linear and multilinear algebra, procedure for solving systems of simultaneous linear equations by means of determinants (see also determinant; linear equation). Although Cramer’s rule is not an effective method for solving systems of linear equations in more than three variables, it is of use in studying how the solutions to a system AX = B depend on the vector B. If is a system of n simultaneous linear equations in n unknowns, then a solution of this system is in which det A is the determinant of the matrix A (in which the elements of each row are the coefficients aij of one of the equations) and the matrix Bi is formed by replacing the ith column of A by the column of constants b1,…, bn.
If det A equals zero, the system has no unique solution; that is, there is no set x1,…, xn that satisfies all of the equations.