Independent study guide

Concordia MATH 204 Midterm Practice Mock

Eight original MATH 204 practice questions on systems, matrices, determinants and vectors, with separate worked solutions and short follow-up exercises. Allow about 90 minutes and use the suggested marking guide out of 100.

Nablio · 8 questionsPublished

MATH 204 mixed assessment practice

Question paper

Original Nablio practice aligned with weeks 1–6 of Concordia MATH 204, Fall 2026. This is an independent study resource, not an official or past examination. Try the eight questions in about 90 minutes, then use the suggested marking guide out of 100 to check your work.

The Fall 2026 course outline, pages 2–3, lists the midterm for November 1, 10:00–11:30, covering weeks 1–6. Check your instructor’s current announcements for changes and permitted aids.

Attempt the whole paper before opening the separate solutions. All quantities are real. Give exact answers and enough reasoning to justify your conclusions. Choose any valid method unless a question asks you to assess a particular argument. No calculator is needed for these questions. The English and French papers contain the same problems.

Question 1

14 marks

A record contains these four claims about the same three unknown numbers:

x+y=1claim 1,y+z=2claim 2,2x+z=7claim 3,3x+2y+2z=13claim 4. \begin{aligned} x+y&=1 &&\text{claim 1,}\\ y+z&=2 &&\text{claim 2,}\\ 2x+z&=7 &&\text{claim 3,}\\ 3x+2y+2z&=13 &&\text{claim 4.} \end{aligned}

Exactly one recorded right-hand side is incorrect. The other three claims are exact; all left-hand sides are correct.

  1. Explain why the four recorded claims cannot all be true. (3 marks)
  2. Suppose claim 4 is the incorrect one. Find its corrected right-hand side and the resulting triple (x,y,z)(x,y,z). (5 marks)
  3. Can the record and the single-error assumption identify which claim is incorrect? Support your answer by finding one possible correction to a different claim, together with a triple that satisfies the other three recorded claims. (6 marks)

Question 2

12 marks

Let

A=(1101),B=(101020001),C=(322222). \begin{gathered} A=\begin{pmatrix}1&1\\0&1\end{pmatrix},\\ B=\begin{pmatrix}1&0&1\\0&2&0\\0&0&1\end{pmatrix},\\ C=\begin{pmatrix}3&2&2\\2&2&2\end{pmatrix}. \end{gathered}
  1. Determine the dimensions that XX must have for AXB=CAXB=C. (2 marks)
  2. Find every such matrix XX. Justify the order of the factors in your calculation. (7 marks)
  3. Verify your result in the original equation and justify whether the solution is unique. (3 marks)

Question 3

14 marks

An unknown 3×33\times3 matrix AA is changed by the following operations, in the order shown. Each operation acts on the current rows.

  1. R1↔R3R_1\leftrightarrow R_3
  2. R2←R2−2R1R_2\leftarrow R_2-2R_1
  3. R3←−R3R_3\leftarrow -R_3

The final matrix is

U=(10101−1001). U=\begin{pmatrix}1&0&1\\0&1&-1\\0&0&1\end{pmatrix}.
  1. Recover AA. (4 marks)
  2. Find A−1A^{-1}, justifying that the inverse exists. Check your result. (6 marks)
  3. Let E1,E2,E3E_1,E_2,E_3 be the elementary matrices for operations 1, 2 and 3. A learner concludes that E3E2E1=A−1E_3E_2E_1=A^{-1}. Decide whether this conclusion is correct and give the correct relationship between these matrices. (4 marks)

Question 4

10 marks

A 3×33\times3 matrix AA has rows r1,r2,r3r_1,r_2,r_3 and det⁡(A)=−2\det(A)=-2. The rows of a matrix BB, in order, are

2r1+r2,r2−3r3,4r3. 2r_1+r_2,\qquad r_2-3r_3,\qquad 4r_3.

Determine det⁡(B)\det(B) and

det⁡ ⁣(3B−1AT). \det\!\left(3B^{-1}A^{\mathsf T}\right).

Justify your determinant transformations and explain why the inverse in this expression exists. Here ATA^{\mathsf T} is the transpose of AA.

Question 5

12 marks

For a real parameter tt, consider

