A student wants to solve a 10×10 system of linear equations numerically and suggests using Cramer's rule because 'it gives an exact answer directly.' What is the key problem with this reasoning?
ACramer's rule only works for 2×2 and 3×3 systems
BCramer's rule requires the determinant of A to equal exactly 1
CCramer's rule requires computing 11 determinants of 10×10 matrices, making it far more expensive than Gaussian elimination, which would give the exact same answer far more efficiently
DThere is no problem — Cramer's rule is the standard method for any square system
Gaussian elimination solves an n×n system in O(n³) operations. Cramer's rule requires computing n+1 determinants, each costing O(n³), for a total of O(n⁴). For n=10, Cramer's rule does roughly 10× more work for the same result. Cramer's rule does give an exact answer — but so does Gaussian elimination, much faster. The 'exact' framing is a red herring; the real issue is computational cost.
Question 2 Multiple Choice
In which situation is Cramer's rule most appropriately used?
ASolving a large sparse system of equations numerically on a computer
BDeriving a closed-form symbolic expression for how a solution variable depends on the parameters of a system
CChecking whether a square system has a unique solution
DComputing a numerical solution when Gaussian elimination fails to converge
Cramer's rule's value is theoretical: it gives explicit, closed-form expressions xᵢ = det(Aᵢ)/det(A). This is useful when you need to analyze how solutions vary with parameters, prove structural results, or compute matrix inverses symbolically. For numerical computation — especially large systems — Gaussian elimination is the right tool. Checking for a unique solution just requires checking det(A) ≠ 0, not Cramer's rule.
Question 3 True / False
Cramer's rule and Gaussian elimination produce the same solution for any square system with a nonzero determinant; the only difference is computational cost.
TTrue
FFalse
Answer: True
Both methods solve the same mathematical problem and yield the same exact solution. Cramer's rule is not more accurate or more 'exact' than Gaussian elimination — they are algebraically equivalent. The difference is purely in efficiency: Cramer's rule is O(n⁴), Gaussian elimination is O(n³).
Question 4 True / False
Cramer's rule can be applied to any system of linear equations, including underdetermined systems (more unknowns than equations) and overdetermined systems (more equations than unknowns).
TTrue
FFalse
Answer: False
Cramer's rule requires a square system (n equations, n unknowns) with det(A) ≠ 0, guaranteeing a unique solution. Underdetermined systems have infinitely many solutions; overdetermined systems are typically inconsistent or have no unique solution. In both cases, the coefficient matrix is not square and has no determinant in the relevant sense.
Question 5 Short Answer
Why is Cramer's rule described as 'theoretically elegant but computationally expensive'? Explain both sides of this claim.
Think about your answer, then reveal below.
Model answer: It is theoretically elegant because it gives an explicit closed-form formula for each solution variable as a ratio of determinants — xᵢ = det(Aᵢ)/det(A) — making solutions analyzable symbolically without performing elimination. It is computationally expensive because solving an n-variable system requires computing n+1 determinants, each costing O(n³), for O(n⁴) total — far slower than Gaussian elimination's O(n³).
The elegance of an explicit formula is exactly what makes Cramer's rule valuable in proofs and theoretical analysis, where you want to see how the solution depends on the parameters rather than just compute a number. The inverse of a matrix, for instance, can be derived symbolically using Cramer's rule applied to each column of the identity. But for numerical computation, especially as n grows, the O(n⁴) cost is prohibitive.