Let's say there is a system of three equations with variables as above.
What is the minimum number of coefficients (denoted by letters ) that must be zero such that the system cannot be solved using Cramer's rule?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The system of equations cannot be solved using Cramer's rule, when the determinant of coefficients is 0 . The determinant of coefficients equals 0 when any two rows or columns of coefficients are dependent. For example, when a = n e , b = n f and c = n g or a = n b , e = n f , j = n k for any value of n . Therefore, the required answer is 0 .