x+2y=t,y+z=1,2x+z=3. \begin{aligned} x+2y&=t,\\ y+z&=1,\\ 2x+z&=3. \end{aligned}
  1. Find every value of tt for which the solution satisfies x=zx=z. Justify your method and your conclusion about the number of solutions. (6 marks)
  2. Let HH be the coefficient matrix in variable order x,y,zx,y,z, and let HxH_x be obtained by replacing its first column with (t,1,3)T(t,1,3)^{\mathsf T}. A learner argues: “Whenever det⁡(Hx)=0\det(H_x)=0, the coefficient matrix is singular, so the system does not have a unique solution.” Find every tt for which the premise holds and decide whether the conclusion follows. (6 marks)

Question 6

10 marks

Let

P=(1111). P=\begin{pmatrix}1&1\\1&1\end{pmatrix}.
  1. Give one nonzero 2×22\times2 matrix QQ such that PQ=02×2PQ=0_{2\times2}. (2 marks)
  2. Describe every real 2×22\times2 matrix QQ with this property. (4 marks)
  3. Decide whether any such QQ can be invertible. Explain precisely why the argument “P≠0P\ne0, so cancelling PP gives Q=0Q=0” is or is not valid. (4 marks)

Question 7

14 marks

Vectors u,v∈R3u,v\in\mathbb R^3 satisfy

∥u∥=2,∥v∥=3,u⋅v=3. \begin{gathered} \|u\|=2,\\ \|v\|=3,\\ u\cdot v=3. \end{gathered}

Their coordinates are not given. Determine:

  1. ∥2u−v∥\|2u-v\|. (4 marks)
  2. The cosine of the angle between 2u−v2u-v and vv, and whether that angle is acute, right or obtuse. (4 marks)
  3. The distance between the points whose position vectors are u+vu+v and u−vu-v. (3 marks)
  4. Every real λ\lambda for which λu+v\lambda u+v is orthogonal to uu. (3 marks)

Explain why the supplied information is sufficient without recovering coordinates.

Question 8

14 marks

Let O=(0,0,0)O=(0,0,0), A=(2,0,0)A=(2,0,0), and B=(0,2,0)B=(0,2,0). Find every point P∈R3P\in\mathbb R^3 satisfying all three conditions:

  • PP is equally distant from AA and BB
  • ∥OP→∥=6\|\overrightarrow{OP}\|=\sqrt6
  • OP→\overrightarrow{OP} is orthogonal to (1,1,1)(1,1,1)

Justify that no points are missing. For each resulting point, find its distance from AA, and determine which point is nearer to AA.

Finished your attempt? Open “Worked solutions and retries” below to check your answers and choose a follow-up question.

Worked solutions and retries

MATH 204 assessment practice solutions

How to use these solutions

Try the question paper before reading the solutions. Use the suggested marking guide out of 100 to check your work. Give the same points for any equivalent valid method. If one arithmetic error carries through later steps, still give credit for correct reasoning that follows consistently from it. Check any invalid division or reasoning step separately.

The eight short diagnostic retries appear after all solutions. The English and French versions contain identical mathematical tasks, so switching languages does not provide a fresh attempt.

Solution 1

The fourth left-hand side is the sum of the first three:

(x+y)+(y+z)+(2x+z)=3x+2y+2z. \begin{aligned} &(x+y)+(y+z)+(2x+z)\\ &=3x+2y+2z. \end{aligned}

Let bib_i be the right-hand side of claim ii, for i=1,2,3,4i=1,2,3,4. For the four equations to agree, these numbers must satisfy b4=b1+b2+b3b_4=b_1+b_2+b_3. The recorded numbers give 1+2+7=10≠131+2+7=10\ne13, so the four recorded equations are inconsistent.

If claim 4 is wrong, the first three are exact. From x+y=1x+y=1 and y+z=2y+z=2, obtain y=1−xy=1-x and z=1+xz=1+x. Then

2x+z=7⟹3x+1=7, 2x+z=7\quad\Longrightarrow\quad3x+1=7,

giving (x,y,z)=(2,−1,3)(x,y,z)=(2,-1,3). Claim 4 must have right-hand side 10. The checks are

