This page is a self-test ladder. Each rung is harder and expects the rung below. Every problem has a hidden full solution — try first, then reveal. We only ever use the one machine from the parent note:
Reminders you will need (all from parent + Determinants):
2×2 determinant: det(acbd)=ad−bc — the "cross-product minus" pattern.
3×3 by Cofactor Expansion along row 1: a11M11−a12M12+a13M13 where each M is the little 2×2 determinant you get by deleting that entry's row and column. The signs alternate +,−,+.
These check that you can spot the pieces: what is A, what is b, what is Ai, and whether the rule even applies.
Recall Solution L1.1
The coefficients of x,y in each row become the columns of A (column 1 = the x-coefficients, column 2 = the y-coefficients):
A=(312−1),b=(71).
To find x (i=1), cover column 1 with b:
A1=(712−1).
(Column 2 stays exactly as it was.)
Recall Solution L1.2
(a) detA=(4)(1)−(2)(2)=4−4=0. Rule does not apply — no unique solution.
(b) detA=(4)(3)−(2)(1)=12−2=10=0. Rule applies.
The condition detA=0 is exactly the invertibility check.
A=121253132,b=4138.
detA (cofactor along row 1):
11(5⋅2−3⋅3)−21(2⋅2−3⋅1)+11(2⋅3−5⋅1)=1−2+1=0?
Careful — recompute each minor: 5⋅2−3⋅3=10−9=1; 2⋅2−3⋅1=4−3=1; 2⋅3−5⋅1=6−5=1. So detA=1(1)−2(1)+1(1)=0.
detA=0 → Cramer's rule does NOT apply here. Switch to Gaussian Elimination.
(This is deliberate: the trap is grinding out numerators without checking the denominator.)
x=detAdetA1=−412=−3, y=detAdetA2=−40=0.
Sign logic: numerator and denominator have opposite signs (+ over −), so the ratio is negative. A determinant is a signed volume — the sign flips when the column-box's orientation flips. detA2=0 just means covering column 2 with b collapses that box flat, giving y=0; the original box detA=0, so the system is still fine.
Combine Cramer with a parameter, or with another concept.
Recall Solution L4.1
A=(k11k), detA=k2−1=(k−1)(k+1).
Fails whendetA=0⇒k=1 or k=−1.
When it works (k=±1):
detA1=det(111k)=k−1, so x=k2−1k−1=(k−1)(k+1)k−1=k+11.
By symmetry detA2=det(k111)=k−1, so y=k+11.
Answer:x=y=k+11 for k=±1.
(At k=1 both equations become x+y=1 — infinitely many solutions. At k=−1 they contradict — none. Cramer correctly refuses both.)
Recall Solution L4.2
The first column of A−1 solves Ax=e1=(10) (because AA−1=I, so A×(col 1)=col 1 of I).
detA=(2)(2)−(1)(3)=1.
x=1det(1012)=12=2, y=1det(2310)=1−3=−3.
First column of A−1 is (2−3). See Matrix Inverse.
Prove/generalise, and handle a fully symbolic or limiting case.
Recall Solution L5.1
As k→−1, detA=(k−1)(k+1)→0, so we're dividing by a vanishing volume.
k→−1+ (e.g. k=−0.9): x=0.11=+10, growing to +∞.
k→−1− (e.g. k=−1.1): x=−0.11=−10, going to −∞.
The solution blows up, exactly the numerical instability the parent warns about: near-zero detA makes xi enormous and sign-flippy. Geometrically, the two column-vectors become nearly parallel, so the box is nearly flat and a small change in b demands a huge mix.
Recall Solution L5.2
A=(acbd), detA=ad−bc.
x=ad−bcdet(efbd)=ad−bced−bf,y=ad−bcdet(acef)=ad−bcaf−ce.Verify equation 1:ax+by=ad−bca(ed−bf)+b(af−ce)=ad−bcaed−abf+abf−bce=ad−bce(ad−bc)=e ✓.
Verify equation 2:cx+dy=ad−bcc(ed−bf)+d(af−ce)=ad−bcced−bcf+adf−cde=ad−bcf(ad−bc)=f ✓.
Both hold identically — this is the parent's detA⋅xi=detAi made concrete for n=2. This alternating cancellation is the fingerprint of Multilinear and Alternating Maps.