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 marksA record contains these four claims about the same three unknown numbers:
Exactly one recorded right-hand side is incorrect. The other three claims are exact; all left-hand sides are correct.
- Explain why the four recorded claims cannot all be true. (3 marks)
- Suppose claim 4 is the incorrect one. Find its corrected right-hand side and the resulting triple . (5 marks)
- 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 marksLet
- Determine the dimensions that must have for . (2 marks)
- Find every such matrix . Justify the order of the factors in your calculation. (7 marks)
- Verify your result in the original equation and justify whether the solution is unique. (3 marks)
Question 3
14 marksAn unknown matrix is changed by the following operations, in the order shown. Each operation acts on the current rows.
The final matrix is
- Recover . (4 marks)
- Find , justifying that the inverse exists. Check your result. (6 marks)
- Let be the elementary matrices for operations 1, 2 and 3. A learner concludes that . Decide whether this conclusion is correct and give the correct relationship between these matrices. (4 marks)
Question 4
10 marksA matrix has rows and . The rows of a matrix , in order, are
Determine and
Justify your determinant transformations and explain why the inverse in this expression exists. Here is the transpose of .
Question 5
12 marksFor a real parameter , consider
- Find every value of for which the solution satisfies . Justify your method and your conclusion about the number of solutions. (6 marks)
- Let be the coefficient matrix in variable order , and let be obtained by replacing its first column with . A learner argues: “Whenever , the coefficient matrix is singular, so the system does not have a unique solution.” Find every for which the premise holds and decide whether the conclusion follows. (6 marks)
Question 6
10 marksLet
- Give one nonzero matrix such that . (2 marks)
- Describe every real matrix with this property. (4 marks)
- Decide whether any such can be invertible. Explain precisely why the argument “, so cancelling gives ” is or is not valid. (4 marks)
Question 7
14 marksVectors satisfy
Their coordinates are not given. Determine:
- . (4 marks)
- The cosine of the angle between and , and whether that angle is acute, right or obtuse. (4 marks)
- The distance between the points whose position vectors are and . (3 marks)
- Every real for which is orthogonal to . (3 marks)
Explain why the supplied information is sufficient without recovering coordinates.
Question 8
14 marksLet , , and . Find every point satisfying all three conditions:
- is equally distant from and
- is orthogonal to
Justify that no points are missing. For each resulting point, find its distance from , and determine which point is nearer to .
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:
Let be the right-hand side of claim , for . For the four equations to agree, these numbers must satisfy . The recorded numbers give , so the four recorded equations are inconsistent.
If claim 4 is wrong, the first three are exact. From and , obtain and . Then
giving . Claim 4 must have right-hand side 10. The checks are
However, the faulty claim cannot be identified from the record alone. For example, suppose claim 1 is wrong instead. Compatibility requires
The triple gives , , and . 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 is and is , must be . The product then has the same size as .
Both outside factors are invertible:
Multiplying on the left by and on the right by gives
Each inverse must be adjacent to the factor it cancels; matrix factors cannot be rearranged as if they were scalars. Here
Check directly:
Every solution must equal the displayed expression , 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 , with justification (2)
- Part 2: valid algebra or equivalent equations, including order (3); correct inverses or equivalent elimination (2); correct (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 is not even defined here.
Solution 3
Undo the operations in reverse order. Starting with , negate row 3, then add twice the current row 1 to row 2:
Finally interchange rows 1 and 3:
The elementary matrices are
Set . The original log says , not , and
All three elementary matrices are invertible, and is triangular with determinant 1. Thus is invertible. Alternatively, the two determinant sign changes in the log cancel, so .
Solution 3 continued
Because
the inverse is
Direct multiplication gives . A full row reduction of is an equally valid way to find this inverse.
The learner’s claim is false because . Correct relationships include
Suggested marking guide, 14 marks:
- Part 1: reverse order and operations correctly (2); obtain (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 , where
Since is triangular, . Therefore
This is nonzero, so exists. Using the determinant rules for a scalar multiple of a matrix, a product, an inverse and a transpose gives
A row-operation derivation is also valid. For example, begin with rows , scale row 1 by 2 and row 3 by 4, add row 2 to row 1, and then subtract of the current row 3 from row 2. This produces with determinant multiplier 8. The order matters when current rows are used.
Suggested marking guide, 10 marks:
- Valid row-combination or determinant argument (3); (2)
- Establish that the inverse exists (1); apply the four determinant rules with the factor (3); obtain (1)
Diagnostic D4: Multiplying the whole matrix by 3 contributes . Multiplying one row by 3 would contribute only 3. Transposing does not change a determinant.
Solution 5
The coefficient matrix is
Expansion along the first row gives
It is invertible for every ; only the right-hand side depends on . Every value of therefore gives exactly one solution.
For part 1, imposing in gives . Then gives , and forces . Conversely, gives the solution , 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
Then is equivalent to , which again gives . The direct method is shorter here; the determinant method is still valid.
For part 2, precisely when . This means , not that is singular. The relevant denominator remains . At the unique solution is , and its original left-hand sides are .
Suggested marking guide, 12 marks:
- Part 1: valid deduction of and , or equivalent method (3); and a converse check (1); justify existence and uniqueness (2)
- Part 2: correct replacement determinant (2); (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
it is nonzero, and direct multiplication gives .
For the complete description, write
Then
This is zero if and only if and . Hence every allowed matrix, with no omitted cases, is
Every such matrix has determinant , so none is invertible. Equivalently, if existed, multiplying on the right by would imply , contrary to the given matrix.
The proposed cancellation is invalid. A nonzero matrix need not be invertible; here . The displayed nonzero example also directly disproves the conclusion .
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 are singular (2); explain why 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 , and . Expand each dot product by distributing over sums and taking numerical factors outside. This reduces every calculation to these three numbers.
First,
Thus , a nonnegative scalar.
Next,
Both vectors are nonzero, so the angle formula is defined:
The cosine is negative, so the angle is obtuse.
The displacement between the two specified points is
Their distance is .
Finally,
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 by .
Solution 8
Write . Equal distances to and give equal squared distances:
After cancellation, , so .
Orthogonality gives , hence . The norm condition now becomes
Therefore or , and the only candidates are
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 confirms equal distances to and . The list is complete.
The distances to are
Thus is nearer to . Equal distance to and for each point does not mean that different possible points must be the same distance from .
Suggested marking guide, 14 marks:
- Equal-distance equation and (2); orthogonality and (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
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.
- D1, Q1: revisit whole-row operations and consistency; distinguish inconsistency from finding which recorded value is wrong
- D2, Q2: revisit matrix multiplication and inverses and guided question 1
- D3, Q3: revisit guided question 4; track the effect of the complete operation sequence
- D4, Q4: revisit guided question 3; keep a determinant multiplier beside every change
- D5, Q5: revisit guided question 5; identify the original coefficient determinant before the replacement determinant
- D6, Q6: revisit matrix multiplication and invertibility; test the proposed cancellation with an explicit product
- D7, Q7: revisit dot products and projection and guided question 7; use only the dot-product and norm material needed here
- D8, Q8: revisit guided question 7; write one equation for each condition and check every candidate in all of them
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.
- D1. The equations and are exact. A third record says . Find the only compatible and verify it with the solution.
- D2. Let and . Solve . Check whether reversing the two inverse factors gives the same answer.
- D3. Let , , and . Find and , keeping the factor order visible.
- D4. A matrix has determinant 3. Find .
- D5. For , , find the value of for which the Cramer numerator for is zero. Is the coefficient matrix singular at that value?
- D6. For , give one nonzero with . Explain why no such can be invertible.
- D7. If and , find and the angle between the vectors.
- D8. Find all points in that are equally distant from and and have distance 2 from the origin. Which is nearer to ?
Retry answer key
- Add the equations to obtain . Thus , , , with and .
- . The reversed product is , which is different and does not solve the equation. Direct multiplication of the correct gives .
- ; . Their products in either order are .
- . There are two rows, and transposition leaves the determinant unchanged.
- The coefficient determinant is . The replacement determinant for is , so it vanishes at . The coefficient matrix remains invertible; the unique solution is .
- One choice is . If an allowed were invertible, right multiplication of by would give the false statement .
- , so . The angle has cosine , hence is .
- Equal squared distances give ; the norm gives . The points are and . Their distances to are and , 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