2−1=1,−1+3=2,4+3=7,6−2+6=10. \begin{gathered} 2-1=1,\\ -1+3=2,\\ 4+3=7,\\ 6-2+6=10. \end{gathered}

However, the faulty claim cannot be identified from the record alone. For example, suppose claim 1 is wrong instead. Compatibility requires

b1=13−2−7=4. b_1=13-2-7=4.

The triple (3,1,1)(3,1,1) gives x+y=4x+y=4, y+z=2y+z=2, 2x+z=72x+z=7 and 3x+2y+2z=133x+2y+2z=13. This changes exactly one recorded right-hand side and preserves the other three. These two distinct explanations are sufficient to disprove unique identification. There is no need to enumerate all possible repairs.

Suggested marking guide, 14 marks:

  • Part 1: identify the left-hand-side relation (2); detect the incompatible constants (1)
  • Part 2: solve the three retained equations coherently (3); correct claim 4 to 10 (1); verify (1)
  • Part 3: construct a different valid correction (2); find a compatible triple (2); check the three unchanged claims (1); conclude that the data do not identify the error uniquely (1)

Diagnostic D1: A failed consistency check does not identify which input is wrong. If you named one faulty claim without ruling out alternatives, distinguish “one possible explanation” from “the only explanation.”

Solution 2

Since AA is 2×22\times2 and BB is 3×33\times3, XX must be 2×32\times3. The product then has the same size as CC.

Both outside factors are invertible:

A−1=(1−101),B−1=(10−101/20001). \begin{gathered} A^{-1}=\begin{pmatrix}1&-1\\0&1\end{pmatrix},\\ B^{-1}=\begin{pmatrix}1&0&-1\\0&1/2&0\\0&0&1\end{pmatrix}. \end{gathered}

Multiplying AXB=CAXB=C on the left by A−1A^{-1} and on the right by B−1B^{-1} gives

X=A−1CB−1. X=A^{-1}CB^{-1}.

Each inverse must be adjacent to the factor it cancels; matrix factors cannot be rearranged as if they were scalars. Here

A−1C=(100222),X=(10−1210). \begin{gathered} A^{-1}C=\begin{pmatrix}1&0&0\\2&2&2\end{pmatrix},\\ X=\begin{pmatrix}1&0&-1\\2&1&0\end{pmatrix}. \end{gathered}

Check directly:

AX=(31−1210),(AX)B=(322222)=C. \begin{gathered} AX=\begin{pmatrix}3&1&-1\\2&1&0\end{pmatrix},\\ (AX)B=\begin{pmatrix}3&2&2\\2&2&2\end{pmatrix}=C. \end{gathered}

Every solution must equal the displayed expression A−1CB−1A^{-1}CB^{-1}, and that expression satisfies the equation. The solution is unique. Solving the associated scalar equations is also valid, provided dimensions, factor order and uniqueness are justified.

Suggested marking guide, 12 marks:

  • Part 1: dimensions 2×32\times3, with justification (2)
  • Part 2: valid algebra or equivalent equations, including order (3); correct inverses or equivalent elimination (2); correct XX (2)
  • Part 3: original-equation check (2); uniqueness justification (1)

Diagnostic D2: Undo a left factor on the left and a right factor on the right. Check dimensions before trying to move an inverse. The expression B−1CA−1B^{-1}CA^{-1} is not even defined here.

Solution 3

Undo the operations in reverse order. Starting with UU, negate row 3, then add twice the current row 1 to row 2:

(10101−100−1)⟶(10121100−1). \begin{pmatrix}1&0&1\\0&1&-1\\0&0&-1\end{pmatrix} \longrightarrow \begin{pmatrix}1&0&1\\2&1&1\\0&0&-1\end{pmatrix}.

Finally interchange rows 1 and 3:

A=(00−1211101). A=\begin{pmatrix}0&0&-1\\2&1&1\\1&0&1\end{pmatrix}.

The elementary matrices are

E1=(001010100),E2=(100−210001),E3=(10001000−1). \begin{gathered} E_1=\begin{pmatrix}0&0&1\\0&1&0\\1&0&0\end{pmatrix},\\ E_2=\begin{pmatrix}1&0&0\\-2&1&0\\0&0&1\end{pmatrix},\\ E_3=\begin{pmatrix}1&0&0\\0&1&0\\0&0&-1\end{pmatrix}. \end{gathered}

