QCE Vault / Specialist Maths Matrices and models practice QCE Specialist Maths · Original practice questions with worked solutions
Browse all questions Complex numbers practice Vectors practice Proof and induction practice Matrices and models practice Integration and its applications practice Differential equations and related rates practice Motion and mechanics practice Statistical inference practice Original practice exam Practise matrix operations, linear systems and transition models. Define what the entries and state-vector order represent before calculating.
Key ideas A matrix product A B AB A B is defined when the number of columns of A A A equals the number of rows of B B B . The order of multiplication matters. For a square matrix A A A , an inverse exists only if det A ≠ 0 \det A\ne0 det A = 0 . Then A x = b A\mathbf x=\mathbf b A x = b gives x = A − 1 b \mathbf x=A^{-1}\mathbf b x = A − 1 b . For a column-vector transition model, x n + 1 = T x n \mathbf x_{n+1}=T\mathbf x_n x n + 1 = T x n . Check the model conventions before applying repeated powers. Worked example If T = ( 0.8 0.3 0.2 0.7 ) T=\begin{pmatrix}0.8&0.3\\0.2&0.7\end{pmatrix} T = ( 0.8 0.2 0.3 0.7 ) and x 0 = ( 100 , 0 ) T \mathbf x_0=(100,0)^T x 0 = ( 100 , 0 ) T , then x 1 = ( 80 , 20 ) T \mathbf x_1=(80,20)^T x 1 = ( 80 , 20 ) T . A common mistake A transition matrix and its transpose represent different conventions. Do not switch row and column state vectors halfway through a model.
Try these questions Attempt each question before revealing the worked solution. Saved questions and checked answers also appear in the main bank on this device. Exam marks are recorded after marking a practice exam.
Q47 · Practice question Simple familiar 1 mark
QUESTION 47 An augmented matrix in row-echelon form has final row [ 0 0 0 3 ] \left[\begin{array}{ccc|c}0&0&0&3\end{array}\right] [ 0 0 0 3 ] . The corresponding system has (B) infinitely many solutions
The final row represents 0 x + 0 y + 0 z = 3 0x+0y+0z=3 0 x + 0 y + 0 z = 3 , or 0 = 3 0=3 0 = 3 . This contradiction means the system has no solution. Selects the correct option.
[1 mark] Q40 · Practice question Complex unfamiliar 7 marks
QUESTION 40 (7 marks) Consider the system x + y + z = 3 , 2 x + 3 y + 4 z = 8 , x + 2 y + ( a 2 − 5 a + 9 ) z = a + 3. \begin{aligned}x+y+z&=3,\\2x+3y+4z&=8,\\x+2y+(a^2-5a+9)z&=a+3.\end{aligned} x + y + z 2 x + 3 y + 4 z x + 2 y + ( a 2 − 5 a + 9 ) z = 3 , = 8 , = a + 3. Use Gaussian elimination to classify the system as having a unique solution, no solution or infinitely many solutions for all real values of a a a . Where the solution is unique, determine it in terms of a a a . ANSWER a = 2 a=2 a = 2 : infinitely many; a = 3 a=3 a = 3 : none; otherwise ( x , y , z ) = ( 1 + 1 / ( a − 3 ) , 2 − 2 / ( a − 3 ) , 1 / ( a − 3 ) ) (x,y,z)=(1+1/(a-3),\,2-2/(a-3),\,1/(a-3)) ( x , y , z ) = ( 1 + 1/ ( a − 3 ) , 2 − 2/ ( a − 3 ) , 1/ ( a − 3 )) . Apply R 2 ← R 2 − 2 R 1 R_2\leftarrow R_2-2R_1 R 2 ← R 2 − 2 R 1 and R 3 ← R 3 − R 1 R_3\leftarrow R_3-R_1 R 3 ← R 3 − R 1 : y + 2 z = 2 , y + ( a 2 − 5 a + 8 ) z = a . y+2z=2,\qquad y+(a^2-5a+8)z=a. y + 2 z = 2 , y + ( a 2 − 5 a + 8 ) z = a . Subtract the first reduced equation from the second: ( a 2 − 5 a + 6 ) z = a − 2 ⇒ ( a − 2 ) ( a − 3 ) z = a − 2. (a^2-5a+6)z=a-2\quad\Rightarrow\quad(a-2)(a-3)z=a-2. ( a 2 − 5 a + 6 ) z = a − 2 ⇒ ( a − 2 ) ( a − 3 ) z = a − 2. If a = 2 a=2 a = 2 , the last equation is 0 = 0 0=0 0 = 0 . Taking z = s z=s z = s gives ( x , y , z ) = ( 1 + s , 2 − 2 s , s ) (x,y,z)=(1+s,2-2s,s) ( x , y , z ) = ( 1 + s , 2 − 2 s , s ) , so there are infinitely many solutions. If a = 3 a=3 a = 3 , the last equation is 0 = 1 0=1 0 = 1 , so there is no solution. For a ≠ 2 , 3 a\ne2,3 a = 2 , 3 , back-substitution gives the unique solution z = 1 a − 3 , y = 2 − 2 a − 3 , x = 1 + 1 a − 3 . z=\frac1{a-3},\qquad y=2-\frac2{a-3},\qquad x=1+\frac1{a-3}. z = a − 3 1 , y = 2 − a − 3 2 , x = 1 + a − 3 1 . Eliminates to two reduced equations.
[2 marks] Obtains the factorised final equation.
[1 mark] Obtains the unique solution for other values.
[2 marks] Q42 · Practice question Complex familiar 6 marks
QUESTION 42 (6 marks) Four competitors A , B , C , D A,B,C,D A , B , C , D have dominance matrix D = ( 0 1 1 0 0 0 1 1 0 0 0 1 1 0 0 0 ) . D=\begin{pmatrix}0&1&1&0\\0&0&1&1\\0&0&0&1\\1&0&0&0\end{pmatrix}. D = 0 0 0 1 1 0 0 0 1 1 0 0 0 1 1 0 . A competition uses the score defined as the row sum of D + D 2 D+D^2 D + D 2 . b) Determine the score of each competitor and hence the ranking from highest to lowest score.
[3 marks] ANSWER Scores: A = 5 A=5 A = 5 , B = 4 B=4 B = 4 , C = 2 C=2 C = 2 , D = 3 D=3 D = 3 ; ranking A , B , D , C A,B,D,C A , B , D , C . (a) Matrix multiplication gives D 2 = ( 0 0 1 2 1 0 0 1 1 0 0 0 0 1 1 0 ) . D^2=\begin{pmatrix}0&0&1&2\\1&0&0&1\\1&0&0&0\\0&1&1&0\end{pmatrix}. D 2 = 0 1 1 0 0 0 0 1 1 0 0 1 2 1 0 0 . (b) The row sums of D D D are ( 2 , 2 , 1 , 1 ) (2,2,1,1) ( 2 , 2 , 1 , 1 ) and those of D 2 D^2 D 2 are ( 3 , 2 , 1 , 2 ) (3,2,1,2) ( 3 , 2 , 1 , 2 ) . Adding gives scores A : 5 A:5 A : 5 , B : 4 B:4 B : 4 , C : 2 C:2 C : 2 , D : 3 D:3 D : 3 . The ranking is A , B , D , C A,B,D,C A , B , D , C . Determines all four scores.
[2 marks] All matrices and models practice questions 23 original questions · Page 1 of 1
Q40 · Original practice · 7 marks Consider the system x + y + z = 3 , 2 x + 3 y + 4 z = 8 , x + 2 y + ( a 2 − 5 a + 9 ) z = a + 3. \begin{aligned}x+y+z&=3,\\2x+3y+4z&=8,\\x+2y+(a^2-5a+9)z&=a+3.\end{aligned} x + y + z 2 x + 3 y + 4 z x + 2 y + ( a 2 − 5 a + 9 ) z = 3 , = 8 , = a + 3. Use Gaussian elimination to classify the system as having a unique solution, no solution or infinitely many solutions for all real values of a a a . Where the solution is unique, determine it in terms of a a a . Matrices Q42 · Original practice · 6 marks Four competitors A , B , C , D A,B,C,D A , B , C , D have dominance matrix D = ( 0 1 1 0 0 0 1 1 0 0 0 1 1 0 0 0 ) . D=\begin{pmatrix}0&1&1&0\\0&0&1&1\\0&0&0&1\\1&0&0&0\end{pmatrix}. D = 0 0 0 1 1 0 0 0 1 1 0 0 0 1 1 0 . A competition uses the score defined as the row sum of D + D 2 D+D^2 D + D 2 . Matrices Q44 · Original practice · 5 marks A three-class population is modelled by L = ( 0 0.8 1.5 0.4 0 0 0 0.6 0 ) , p 0 = ( 150 100 50 ) . L=\begin{pmatrix}0&0.8&1.5\\0.4&0&0\\0&0.6&0\end{pmatrix},\qquad\mathbf p_0=\begin{pmatrix}150\\100\\50\end{pmatrix}. L = 0 0.4 0 0.8 0 0.6 1.5 0 0 , p 0 = 150 100 50 . Matrices Q47 · Original practice · 1 mark An augmented matrix in row-echelon form has final row [ 0 0 0 3 ] \left[\begin{array}{ccc|c}0&0&0&3\end{array}\right] [ 0 0 0 3 ] . The corresponding system has Matrices Q49 · Original practice · 1 mark For the dominance matrix D = ( 0 1 1 0 0 0 1 1 0 0 0 1 1 0 0 0 ) , D=\begin{pmatrix}0&1&1&0\\0&0&1&1\\0&0&0&1\\1&0&0&0\end{pmatrix}, D = 0 0 0 1 1 0 0 0 1 1 0 0 0 1 1 0 , the entry ( D 2 ) 1 , 4 (D^2)_{1,4} ( D 2 ) 1 , 4 is Matrices Q70 · Original practice · 6 marks A population has Leslie matrix L = ( 0 1.4 2.0 0.5 0 0 0 0.6 0 ) , p 0 = ( 200 120 80 ) . L=\begin{pmatrix}0&1.4&2.0\\0.5&0&0\\0&0.6&0\end{pmatrix},\qquad\mathbf p_0=\begin{pmatrix}200\\120\\80\end{pmatrix}. L = 0 0.5 0 1.4 0 0.6 2.0 0 0 , p 0 = 200 120 80 . Matrices Q72 · Original practice · 6 marks Five competitors have dominance matrix D = ( 0 1 1 0 1 0 0 1 1 0 0 0 0 1 1 1 0 0 0 1 0 1 0 0 0 ) . D=\begin{pmatrix}0&1&1&0&1\\0&0&1&1&0\\0&0&0&1&1\\1&0&0&0&1\\0&1&0&0&0\end{pmatrix}. D = 0 0 0 1 0 1 0 0 0 1 1 1 0 0 0 0 1 1 0 0 1 0 1 1 0 . A dominance score is defined as the row sum of D + D 2 D+D^2 D + D 2 . Matrices Q101 · Original practice · 1 mark For L = ( 0 1.2 1.8 0.6 0 0 0 0.7 0 ) , p = ( 100 80 40 ) , L=\begin{pmatrix}0&1.2&1.8\\0.6&0&0\\0&0.7&0\end{pmatrix},\qquad \mathbf p=\begin{pmatrix}100\\80\\40\end{pmatrix}, L = 0 0.6 0 1.2 0 0.7 1.8 0 0 , p = 100 80 40 , the youngest class after one step is Matrices Q103 · Original practice · 1 mark For the dominance matrix D = ( 0 1 1 0 0 0 1 1 0 0 0 1 1 0 0 0 ) , D=\begin{pmatrix}0&1&1&0\\0&0&1&1\\0&0&0&1\\1&0&0&0\end{pmatrix}, D = 0 0 0 1 1 0 0 0 1 1 0 0 0 1 1 0 , the entry ( D 2 ) 1 , 4 = 2 (D^2)_{1,4}=2 ( D 2 ) 1 , 4 = 2 means that competitor 1 has Matrices Q112 · Original practice · 1 mark The matrix ( 0 1 − 1 0 ) \begin{pmatrix}0&1\\-1&0\end{pmatrix} ( 0 − 1 1 0 ) maps ( 2 , 3 ) (2,3) ( 2 , 3 ) to Matrices Q127 · Original practice · 5 marks Let A = ( 2 1 1 1 ) A=\begin{pmatrix}2&1\\1&1\end{pmatrix} A = ( 2 1 1 1 ) . Matrices Q156 · Original practice · 7 marks An insect population has juvenile and adult stages. The model is
( J n + 1 A n + 1 ) = ( 0 2 0.5 0.5 ) ( J n A n ) , ( J 0 A 0 ) = ( 200 100 ) . \begin{pmatrix}J_{n+1}\\ A_{n+1}\end{pmatrix}
=\begin{pmatrix}0&2\\0.5&0.5\end{pmatrix}
\begin{pmatrix}J_n\\ A_n\end{pmatrix},\qquad
\begin{pmatrix}J_0\\A_0\end{pmatrix}=\begin{pmatrix}200\\100\end{pmatrix}. ( J n + 1 A n + 1 ) = ( 0 0.5 2 0.5 ) ( J n A n ) , ( J 0 A 0 ) = ( 200 100 ) . The entries are expected population counts; fractional values are permitted. Th…
Further matrices: Leslie models Q197 · Original practice · 5 marks In a tournament A beats B, B beats C and C beats A. Define D i j = 1 D_{ij}=1 D ij = 1 if i beats j and 0 otherwise, in order A,B,C. There are no draws. Matrices and applications Q198 · Original practice · 5 marks A dominance matrix in order A,B,C,D is
M = ( 0 1 1 0 0 0 1 1 0 0 0 1 1 0 0 0 ) . M=\begin{pmatrix}0&1&1&0\\0&0&1&1\\0&0&0&1\\1&0&0&0\end{pmatrix}. M = 0 0 0 1 1 0 0 0 1 1 0 0 0 1 1 0 . A score is the row sum of M + M 2 M+M^2 M + M 2 . Matrices and applications Q199 · Original practice · 5 marks A population follows ( J n + 1 A n + 1 ) = ( 0 f 0.4 0.6 ) ( J n A n ) \binom{J_{n+1}}{A_{n+1}}=\begin{pmatrix}0&f\\0.4&0.6\end{pmatrix}\binom{J_n}{A_n} ( A n + 1 J n + 1 ) = ( 0 0.4 f 0.6 ) ( A n J n ) with f>0. Matrices and applications Q200 · Original practice · 7 marks A three-stage insect model uses
L = ( 0 0 4 0.5 0 0 0 0.5 0 ) . L=\begin{pmatrix}0&0&4\\0.5&0&0\\0&0.5&0\end{pmatrix}. L = 0 0.5 0 0 0 0.5 4 0 0 . Counts are expected values and may be fractional.
Matrices and applications Q201 · Original practice · 5 marks A population first undergoes transition ( 0 2 0.5 0.5 ) \begin{pmatrix}0&2\\0.5&0.5\end{pmatrix} ( 0 0.5 2 0.5 ) . After each transition a fraction q of the new adults is removed, 0 ≤ q < 1 0\le q<1 0 ≤ q < 1 . Juveniles are not removed. Matrices and applications Q240 · Original practice · 7 marks An escape-room panel assigns nonnegative real values r, g and b to three rune types. Its calibration totals satisfy
r + g + b = 12 , 2 r + g + 3 b = 25 , r + 2 g + b = 17. r+g+b=12,\qquad2r+g+3b=25,\qquad r+2g+b=17. r + g + b = 12 , 2 r + g + 3 b = 25 , r + 2 g + b = 17. Further matrices and systems of equations Q241 · Original practice · 8 marks Three flat sensor screens are modelled by
Π 1 : x + y + z = 6 , Π 2 : x − y + z = 2 , Π 3 : x + y + a z = b , \Pi_1:x+y+z=6,\qquad\Pi_2:x-y+z=2,\qquad\Pi_3:x+y+az=b, Π 1 : x + y + z = 6 , Π 2 : x − y + z = 2 , Π 3 : x + y + a z = b , where a , b ∈ R a,b\in\mathbb R a , b ∈ R . Further matrices and systems of equations Q272 · Original practice · 5 marks Let
A = ( 1 1 0 0 1 1 1 0 1 ) , B = ( 1 0 0 0 1 0 0 0 1 ) , C = ( 2 2 5 7 3 2 2 1 0 ) . A=\begin{pmatrix}1&1&0\\0&1&1\\1&0&1\end{pmatrix},\quad B=\begin{pmatrix}1&0&0\\0&1&0\\0&0&1\end{pmatrix},\quad C=\begin{pmatrix}2&2&5\\7&3&2\\2&1&0\end{pmatrix}. A = 1 0 1 1 1 0 0 1 1 , B = 1 0 0 0 1 0 0 0 1 , C = 2 7 2 2 3 1 5 2 0 . A 3 × 3 3\times3 3 × 3 matrix X satisfies X A + X B = C XA+XB=C X A + X B = C . Further matrices Q274 · Original practice · 7 marks A breeding program models females in three one-year age classes. The table gives births per female during a step, the proportion surviving into the next age class, and initial counts. Offspring enter the youngest class; no females survive beyond the oldest class. Fractional expected counts are permitted.
Further matrices Q275 · Original practice · 6 marks A two-stage population follows
( J n + 1 A n + 1 ) = ( f 2 f s 0 ) ( J n A n ) , f > 0 , 0 < s ≤ 1. \binom{J_{n+1}}{A_{n+1}}=\begin{pmatrix}f&2f\\s&0\end{pmatrix}\binom{J_n}{A_n},\quad f>0,\quad0<s\le1. ( A n + 1 J n + 1 ) = ( f s 2 f 0 ) ( A n J n ) , f > 0 , 0 < s ≤ 1. The initial vector is ( 40 , 20 ) T (40,20)^T ( 40 , 20 ) T and the vector after one step is ( 32 , 20 ) T (32,20)^T ( 32 , 20 ) T . Further matrices Q276 · Original practice · 6 marks Three teams A, B and C play a mini-tournament. A defeats B, B defeats C, and C defeats A. Let D i j = 1 D_{ij}=1 D ij = 1 when team i defeats team j and 0 otherwise, with order A, B, C. Further matrices