The problems below run in rough order of difficulty and cover every tool of the chapter: orders, construction and equality (Examples 1 to 4), the operations with their traps (5 to 9), transpose and the symmetric world (10 to 13), matrix equations and powers (14 to 17), and the closing classics — inverse-assisted equations, involutory and idempotent identities, counting and word problems (18 to 25).
Work each one before reading its solution — and in every multiplication, write the order bookkeeping first.
Examples 1 to 9 — Orders, Equality and Operations
Example 1 — Orders from an element count
A matrix has 18 elements. What are its possible orders? What if it has 5 elements?
Step 1 — factor pairs of 18:(1,18),(2,9),(3,6),(6,3),(9,2),(18,1) — six orders.
Step 2 — 5 is prime: only 1×5 and 5×1.
Answer: six orders for 18 elements; two for 5.
Example 2 — Constructing from a rule
Construct the 3×4 matrix with aij=21∣−3i+j∣.
Step 1 — evaluate row by row: row 1 (i=1): ∣−3+j∣/2 for j=1..4: 1,21,0,21. Row 2: 25,2,23,1. Row 3: 4,27,3,25.
Answer:AB as above; BA exists too but is 3×3 — both defined, incomparably different.
Example 6 — Another zero-divisor pair
Show that A=(1−1−11) and B=(1111) satisfy AB=O.
Step 1 — compute: every entry of AB is 1−1=0 or −1+1=0:
AB=(0000)
Answer: two nonzero matrices annihilating each other — each row of A is orthogonal to each column of B, which is the geometric anatomy of every zero-divisor pair.
Example 7 — A cost-aggregation word problem
A group plans contact of two types: type X costing ₹ 40 per contact and type Y costing ₹ 100 per contact. In city P they make 1000 X-contacts and 500 Y-contacts; in city Q, 3000 and 1000. Use matrix multiplication to find the total cost in each city.
Step 1 — quantities matrix times cost column:(100030005001000)(40100)=(40000+50000120000+100000)=(90000220000)
Answer: ₹ 90000 in city P and ₹ 220000 in city Q — one product answers both cities at once; that batching is the entire point of matrix multiplication.
Example 8 — A matrix polynomial
For A=22101−1130, compute A2−5A+6I.
Step 1 — square:A2=590−1−2−125−2
Step 2 — assemble the polynomial:A2−5A+6I=5−10+69−100−5−1−0−2−5+6−1+52−55−15−2−0+6=1−1−5−1−14−3−104
Answer: as above — I contributes only to the diagonal, the commonest slip in matrix polynomials.
Example 9 — An entry-equation from a triple product
Find x if (1x1)121535321212x=O.
Step 1 — multiply the row into the square matrix:(1+2x+153+5x+32+x+2)=(2x+165x+6x+4)
Step 2 — multiply into the column and set to zero:(2x+16)+2(5x+6)+x(x+4)=x2+16x+28=0
Step 3 — solve:(x+2)(x+14)=0.
Answer:x=−2 or x=−14 — a 1×1 product equation collapsing to a quadratic.
Examples 10 to 17 — Transpose, Symmetry and Powers
Example 10 — Reversal law on a column-row pair
For A=1−43 and B=(13−6), verify that (AB)′=B′A′.
Step 1 — the product AB is 3×3: entries aibj:
AB=1−433−129−624−18⟹(AB)′=13−6−4−122439−18
Step 2 — the reversed product:B′A′=13−6(1−43) gives exactly the same 3×3 matrix ✓.
Answer: verified — and note A′B′ would be (1×3)(3×1)=1×1, a completely different object: the reversal is forced.
Example 11 — A quick decomposition
Express M=(315−1) as symmetric plus skew-symmetric.
Step 1 — symmetric part:P=21(M+M′)=(333−1).
Step 2 — skew part:Q=21(M−M′)=(0−220).
Step 3 — check:P+Q=M ✓, P′=P ✓, Q′=−Q ✓.
Answer:M=P+Q as above.
Example 12 — Conjugation preserves symmetry
If A is symmetric, show that B′AB is symmetric (for any conformable B).
Step 1 — transpose with the reversal law (twice):(B′AB)′=B′A′(B′)′=B′A′B
Step 2 — use A′=A:(B′AB)′=B′AB.
Answer: symmetric — and the same computation with A′=−A shows B′AB is skew when A is skew: conjugation by any matrix preserves both symmetry types.
Example 13 — Completing a skew-symmetric matrix
Find a,b,c if A=02cab13−10 is skew-symmetric.
Step 1 — diagonal must vanish:b=0.
Step 2 — mirror pairs must negate:a=−a21=−2; c=−a13=−3 (and the pair (−1,1) checks: a32=1=−a23 ✓).
Answer: both AA′ and A′A are always symmetric (though generally different from each other) — two more members of the always-symmetric family alongside A+A′.
Example 24 — Counting symmetric 0-1 matrices
How many 2×2 matrices with every entry 0 or 1 are symmetric?
Step 1 — symmetry ties the mirror pair:a12=a21, so the free choices are a11,a22,a12 — three independent binary entries.
Step 2 — count:23=8.
Answer: 8 (out of the 24=16 total) — symmetry halves the free off-diagonal entries, a Ch1-style count inside Ch3.
Example 25 — The trust-fund word problem
A trust fund has ₹ 30000 to invest in two bonds paying 5% and 7% simple interest per year. Using matrix multiplication, determine how to split the money to obtain an annual interest of ₹ 1800.
Step 1 — set up the product: invest x at 5% and 30000−x at 7%:
(x30000−x)(0.050.07)=[0.05x+0.07(30000−x)]=[1800]
Step 2 — solve:2100−0.02x=1800, so 0.02x=300 and x=15000.
Answer: ₹ 15000 in each bond (check: 750+1050=1800 ✓) — the row-times-column product once again encoding "amounts times rates, summed".
Ready to test your knowledge?
Take a quick interactive quiz on this topic —
free, works without login.