Set E=E3E2E1E=E_3E_2E_1. The original log says EA=UEA=U, not EA=I3EA=I_3, and

E=(00101−2−100). E=\begin{pmatrix}0&0&1\\0&1&-2\\-1&0&0\end{pmatrix}.

All three elementary matrices are invertible, and UU is triangular with determinant 1. Thus A=E−1UA=E^{-1}U is invertible. Alternatively, the two determinant sign changes in the log cancel, so det⁡(A)=det⁡(U)=1\det(A)=\det(U)=1.

Solution 3 continued

Because

U−1=(10−1011001), U^{-1}=\begin{pmatrix}1&0&-1\\0&1&1\\0&0&1\end{pmatrix},

the inverse is

A−1=U−1E=(101−11−2−100). A^{-1}=U^{-1}E=\begin{pmatrix}1&0&1\\-1&1&-2\\-1&0&0\end{pmatrix}.

Direct multiplication gives AA−1=A−1A=I3AA^{-1}=A^{-1}A=I_3. A full row reduction of [A∣I3][A\mid I_3] is an equally valid way to find this inverse.

The learner’s claim is false because U≠I3U\ne I_3. Correct relationships include

E3E2E1A=U,A−1=U−1E3E2E1. \begin{gathered} E_3E_2E_1A=U,\\ A^{-1}=U^{-1}E_3E_2E_1. \end{gathered}

Suggested marking guide, 14 marks:

  • Part 1: reverse order and operations correctly (2); obtain AA (2)
  • Part 2: justify invertibility (1); valid inverse method (2); correct inverse (2); check (1)
  • Part 3: correctly interpret or compute the elementary product (2); reject the claim and give the corrected inverse relationship (2)

Diagnostic D3: An operation sequence gives an inverse directly only when it sends the original matrix to the identity. Also, the operation done first appears rightmost in a product of left-acting elementary matrices.

Solution 4

The row combinations can be written as B=TAB=TA, where

T=(21001−3004). T=\begin{pmatrix}2&1&0\\0&1&-3\\0&0&4\end{pmatrix}.

Since TT is triangular, det⁡(T)=2⋅1⋅4=8\det(T)=2\cdot1\cdot4=8. Therefore

det⁡(B)=det⁡(T)det⁡(A)=8(−2)=−16. \begin{aligned} &\det(B)=\det(T)\det(A)\\ &=8(-2)=-16. \end{aligned}

This is nonzero, so B−1B^{-1} exists. Using the determinant rules for a scalar multiple of a 3×33\times3 matrix, a product, an inverse and a transpose gives

det⁡(3B−1AT)=33det⁡(B−1)det⁡(AT)=271−16(−2)=278. \begin{aligned} &\det(3B^{-1}A^{\mathsf T})\\ &=3^3\det(B^{-1})\det(A^{\mathsf T})\\ &=27\frac{1}{-16}(-2)\\ &=\frac{27}{8}. \end{aligned}

A row-operation derivation is also valid. For example, begin with rows r1,r2,r3r_1,r_2,r_3, scale row 1 by 2 and row 3 by 4, add row 2 to row 1, and then subtract 3/43/4 of the current row 3 from row 2. This produces BB with determinant multiplier 8. The order matters when current rows are used.

Suggested marking guide, 10 marks:

  • Valid row-combination or determinant argument (3); det⁡(B)=−16\det(B)=-16 (2)
  • Establish that the inverse exists (1); apply the four determinant rules with the factor 333^3 (3); obtain 27/827/8 (1)

Diagnostic D4: Multiplying the whole 3×33\times3 matrix by 3 contributes 333^3. Multiplying one row by 3 would contribute only 3. Transposing does not change a determinant.

Solution 5

The coefficient matrix is

H=(120011201). H=\begin{pmatrix}1&2&0\\0&1&1\\2&0&1\end{pmatrix}.

Expansion along the first row gives

det⁡(H)=1(1)−2(0−2)=5. \det(H)=1(1)-2(0-2)=5.

It is invertible for every tt; only the right-hand side depends on tt. Every value of tt therefore gives exactly one solution.

For part 1, imposing x=zx=z in 2x+z=32x+z=3 gives x=z=1x=z=1. Then y+z=1y+z=1 gives y=0y=0, and x+2y=tx+2y=t forces t=1t=1. Conversely, t=1t=1 gives the solution (1,0,1)(1,0,1), so this value works and is the only one.

Another valid choice is to use Cramer’s rule for the two needed coordinates. The replacement determinants are

det⁡(Hx)=∣t20111301∣=t−2(1−3)=t+4, \begin{aligned} &\det(H_x)=\begin{vmatrix}t&2&0\\1&1&1\\3&0&1\end{vmatrix}\\ &=t-2(1-3)=t+4, \end{aligned} det⁡(Hz)=∣12t011203∣=3+4−2t=7−2t. \begin{aligned} &\det(H_z)=\begin{vmatrix}1&2&t\\0&1&1\\2&0&3\end{vmatrix}\\ &=3+4-2t=7-2t. \end{aligned}

Then x=zx=z is equivalent to (t+4)/5=(7−2t)/5(t+4)/5=(7-2t)/5, which again gives t=1t=1. The direct method is shorter here; the determinant method is still valid.

For part 2, det⁡(Hx)=0\det(H_x)=0 precisely when t=−4t=-4. This means x=0/5=0x=0/5=0, not that HH is singular. The relevant denominator remains det⁡(H)=5\det(H)=5. At t=−4t=-4 the unique solution is (0,−2,3)(0,-2,3), and its original left-hand sides are −4,1,3-4,1,3.

Suggested marking guide, 12 marks:

  • Part 1: valid deduction of x=z=1x=z=1 and y=0y=0, or equivalent method (3); t=1t=1 and a converse check (1); justify existence and uniqueness (2)
  • Part 2: correct replacement determinant (2); t=−4t=-4 (1); distinguish it from the coefficient determinant and reject the singularity claim (2); conclude that the system still has a unique solution (1)

Diagnostic D5: Cramer’s rule applies only when the coefficient determinant is nonzero. A zero replacement determinant is permitted when the coefficient determinant is nonzero.

Solution 6

One example is

Q=(10−10); Q=\begin{pmatrix}1&0\\-1&0\end{pmatrix};

it is nonzero, and direct multiplication gives PQ=0PQ=0.

For the complete description, write

Q=(abcd). Q=\begin{pmatrix}a&b\\c&d\end{pmatrix}.

Then

PQ=(a+cb+da+cb+d). PQ=\begin{pmatrix}a+c&b+d\\a+c&b+d\end{pmatrix}.

This is zero if and only if c=−ac=-a and d=−bd=-b. Hence every allowed matrix, with no omitted cases, is

Q=(ab−a−b),a,b∈R. Q=\begin{pmatrix}a&b\\-a&-b\end{pmatrix},\qquad a,b\in\mathbb R.

Every such matrix has determinant −ab+ab=0-ab+ab=0, so none is invertible. Equivalently, if Q−1Q^{-1} existed, multiplying PQ=0PQ=0 on the right by Q−1Q^{-1} would imply P=0P=0, contrary to the given matrix.

The proposed cancellation is invalid. A nonzero matrix need not be invertible; here det⁡(P)=0\det(P)=0. The displayed nonzero example also directly disproves the conclusion Q=0Q=0.

Suggested marking guide, 10 marks:

  • Part 1: nonzero example and product check (2)
  • Part 2: obtain the two necessary equations (2); give the full family and its sufficiency (2)
  • Part 3: justify that all such QQ are singular (2); explain why P≠0P\ne0 does not permit cancellation (2)

Diagnostic D6: Scalar zero-product and cancellation rules cannot be transferred to matrices without checking invertibility.

Solution 7

The data give u⋅u=4u\cdot u=4, v⋅v=9v\cdot v=9 and u⋅v=v⋅u=3u\cdot v=v\cdot u=3. Expand each dot product by distributing over sums and taking numerical factors outside. This reduces every calculation to these three numbers.

First,

∥2u−v∥2=(2u−v)⋅(2u−v)=4(u⋅u)−4(u⋅v)+v⋅v=16−12+9=13. \begin{aligned} &\|2u-v\|^2=(2u-v)\cdot(2u-v)\\ &=4(u\cdot u)-4(u\cdot v)+v\cdot v\\ &=16-12+9=13. \end{aligned}

Thus ∥2u−v∥=13\|2u-v\|=\sqrt{13}, a nonnegative scalar.

Next,

(2u−v)⋅v=2(3)−9=−3. (2u-v)\cdot v=2(3)-9=-3.

Both vectors are nonzero, so the angle formula is defined:

cos⁡θ=−313⋅3=−113. \cos\theta=\frac{-3}{\sqrt{13}\cdot3}=-\frac{1}{\sqrt{13}}.

The cosine is negative, so the angle is obtuse.

The displacement between the two specified points is

(u+v)−(u−v)=2v. (u+v)-(u-v)=2v.

Their distance is ∥2v∥=2∥v∥=6\|2v\|=2\|v\|=6.

Finally,

(λu+v)⋅u=4λ+3=0⟹λ=−34. \begin{aligned} &(\lambda u+v)\cdot u=4\lambda+3=0\\ &\Longrightarrow\quad\lambda=-\frac34. \end{aligned}

The coefficient 4 is nonzero, so this is the only value. Coordinates were unnecessary because every calculation depends only on the given norms and dot product.

Suggested marking guide, 14 marks:

  • Part 1: correct expansion including both cross terms (3); positive square root (1)
  • Part 2: numerator (1); valid nonzero denominator (1); cosine (1); obtuse interpretation (1)
  • Part 3: displacement (2); distance (1)
  • Part 4: orthogonality equation (2); unique parameter (1)

Diagnostic D7: A norm is not linear. Expand its square through the dot product; do not replace ∥2u−v∥\|2u-v\| by 2∥u∥−∥v∥2\|u\|-\|v\|.

Solution 8

Write P=(x,y,z)P=(x,y,z). Equal distances to AA and BB give equal squared distances:

(x−2)2+y2+z2=x2+(y−2)2+z2. \begin{aligned} &(x-2)^2+y^2+z^2\\ &=x^2+(y-2)^2+z^2. \end{aligned}

After cancellation, −4x=−4y-4x=-4y, so x=yx=y.

Orthogonality gives x+y+z=0x+y+z=0, hence z=−2xz=-2x. The norm condition now becomes

x2+y2+z2=6⟹6x2=6. x^2+y^2+z^2=6\quad\Longrightarrow\quad6x^2=6.

Therefore x=1x=1 or x=−1x=-1, and the only candidates are

P+=(1,1,−2),P−=(−1,−1,2). \begin{gathered} P_+=(1,1,-2),\\ P_-=(-1,-1,2). \end{gathered}

Every original constraint was transformed equivalently: distances are nonnegative, so equality is equivalent to equality of their squares; the orthogonality and norm substitutions did not divide by an unknown. Both square-root signs have been retained. Substitution confirms norm squared 6 and dot product 0 for each candidate, and x=yx=y confirms equal distances to AA and BB. The list is complete.

The distances to AA are

d(P+,A)=(−1)2+12+(−2)2=6,d(P−,A)=(−3)2+(−1)2+22=14. \begin{aligned} &d(P_+,A)\\ &=\sqrt{(-1)^2+1^2+(-2)^2}\\ &=\sqrt6,\\ &d(P_-,A)\\ &=\sqrt{(-3)^2+(-1)^2+2^2}\\ &=\sqrt{14}. \end{aligned}

Thus P+P_+ is nearer to AA. Equal distance to AA and BB for each point does not mean that different possible points must be the same distance from AA.

Suggested marking guide, 14 marks:

  • Equal-distance equation and x=yx=y (2); orthogonality and z=−2xz=-2x (2); norm equation (2); both candidates and completeness (2)
  • Two correct distance calculations (4)
  • Correct nearer point with a comparison or check (2)

Diagnostic D8: A norm condition can leave two signs. Do not discard a negative coordinate just because a norm is nonnegative. Distances use displacements from the named point, not automatically from the origin.

Total marks

14+12+14+10+12+10+14+14=100. \begin{aligned} &14+12+14+10\\ &\quad+12+10+14+14\\ &=100. \end{aligned}

Use your mistakes to choose what to practise next. The suggested marks help you check your work.

Diagnose and repair

Record the first step you could not justify, rather than simply labelling a whole question “wrong.” Choose one or two categories first.

The later span/independence and plane/cross-product material in broader course resources is not required for this assessment.

Short fresh retries

Close the answer key below before attempting the items for your selected categories. These are repair checks, not another scored assessment.

  1. D1. The equations x−y=1x-y=1 and 2x+y=82x+y=8 are exact. A third record says 3x=k3x=k. Find the only compatible kk and verify it with the solution.
  2. D2. Let A=(1101)A=\begin{pmatrix}1&1\\0&1\end{pmatrix} and B=(2001)B=\begin{pmatrix}2&0\\0&1\end{pmatrix}. Solve AXB=I2AXB=I_2. Check whether reversing the two inverse factors gives the same answer.
  3. D3. Let E1=(0110)E_1=\begin{pmatrix}0&1\\1&0\end{pmatrix}, E2=(3001)E_2=\begin{pmatrix}3&0\\0&1\end{pmatrix}, and E2E1K=I2E_2E_1K=I_2. Find K−1K^{-1} and KK, keeping the factor order visible.
  4. D4. A 2×22\times2 matrix AA has determinant 3. Find det⁡(2(A−1)T)\det(2(A^{-1})^{\mathsf T}).
  5. D5. For x+y=tx+y=t, x−y=2x-y=2, find the value of tt for which the Cramer numerator for yy is zero. Is the coefficient matrix singular at that value?
  6. D6. For P=(1000)P=\begin{pmatrix}1&0\\0&0\end{pmatrix}, give one nonzero QQ with PQ=0PQ=0. Explain why no such QQ can be invertible.
  7. D7. If ∥u∥=∥v∥=1\|u\|=\|v\|=1 and ∥u−v∥=1\|u-v\|=1, find u⋅vu\cdot v and the angle between the vectors.
  8. D8. Find all points in R2\mathbb R^2 that are equally distant from (2,0)(2,0) and (0,2)(0,2) and have distance 2 from the origin. Which is nearer to (1,1)(1,1)?
Retry answer key
  1. Add the equations to obtain 3x=93x=9. Thus k=9k=9, x=3x=3, y=2y=2, with 3−2=13-2=1 and 6+2=86+2=8.
  2. X=A−1B−1=(1/2−101)X=A^{-1}B^{-1}=\begin{pmatrix}1/2&-1\\0&1\end{pmatrix}. The reversed product is B−1A−1=(1/2−1/201)B^{-1}A^{-1}=\begin{pmatrix}1/2&-1/2\\0&1\end{pmatrix}, which is different and does not solve the equation. Direct multiplication of the correct AXBAXB gives I2I_2.
  3. K−1=E2E1=(0310)K^{-1}=E_2E_1=\begin{pmatrix}0&3\\1&0\end{pmatrix}; K=E1−1E2−1=(011/30)K=E_1^{-1}E_2^{-1}=\begin{pmatrix}0&1\\1/3&0\end{pmatrix}. Their products in either order are I2I_2.
  4. 22/3=4/32^2/3=4/3. There are two rows, and transposition leaves the determinant unchanged.
  5. The coefficient determinant is −2-2. The replacement determinant for yy is 2−t2-t, so it vanishes at t=2t=2. The coefficient matrix remains invertible; the unique solution is (2,0)(2,0).
  6. One choice is Q=(0010)Q=\begin{pmatrix}0&0\\1&0\end{pmatrix}. If an allowed QQ were invertible, right multiplication of PQ=0PQ=0 by Q−1Q^{-1} would give the false statement P=0P=0.
  7. 1=1+1−2u⋅v1=1+1-2u\cdot v, so u⋅v=1/2u\cdot v=1/2. The angle has cosine 1/21/2, hence is 60∘60^\circ.
  8. Equal squared distances give x=yx=y; the norm gives 2x2=42x^2=4. The points are (2,2)(\sqrt2,\sqrt2) and (−2,−2)(-\sqrt2,-\sqrt2). Their distances to (1,1)(1,1) are 2−22-\sqrt2 and 2+22+\sqrt2, respectively, so the positive-coordinate point is nearer.

Useful for

Work on the step you’re missing.

Tell us the subject and your preferred time. Nablio confirms the details by text or email.

Request a lesson