Matrices MS

Matrices [351 marks]
1. [Maximum mark: 4] EXM.1.AHL.TZ0.2

[4]
Markscheme
* This question is from an exam for a previous syllabus, and may contain
minor differences in marking or structure.
2p
2
+ 12p = 14 (M1)(A1)
2
p + 6p − 7 = 0
(p + 7) (p − 1) = 0 (A1)
p = −7 or p = 1 (A1) (C4)
Note: Both answers are required for the final (A1).
[4 marks]
[4]
Markscheme
B = (BA) A
−1
(M1)
11 2 0 −2
= −
1
4
( )( ) (M1)
44 8 −2 5
−4 −12
= −
1
4
( ) (A1)
−16 −48
1 3
= ( ) (A1)
4 12
OR
a b 5 2 11 2
( )( ) = ( ) (M1)
c d 2 0 44 8
5a + 2b = 11
⇒ }
2a = 2
⇒ a = 1 , b = 3 (A1)
5c + 2d = 44
}
2c = 8
⇒ c = 4 , d = 12 (A1)
1 3
B = ( ) (A1) (C4)
4 12
Note: Correct solution with inversion (ie AB instead of BA) earns FT marks,
(maximum [3 marks]).
[4 marks]

[6]
Markscheme
finding det A = e x
− e
−x
(2 + e )
x
or equivalent A1
A is singular ⇒ det A = 0 (R1)
x −x x
e − e (2 + e ) = 0
e
2x
− e
x
− 2 = 0 A1
solving for e x
(M1)
e
x
> 0 (or equivalent explanation) (R1)
x
e = 2
x = ln 2 (only) A1 N0
[6 marks]

[2]
Markscheme
det A = −2 A2
[2 marks]
[5]
Markscheme
1 2 1 2
A2 = ( )( ) M1
k −1 k −1
1 + 2k 0
= ( ) A2
0 2k + 1
Note: Award A2 for 4 correct, A1 for 2 or 3 correct.
1 + 2k = 0 M1
k = −
1
2
A1
[5 marks]

[5]
Markscheme
2 −1 2 −1 7 −6
M2 = ( )( ) = ( ) M1A1
−3 4 −3 4 −18 19
7 −6 12 −6
⇒ ( ) − ( ) + kI = 0 (M1)
−18 19 −18 24
−5 0
⇒ ( ) + kI = 0 (A1)
0 −5
⇒k= 5 A1
[5 marks]
[6]
Markscheme
For multiplying (I – X)(I + X + X2) M1
= I2 + IX + IX2 – XI – X2 – X3 = I + X + X2 – X – X2 – X3 (A1)(A1)
= I – X3 A1
=I A1
AB = I ⇒ A–1 = B (R1)
(I – X) (I + X + X2) = I ⇒ (I – X)–1 = I + X + X2 AG N0
[5 marks]
[3]
Markscheme
∣k − 4 3 ∣
∣ ∣ = 0
∣ −2 k + 1∣
⇒ (k − 4) (k + 1) + 6 = 0 (M1)
⇒ k
2
− 3k + 2 = 0 (M1)
⇒ (k − 2) (k − 1) = 0
⇒ k = 2 or k = 1 (A1) (C3)
[3 marks]

[3]
Markscheme
x 4 2 y 2x + 32 xy + 16
AB = ( )( ) = ( ) (A1)
4 2 8 4 24 4y + 8
2 y x 4 2x + 4y 2y + 8
BA = ( )( ) = ( ) (A1)
8 4 4 2 8x + 16 40
AB = BA ⇒ 8x + 16 = 24 and 4y + 8 = 40
This gives x = 1 and y = 8 . (A1) (C3)
[3 marks]
[6]
Markscheme
AA–1XB = ΑC (M1)(A1)
IXBB–1 = ACB–1 (M1)(A1)
X = ACB–1 (M1)(A1) (C6)
[6 marks]

[6]
Markscheme
For multiplying (I – X)(I + X + X2) M1
= I2 + IX + IX2 – XI – X2 – X3 = I + X + X2 – X – X2 – X3 (A1)(A1)
= I – X3 A1
=I A1
AB = I ⇒ A–1 = B (R1)
(I – X)(I + X + X2) = I ⇒ (I – X)–1 = I + X + X2 AG N0
[6 marks]
[6]
Markscheme
METHOD 1
2 3 4 −9 −2 12
A – AB = ( ) − ( ) = ( ) (M1)(A1)
1 −2 2 6 −1 −8
−2 12
X = B–1(A – AB) = B–1 ( ) (M1)
−1 −8
−3 0 −2 12
= −
1
6
( )( ) (A1)
0 2 −1 −8
−1 6
= (
1 8
) (A2) (C6)
3 3
METHOD 2
Attempting to set up a matrix equation (M2)
X = B–1(A – AB) (A2)
−1 6
= (
1 8
) (from GDC) (A2) (C6)
3 3
[6 marks]
(a) [2]
Markscheme
finding det M = a
2
+ b
2
A1
a
2
+ b
2
> 0 , therefore M is non-singular or equivalent statement R1
[2 marks]
(b) [2]
Markscheme
2 2
a b a b a − b 2ab
M2 =( )( ) = (
2 2
) M1A1
−b a −b a −2ab a − b
[2 marks]
(c) [2]
Markscheme
EITHER
det(M2) = (a
2 2
− b ) (a
2 2
− b ) + (2ab) (2ab) A1
det(M2) =
2 2 2
2 2 2 2
(a − b ) + (2ab) (= (a + b ) )
since the first term is non-negative and the second is positive R1
therefore det(M2) > 0
Note: Do not penalise first term stated as positive.
OR
det(M2) = (det M)2 A1
since det M is positive so too is det (M2) R1
[2 marks]
(a) [1]
Markscheme
a = 16 A1
[1 mark]
(b) [2]
Markscheme
1 2 −1
⎛ ⎞
A–1 = 1
16
⎜3 −1 0 ⎟ (M1)A1
⎝ ⎠
0 3 1
[2 marks]
(c) [2]
Markscheme
AX = C ⇒ X = A–1C (M1)
1 2 −1 8
⎛ ⎞⎛ ⎞
1
= ⎜3 −1 0 ⎟⎜ 0 ⎟
16
⎝ ⎠⎝ ⎠
0 3 1 −4
12 0.75
⎛ ⎞ ⎛ ⎛ ⎞⎞
=
1
16
⎜ 24 ⎟ ⎜= ⎜ 1.5 ⎟⎟ A1
⎝ ⎠ ⎝ ⎝ ⎠⎠
−4 −0.25
[2 marks]
(a) [2]
Markscheme
0.1 0.4 0.1

⎛ ⎞
A–1 = ⎜ −0.7 0.2 0.3 ⎟ A2 N2
⎝ ⎠
−1.2 0.2 0.8
[2 marks]
(b) [3]
Markscheme
x 1
⎛ ⎞ ⎛ ⎞
For attempting to calculate ⎜ y ⎟ = A−1
⎜2⎟ M1
⎝ ⎠ ⎝ ⎠
z 3
x = 1.2, y = 0.6, z = 1.6 (so the point is (1.2, 0.6, 1.6)) A2 N2
[3 marks]
(c) [1]
Markscheme
(1.2, 0.6, 1.6) lies on x + y + z = d
∴ d = 3.4 A1 N1
[1 mark]
(a) [2]
Markscheme
det A = 5(1) − 7(−2) = 19
1 2
1 2
A–1 = 1
19
( ) = (
19
−7
19
) (A2)
5
−7 5
19 19
1 2
Note: Award (A1) for ( ) , (A1) for dividing by 19.
−7 5
OR
0.0526 0.105
A–1 = ( ) (G2)
−0.368 0.263
[2 marks]
(b.i) [2]
Markscheme
XA + B = C ⇒ XA = C – Β (M1)
X = (C – Β)Α–1 (A1)
OR
X = (C – B)A–1 (A2)
[2 marks]
(b.ii) [2]
Markscheme
1 2
−11 −7
Β)Α–1 (A1)
19 19
(C – =( )(
−7 5
)
−13 9
19 19
38 −57
2 −3
⇒X = ( 19 19
) = ( ) (A1)
−76 19
−4 1
19 19
OR
2 −3
X=( ) (G2)
−4 1
Note: If premultiplication by A –1 is used, award (M1)(M0) in part (i) but award

−37 11
(A2) for ( 19 19
94
) in part (ii).
12
19 19
[2 marks]
(a) [2]
Markscheme
Since det A ≠ 0, A–1 exists. (M1)
Hence AB = C ⇒ B = A–1C (C1)
[2 marks]
(b.i) [1]
Markscheme
1 0 0
⎛ ⎞
DA = ⎜ 0 1 0⎟ (A1)
⎝ ⎠
0 0 1
[1 mark]
(b.ii) [2]
Markscheme
B = A–1C = DC (M1)
1
⎛ ⎞
= ⎜ −1 ⎟ (A1)
⎝ ⎠
2
[2 marks]
(c) [2]
Markscheme
x + 2y + 3z = 5
The system of equations is 2x − y + 2z = 7
3x − 3y + 2z = 10
x
⎛ ⎞
or A⎜ y ⎟ = C (M1)
⎝ ⎠
z
The required point = (1, –1, 2). (A1)
[2 marks]

(a) [2]
Markscheme
−1
1 2 1 2 −7 3
⎛ ⎞ ⎛ ⎞
⎜1 1 2⎟ = ⎜ 0 2 −1 ⎟ A2 N2
⎝ ⎠ ⎝ ⎠
2 1 4 −1 3 −1
[2 marks]
(b) [4]
Markscheme
In matrix form Ax = B or x = A−1 B M1
,
x = 2 y = −3 z = 4 , A1A1A1 N0
[4 marks]
(a) [2]
Markscheme
AB = I
(AB)11 = 1 ⇒ a – 12 + 6 = 1, giving a = 7 (A1) (C1)
(AB)22 = 1 ⇒ –16 + 5b + 7 = 1, giving b = 2 (A1) (C1)
[2 marks]
(b) [2]
Markscheme
5 x
⎛ ⎞ ⎛ ⎞
the system is BX = ⎜0⎟ where X = ⎜y ⎟ .
⎝ ⎠ ⎝ ⎠
6 z
5 7 −4 −6 5
⎛ ⎞ ⎛ ⎞⎛ ⎞
Then, X = A ⎜ 0 ⎟ = ⎜ −8 5 7 ⎟⎜0⎟. (M1)
⎝ ⎠ ⎝ ⎠⎝ ⎠
6 −5 3 4 6
Thus x ,
= −1 y = 2 z = −1 , (A1) (C2)
[2 marks]
(a) [3]
Markscheme
−4 8 5 2
3Q = ( ) − ( ) (A1)
2 14 −1 a
−9 6
3Q = ( ) (A1)
3 14 − a
−3 2
Q=( 14−a
) (A1) (N3)
1
3
[3 marks]
(b) [4]
Markscheme
−2 4 5 2
CD = ( )( )
1 7 −1 a
−14 −4 + 4a
= ( ) (A1)(A1)(A1)(A1) (N4)
−2 2 + 7a
[4 marks]
(c) [2]
Markscheme
det D = 5a + 2 (may be implied) (A1)

a −2
D–1 = 1
5a+2
( ) (A1) (N2)
1 5
[2 marks]
(a.i) [1]
Markscheme
a =5 A1 N1
[1 mark]
(a.ii) [2]
Markscheme
b +9=4 (M1)
b = −5 A1 N2
[2 marks]
(b) [3]
Markscheme
Comparing elements 3(2) − 5(q) = −9 M1
q =3 A2 N2
[3 marks]
(a.i) [1]
Markscheme
a =4 A1 N1
[1 mark]
(a.ii) [1]
Markscheme
b =7 A1 N1
[1 mark]
(b) [1]
Markscheme
EITHER
x 7
⎛ ⎞ ⎛ ⎞
A⎜ y ⎟ = ⎜ 10 ⎟ A1 N1
⎝ ⎠ ⎝ ⎠
z −12
OR
1 2 0 x 7
⎛ ⎞⎛ ⎞ ⎛ ⎞
⎜ −3 1 −1 ⎟ ⎜ y ⎟ = ⎜ 10 ⎟ A1 N1
⎝ ⎠⎝ ⎠ ⎝ ⎠
2 −2 1 z −12
[1 mark]
(c) [3]
Markscheme
x 7
⎛ ⎞ ⎛ ⎞
⎜y ⎟ = A−1 ⎜ 10 ⎟ (accept algebraic method) (M1)

⎝ ⎠ ⎝ ⎠
z −12
x −3
⎛ ⎞ ⎛ ⎞
⎜y ⎟ = ⎜ 5 ⎟ (accept x = −3, y = 5, z = 4) A2 N3
⎝ ⎠ ⎝ ⎠
z 4
[3 marks]
(a) [2]
Markscheme
1 2 1
− −
⎛ 3 3 3 ⎞ −0.333 0.667 −0.333
⎛ ⎞
A−1 = ⎜ −
⎜
1 5
−
7 ⎟
⎟ or ⎜ −0.333 1.67 −2.33 ⎟ A2 N2
⎜ 3 3 3 ⎟
⎝ ⎠
⎝ 2 4 5
⎠ 0.667 −1.33 1.67
−
3 3 3
[2 marks]
(b.i) [1]
Markscheme
X = A−1B A1 N1
[1 mark]
(b.ii) [3]
Markscheme
5
⎛ ⎞
X= ⎜2⎟ A3 N3
⎝ ⎠
3
[3 marks]
(a) [3]
Markscheme
6 4
2A = ( ) (A1)
2k 8
4 2
2A − B = ( ) A2 N3
2k − 1 5
[3 marks]
(b) [3]
Markscheme
Evidence of using the definition of determinant (M1)
Correct substitution (A1)
eg 4(5) − 2(2k − 1), 20 − 2(2k − 1), 20 − 4k + 2
det (2A − B) = 22 − 4k A1 N3
[3 marks]
(a) [3]
Markscheme
Attempting to multiply matrices (M1)
3
⎛ ⎞ 2 2
1 x −1 3 + x − 2 1 + x
( )⎜x⎟ = ( ) (= ( )) A1A1 N3
3 1 4 ⎝ ⎠ 9 + x + 8 17 + x
2
[3 marks]
(b) [3]
Markscheme
Setting up equation M1
2 2
1 + x 20 2 + 2x 20
eg 2( ) = ( ) , ( ) = ( ) ,
17 + x 28 34 + 2x 28
2
1 + x 10
( ) = ( )
17 + x 14
2 2
2 + 2x = 20 1 + x = 10
( ) (A1)
34 + 2x = 28 17 + x = 14
x = −3 A1 N2
[3 marks]
(a) [2]
Markscheme
evidence of addition (M1)
eg at least two correct elements
4 2
A+ B= ( ) A1 N2
1 0
[2 marks]
(b) [2]
Markscheme
evidence of multiplication (M1)
−3 −6
−3A = ( ) A1 N2
−9 3
[2 marks]
(c) [3]
Markscheme
evidence of matrix multiplication (in correct order) (M1)
1 (3) + 2 (−2) 1 (0) + 2 (1)

eg AB = ( )
3 (3) + (−1) (−2) 3 (0) + (−1) (1)
−1 2
AB = ( ) A2 N3
11 −1
[3 marks]
(a) [4]
Markscheme
1 a 1 b 1 + 2a b + 3a
( )( ) = ( )
2 3 2 3 8 2b + 9
1 b 1 a 1 + 2b a + 3b
( )( ) = ( ) M1A1
2 3 2 3 8 2a + 9
So require a = b M1A1
[4 marks]
(b.i) [2]
Markscheme
∣1 a∣
∣ ∣ = 3 − 2a = −1 ⇒ a = 2 M1A1
∣2 3∣
[2 marks]
(b.ii) [1]
Markscheme
−1
1 2 −3 2
( ) = ( ) A1
2 3 2 −1
[1 mark]
(a) [2]
Markscheme
2a −2
A2 = ( ) (M1)A1
−a 2a + 1
[2 marks]
(b) [3]
Markscheme
METHOD 1
det A2 = 4a 2
+ 2a − 2a = 4a
2
M1
a = ±2 A1A1 N2
METHOD 2
det A = −2a M1
det A = ±4
a = ±2 A1A1 N2
[3 marks]
(a) [2]
Markscheme
1 3 3 −2 18 −14
BA = (( )( )) = ( ) A2
2 −2 5 −4 −4 4
Note: Award A1 for one error, A0 for two or more errors.
[2 marks]
(b) [2]
Markscheme
det(BA) = (72 – 56) = 16 (M1)A1
[2 marks]
(c) [3]
Markscheme
EITHER
A(A–1B + 2A–1)A = BA + 2A (M1)A1
24 −18
= ( ) A1
6 −4
OR
−4 2
A–1 = −
1
2
( ) (A1)
−5 3
an attempt to evaluate (M1)

0 −16 −4 2
A–1B + 2A–1 = −
1
2
( ) − ( )
1 −21 −5 3
3 −2 4 6 3 −2
A(A–1B + 2A–1)A = ( )( )( )
5 −4 4.5 7.5 5 −4
3 3 3 −2 24 −18
= ( )( ) = ( ) A1
2 0 5 −4 6 −4
[3 marks]
(a) [2]
Markscheme
(A + B)2 = A2 + AB + BA + B2 A2
Note: Award A1 in parts (a) to (c) if error is correctly identified, but not
corrected.
[2 marks]
(b) [2]
Markscheme
(A – kI)3 = A 3 – 3kA2 + 3k2A – k3I A2
corrected.
[2 marks]
(c) [2]
Markscheme
CA = B ⇒ C = BA–1 A2
corrected.
[2 marks]
(a) [2]
Markscheme
Attempting to find det A (M1)
det A = k
2
+ 2k − 1 A1 N2
[2 marks]
(b) [4]
Markscheme
System has a unique solution provided det A ≠ 0 (R1)
k
2
+ 2k − 1 ≠ 0 (A1)
Solving k 2
+ 2k − 1 ≠ 0 or equivalent for k M1
k ∈ R \ {−1 ± √ 2} (accept k ≠ −1 ± √ 2, k ≠ −2.41, 0.414)
A1 N3
[4 marks]
(a) [2]
Markscheme
det A = 5(1) − 7(−2) = 19
1 2
1 2
A–1 = 1
19
( ) = (
19
−7
19
) (A2)
5
−7 5
19 19
1 2
Note: Award (A1) for ( ) , (A1) for dividing by 19.
−7 5
OR
0.0526 0.105
A–1 = ( ) (G2)
−0.368 0.263
[2 marks]
(b.i) [2]
Markscheme
XA + B = C ⇒ XA = C – Β (M1)
X = (C – Β)Α–1 (A1)
OR
X = (C – B)A–1 (A2)
[2 marks]
(b.ii) [2]
Markscheme
1 2
−11 −7
Β)Α–1 (A1)
19 19
(C – =( )(
−7 5
)
−13 9
19 19
38 −57
2 −3
⇒X = ( 19 19
) = ( ) (A1)
−76 19
−4 1
19 19
OR
2 −3
X=( ) (G2)
−4 1
Note: If premultiplication by A –1 is used, award (M1)(M0) in part (i) but award

−37 11
(A2) for ( 19 19
94
) in part (ii).
12
19 19
[2 marks]
(a) [2]
Markscheme
evidence of addition (M1)
4 2
A+ B= ( ) A1 N2
1 0
[2 marks]
(b) [2]
Markscheme
evidence of multiplication (M1)
−3 −6
−3A = ( ) A1 N2
−9 3
[2 marks]
(c) [3]
Markscheme
evidence of matrix multiplication (in correct order) (M1)
1 (3) + 2 (−2) 1 (0) + 2 (1)

eg AB = ( )
3 (3) + (−1) (−2) 3 (0) + (−1) (1)
−1 2
AB = ( ) A2 N3
11 −1
[3 marks]
(a) [4]
Markscheme
1 a 1 b 1 + 2a b + 3a
( )( ) = ( )
2 3 2 3 8 2b + 9
1 b 1 a 1 + 2b a + 3b
( )( ) = ( ) M1A1
2 3 2 3 8 2a + 9
So require a = b M1A1
[4 marks]
(b.i) [2]
Markscheme
∣1 a∣
∣ ∣ = 3 − 2a = −1 ⇒ a = 2 M1A1
∣2 3∣
[2 marks]
(b.ii) [1]
Markscheme
−1
1 2 −3 2
( ) = ( ) A1
2 3 2 −1
[1 mark]
(a) [2]
Markscheme
2a −2
A2 = ( ) (M1)A1
−a 2a + 1
[2 marks]
(b) [3]
Markscheme
METHOD 1
det A2 = 4a 2
+ 2a − 2a = 4a
2
M1
a = ±2 A1A1 N2
METHOD 2
det A = −2a M1
det A = ±4
a = ±2 A1A1 N2
[3 marks]
(a) [2]
Markscheme
1 3 3 −2 18 −14
BA = (( )( )) = ( ) A2
2 −2 5 −4 −4 4
Note: Award A1 for one error, A0 for two or more errors.
[2 marks]
(b) [2]
Markscheme
det(BA) = (72 – 56) = 16 (M1)A1
[2 marks]
(c) [3]
Markscheme
EITHER
A(A–1B + 2A–1)A = BA + 2A (M1)A1
24 −18
= ( ) A1
6 −4
OR
−4 2
A–1 = −
1
2
( ) (A1)
−5 3
an attempt to evaluate (M1)

0 −16 −4 2
A–1B + 2A–1 = −
1
2
( ) − ( )
1 −21 −5 3
3 −2 4 6 3 −2
A(A–1B + 2A–1)A = ( )( )( )
5 −4 4.5 7.5 5 −4
3 3 3 −2 24 −18
= ( )( ) = ( ) A1
2 0 5 −4 6 −4
[3 marks]
(a) [2]
Markscheme
(A + B)2 = A2 + AB + BA + B2 A2
corrected.
[2 marks]
(b) [2]
Markscheme
(A – kI)3 = A 3 – 3kA2 + 3k2A – k3I A2
corrected.
[2 marks]
(c) [2]
Markscheme
CA = B ⇒ C = BA–1 A2
corrected.
[2 marks]
(a) [2]
Markscheme
finding det M = a
2
+ b
2
A1
a
2
+ b
2
> 0 , therefore M is non-singular or equivalent statement R1
[2 marks]
(b) [2]
Markscheme
2 2
a b a b a − b 2ab
M2 =( )( ) = (
2 2
) M1A1
−b a −b a −2ab a − b
[2 marks]
(c) [2]
Markscheme
EITHER
det(M2) = (a
2 2
− b ) (a
2 2
− b ) + (2ab) (2ab) A1
det(M2) =
2 2 2
2 2 2 2
(a − b ) + (2ab) (= (a + b ) )
since the first term is non-negative and the second is positive R1
therefore det(M2) > 0
Note: Do not penalise first term stated as positive.
OR
det(M2) = (det M)2 A1
since det M is positive so too is det (M2) R1
[2 marks]
(a) [1]
Markscheme
a = 16 A1
[1 mark]
(b) [2]
Markscheme
1 2 −1
⎛ ⎞
A–1 = 1
16
⎜3 −1 0 ⎟ (M1)A1
⎝ ⎠
0 3 1
[2 marks]
(c) [2]
Markscheme
AX = C ⇒ X = A–1C (M1)
1 2 −1 8
⎛ ⎞⎛ ⎞
1
= ⎜3 −1 0 ⎟⎜ 0 ⎟
16
⎝ ⎠⎝ ⎠
0 3 1 −4
12 0.75
⎛ ⎞ ⎛ ⎛ ⎞⎞
=
1
16
⎜ 24 ⎟ ⎜= ⎜ 1.5 ⎟⎟ A1
⎝ ⎠ ⎝ ⎝ ⎠⎠
−4 −0.25
[2 marks]
(a) [2]
Markscheme
0.1 0.4 0.1

⎛ ⎞
A–1 = ⎜ −0.7 0.2 0.3 ⎟ A2 N2
⎝ ⎠
−1.2 0.2 0.8
[2 marks]
(b) [3]
Markscheme
x 1
⎛ ⎞ ⎛ ⎞
⎜2⎟ M1
⎝ ⎠ ⎝ ⎠
z 3
[3 marks]
(c) [1]
Markscheme
(1.2, 0.6, 1.6) lies on x + y + z = d
∴ d = 3.4 A1 N1
[1 mark]
(a) [2]
Markscheme
AB = I
(AB)11 = 1 ⇒ a – 12 + 6 = 1, giving a = 7 (A1) (C1)
(AB)22 = 1 ⇒ –16 + 5b + 7 = 1, giving b = 2 (A1) (C1)
[2 marks]
(b) [2]
Markscheme
5 x
⎛ ⎞ ⎛ ⎞
the system is BX = ⎜0⎟ where X = ⎜y ⎟ .
⎝ ⎠ ⎝ ⎠
6 z
5 7 −4 −6 5
⎛ ⎞ ⎛ ⎞⎛ ⎞
Then, X = A ⎜ 0 ⎟ = ⎜ −8 5 7 ⎟⎜0⎟. (M1)
⎝ ⎠ ⎝ ⎠⎝ ⎠
6 −5 3 4 6
Thus x ,
= −1 y = 2 z = −1 , (A1) (C2)
[2 marks]
(a) [2]
Markscheme
[2 marks]
(b.i) [1]
Markscheme
1 0 0
⎛ ⎞
DA = ⎜ 0 1 0⎟ (A1)
⎝ ⎠
0 0 1
[1 mark]
(b.ii) [2]
Markscheme
B = A–1C = DC (M1)
1
⎛ ⎞
= ⎜ −1 ⎟ (A1)
⎝ ⎠
2
[2 marks]
(c) [2]
Markscheme
x + 2y + 3z = 5
3x − 3y + 2z = 10
x
⎛ ⎞
or A⎜ y ⎟ = C (M1)
⎝ ⎠
z
[2 marks]

(a) [2]
Markscheme
−1
1 2 1 2 −7 3
⎛ ⎞ ⎛ ⎞
⎜1 1 2⎟ = ⎜ 0 2 −1 ⎟ A2 N2
⎝ ⎠ ⎝ ⎠
2 1 4 −1 3 −1
[2 marks]
(b) [4]
Markscheme
In matrix form Ax = B or x = A−1 B M1
,
x = 2 y = −3 z = 4 , A1A1A1 N0
[4 marks]
(a) [3]
Markscheme
−4 8 5 2
3Q = ( ) − ( ) (A1)
2 14 −1 a
−9 6
3Q = ( ) (A1)
3 14 − a
−3 2
Q=( 14−a
) (A1) (N3)
1
3
[3 marks]
(b) [4]
Markscheme
−2 4 5 2
CD = ( )( )
1 7 −1 a
−14 −4 + 4a
= ( ) (A1)(A1)(A1)(A1) (N4)
−2 2 + 7a
[4 marks]
(c) [2]
Markscheme
det D = 5a + 2 (may be implied) (A1)

a −2
D–1 = 1
5a+2
( ) (A1) (N2)
1 5
[2 marks]
(a.i) [1]
Markscheme
a =5 A1 N1
[1 mark]
(a.ii) [2]
Markscheme
b +9=4 (M1)
b = −5 A1 N2
[2 marks]
(b) [3]
Markscheme
Comparing elements 3(2) − 5(q) = −9 M1
q =3 A2 N2
[3 marks]
(a.i) [1]
Markscheme
a =4 A1 N1
[1 mark]
(a.ii) [1]
Markscheme
b =7 A1 N1
[1 mark]
(b) [1]
Markscheme
EITHER
x 7
⎛ ⎞ ⎛ ⎞
A⎜ y ⎟ = ⎜ 10 ⎟ A1 N1
⎝ ⎠ ⎝ ⎠
z −12
OR
1 2 0 x 7
⎛ ⎞⎛ ⎞ ⎛ ⎞
⎜ −3 1 −1 ⎟ ⎜ y ⎟ = ⎜ 10 ⎟ A1 N1
⎝ ⎠⎝ ⎠ ⎝ ⎠
2 −2 1 z −12
[1 mark]
(c) [3]
Markscheme
x 7
⎛ ⎞ ⎛ ⎞

⎝ ⎠ ⎝ ⎠
z −12
x −3
⎛ ⎞ ⎛ ⎞
⎜y ⎟ = ⎜ 5 ⎟ (accept x = −3, y = 5, z = 4) A2 N3
⎝ ⎠ ⎝ ⎠
z 4
[3 marks]
(a) [2]
Markscheme
1 2 1
− −
⎛ 3 3 3 ⎞ −0.333 0.667 −0.333
⎛ ⎞
A−1 = ⎜ −
⎜
1 5
−
7 ⎟
⎟ or ⎜ −0.333 1.67 −2.33 ⎟ A2 N2
⎜ 3 3 3 ⎟
⎝ ⎠
⎝ 2 4 5
⎠ 0.667 −1.33 1.67
−
3 3 3
[2 marks]
(b.i) [1]
Markscheme
X = A−1B A1 N1
[1 mark]
(b.ii) [3]
Markscheme
5
⎛ ⎞
X= ⎜2⎟ A3 N3
⎝ ⎠
3
[3 marks]
(a) [3]
Markscheme
6 4
2A = ( ) (A1)
2k 8
4 2
2A − B = ( ) A2 N3
2k − 1 5
[3 marks]
(b) [3]
Markscheme
Evidence of using the definition of determinant (M1)
Correct substitution (A1)
eg 4(5) − 2(2k − 1), 20 − 2(2k − 1), 20 − 4k + 2
det (2A − B) = 22 − 4k A1 N3
[3 marks]
(a) [3]
Markscheme
Attempting to multiply matrices (M1)
3
⎛ ⎞ 2 2
1 x −1 3 + x − 2 1 + x
( )⎜x⎟ = ( ) (= ( )) A1A1 N3
3 1 4 ⎝ ⎠ 9 + x + 8 17 + x
2
[3 marks]
(b) [3]
Markscheme
Setting up equation M1
2 2
1 + x 20 2 + 2x 20
eg 2( ) = ( ) , ( ) = ( ) ,
17 + x 28 34 + 2x 28
2
1 + x 10
( ) = ( )
17 + x 14
2 2
2 + 2x = 20 1 + x = 10
( ) (A1)
34 + 2x = 28 17 + x = 14
x = −3 A1 N2
[3 marks]
(a) [2]
Markscheme
0.1 0.4 0.1

⎛ ⎞
A–1 = ⎜ −0.7 0.2 0.3 ⎟ A2 N2
⎝ ⎠
−1.2 0.2 0.8
[2 marks]
(b) [3]
Markscheme
x 1
⎛ ⎞ ⎛ ⎞
⎜2⎟ M1
⎝ ⎠ ⎝ ⎠
z 3
[3 marks]
(c) [1]
Markscheme
(1.2, 0.6, 1.6) lies on x + y + z = d
∴ d = 3.4 A1 N1
[1 mark]
(a) [1]
Markscheme
a = 16 A1
[1 mark]
(b) [2]
Markscheme
1 2 −1
⎛ ⎞
A–1 = 1
16
⎜3 −1 0 ⎟ (M1)A1
⎝ ⎠
0 3 1
[2 marks]
(c) [2]
Markscheme
AX = C ⇒ X = A–1C (M1)
1 2 −1 8
⎛ ⎞⎛ ⎞
1
= ⎜3 −1 0 ⎟⎜ 0 ⎟
16
⎝ ⎠⎝ ⎠
0 3 1 −4
12 0.75
⎛ ⎞ ⎛ ⎛ ⎞⎞
=
1
16
⎜ 24 ⎟ ⎜= ⎜ 1.5 ⎟⎟ A1
⎝ ⎠ ⎝ ⎝ ⎠⎠
−4 −0.25
[2 marks]
(a) [2]
Markscheme
[2 marks]
(b.i) [1]
Markscheme
1 0 0
⎛ ⎞
DA = ⎜ 0 1 0⎟ (A1)
⎝ ⎠
0 0 1
[1 mark]
(b.ii) [2]
Markscheme
B = A–1C = DC (M1)
1
⎛ ⎞
= ⎜ −1 ⎟ (A1)
⎝ ⎠
2
[2 marks]
(c) [2]
Markscheme
x + 2y + 3z = 5
3x − 3y + 2z = 10
x
⎛ ⎞
or A⎜ y ⎟ = C (M1)
⎝ ⎠
z
[2 marks]
(a.i) [1]
Markscheme
a =4 A1 N1
[1 mark]
(a.ii) [1]
Markscheme
b =7 A1 N1
[1 mark]
(b) [1]
Markscheme
EITHER
x 7
⎛ ⎞ ⎛ ⎞
A⎜ y ⎟ = ⎜ 10 ⎟ A1 N1
⎝ ⎠ ⎝ ⎠
z −12
OR
1 2 0 x 7
⎛ ⎞⎛ ⎞ ⎛ ⎞
⎜ −3 1 −1 ⎟ ⎜ y ⎟ = ⎜ 10 ⎟ A1 N1
⎝ ⎠⎝ ⎠ ⎝ ⎠
2 −2 1 z −12
[1 mark]
(c) [3]
Markscheme
x 7
⎛ ⎞ ⎛ ⎞

⎝ ⎠ ⎝ ⎠
z −12
x −3
⎛ ⎞ ⎛ ⎞
⎜y ⎟ = ⎜ 5 ⎟ (accept x = −3, y = 5, z = 4) A2 N3
⎝ ⎠ ⎝ ⎠
z 4
[3 marks]
54. [Maximum mark: 8] 22N.1.AHL.TZ0.9
(a) [2]
Markscheme
attempt to find det (M ) (M1)
= 14
(12 × 14)= 168 cm

2
A1
[2 marks]
(b) [6]
Markscheme
let X have coordinates (x, y)
METHOD 1
x 2t − 3
M( )=( ) (M1)
y 6 − 5t
x 2t − 3
( )= M
−1
( ) (A1)
y 6 − 5t
1 4
M
−1
=
1
14
( ) A1
−3 2
x 2t − 3 + 24 − 20t
( )=
1
14
( ) (M1)
y −6t + 9 + 12 − 10t
x 21 − 18t
( )=
1
( ) OR (
21−18t
,
21−16t
) A1A1
14 14 14
y 21 − 16t
METHOD 2
writing two simultaneous equations (M1)
2x − 4y = 2t − 3 (A1)
3x + y = 6 − 5t (A1)
attempting to solve the equations (M1)
(x, y)=(
3
2
−
9t
7
,
3
2
−
8t
7
) A1A1
[6 marks]
55. [Maximum mark: 7] 22M.1.AHL.TZ2.15
(a) [2]
Markscheme
0 0
(one vector to the line is ( ) therefore) a =( ) A1
c c
the line goes m up for every 1 across
1
(so the direction vector is) b =( ) A1
m
Note: Although these are the most likely answers, many others are possible.
[2 marks]
(b) [1]
Markscheme
(from GDC OR 6 × 2 − 4 × 3 ) | M |= 0 A1
[1 mark]
(c) [4]
Markscheme
METHOD 1
X 6 3 x 6x + 3mx + 3c
( )=( )( )=( ) M1A1
Y 4 2 mx + c 4x + 2mx + 2c
3(2x + mx + c)
=( ) A1
2(2x + mx + c)
therefore the new line has equation 3Y = 2X A1
which is independent of m or c AG
Note: The AG line (or equivalent) must be seen for the final A1 line to be
awarded.
METHOD 2
take two points on the line, e.g (0, c) and (1, m + c) M1
6 3 0 3c
these map to ( )( )=( )
4 2 c 2c
6 3 1 6 + 3m + 3c
and ( )( )=( ) A1
4 2 m + c 4 + 2m + 2c
6 + 3m 3
therefore a direction vector is ( )=(2 + m)( )
4 + 2m 2
3
(since m ≠ −2 ) a direction vector is ( )
2
3c 3 0
the line passes through ( )−c( )=( ) therefore it always has
2c 2 0
the origin as a jump-on vector A1
3
the vector equation is therefore r = μ( ) A1
2
which is independent of m or c AG
awarded.
METHOD 3
6 3 0 1 3c 6 + 3m
r =( )(( )+λ( ))=( )+λ( ) M1A1
4 2 c m 2c 4 + 2m
3 3
= c( )+(2 + m)λ( ) A1
2 2
3
= μ( )
2
where μ = c +(2 + m)λ is an arbitrary parameter. A1
which is independent of m or c (as μ can take any value) AG
awarded.
[4 marks]
56. [Maximum mark: 11] 20N.1.AHL.TZ0.F_4
(a) [4]
Markscheme
∣a − λ b ∣
∣ ∣= 0 M1
∣ c d − λ∣
(a − λ)(d − λ)−bc = 0 M1A1
λ
2
−(a + d)λ + ad − bc = 0 A1
α =(a + d); β = ad − bc
[4 marks]
(b.i) [5]
Markscheme
2
a b a b a + bc ab + bd
A
2
=[ ][ ]=[
2
] (M1)A1
c d c d ac + cd bc + d
2
A −(a + d)A +(ad − bc)I =
2
a + bc ab + bd a b 1 0
[
2
]−(a + d)[ ]+(ad − bc)[ ] M1
ac + cd bc + d c d 0 1
2
a + bc − a(a + d)+ad − bc ab + bd − b(a + d)
=[ ]
2
ac + cd − c(a + d) bc + d − d(a + d)+ad − bc
A2
= 0 AG
Note: Award A1A0 for a single error.
[5 marks]
(b.ii) [2]
Markscheme
multiply throughout by A giving –1

M1
A − αI + βA
−1
= 0 A1
A
−1
=
1
β
(αI − A) AG
[2 marks]
57. [Maximum mark: 11] 19M.1.AHL.TZ0.F_13
(a) [7]
Markscheme
suppose f(X) = f(Y) , ie AX = AY (M1)
then A−1AX = A−1AY A1
X = Y A1
since f(X) = f(Y) ⇒ X = Y, f is an injection R1
now suppose C ∈ M and consider f(D) = C , ie AD = C M1
then D = A−1 C (A−1 exists since A is non- singular) A1
since given C ∈ M, there exists D ∈ M such that f(D) = C , f is a surjection R1
therefore f is a bijection AG
[7 marks]
(b) [4]
Markscheme
suppose f(X) = Y, ie AX = Y (M1)
then det(A)det(X) = det(Y) A1
since det(A) = 0, it follows that det(Y) = 0 A1
it follows that f is not surjective since the function cannot reach non-
singular matrices R1
therefore f is not a bijection AG
[4 marks]
58. [Maximum mark: 6] 18M.1.AHL.TZ0.F_2
(a) [3]
Markscheme
METHOD 1
A4 = 4A2 + 4AI + I2 or equivalent M1A1
= 4(2A + I) + 4A + I A1
= 8A + 4I + 4A + I
= 12A + 5I AG
[3 marks]
METHOD 2
A3 = A(2A + I) = 2A2 + AI = 2(2A + I) + A(= 5A + 2I) M1A1
A4 = A(5A + 2I) A1
= 5A2 + 2A = 5(2A + I) + 2A
= 12A + 5I AG
[3 marks]
(b) [3]
Markscheme
18 2
B2 = [ ] (A1)
1 11
18 2 4 2 4 0 10 0
[ ] − [ ] − [ ] = [ ] (A1)
1 11 1 −3 0 4 0 10
⇒ k = 10 A1
[3 marks]
© International Baccalaureate Organization, 2023

Matrices MS

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Matrices MS

Uploaded by

Copyright:

Available Formats

Matrices [351 marks]

1. [Maximum mark: 4] EXM.1.AHL.TZ0.2

Note: Both answers are required for the final (A1).

3. [Maximum mark: 6] EXM.1.AHL.TZ0.28

A is singular ⇒ det A = 0 (R1)

4. [Maximum mark: 2] EXM.1.AHL.TZ0.31

Note: Award A2 for 4 correct, A1 for 2 or 3 correct.

6. [Maximum mark: 5] EXM.1.AHL.TZ0.33

For multiplying (I – X)(I + X + X2) M1

9. [Maximum mark: 3] EXM.1.AHL.TZ0.46

This gives x = 1 and y = 8 . (A1) (C3)

IXBB–1 = ACB–1 (M1)(A1)

X = ACB–1 (M1)(A1) (C6)

11. [Maximum mark: 6] EXM.1.AHL.TZ0.49

For multiplying (I – X)(I + X + X2) M1

(I – X)(I + X + X2) = I ⇒ (I – X)–1 = I + X + X2 AG N0

Attempting to set up a matrix equation (M2)

X = B–1(A – AB) (A2)

since the first term is non-negative and the second is positive R1

therefore det(M2) > 0

Note: Do not penalise first term stated as positive.

since det M is positive so too is det (M2) R1

0.1 0.4 0.1

x = 1.2, y = 0.6, z = 1.6 (so the point is (1.2, 0.6, 1.6)) A2 N2

(1.2, 0.6, 1.6) lies on x + y + z = d

det A = 5(1) − 7(−2) = 19

Note: If premultiplication by A –1 is used, award (M1)(M0) in part (i) but award

Since det A ≠ 0, A–1 exists. (M1)

Hence AB = C ⇒ B = A–1C (C1)

The system of equations is 2x − y + 2z = 7

The required point = (1, –1, 2). (A1)

18. [Maximum mark: 6] EXM.1.AHL.TZ0.52

In matrix form Ax = B or x = A−1 B M1

(AB)11 = 1 ⇒ a – 12 + 6 = 1, giving a = 7 (A1) (C1)

(AB)22 = 1 ⇒ –16 + 5b + 7 = 1, giving b = 2 (A1) (C1)

det D = 5a + 2 (may be implied) (A1)

Comparing elements 3(2) − 5(q) = −9 M1

⎜y ⎟ = A−1 ⎜ 10 ⎟ (accept algebraic method) (M1)

Evidence of using the definition of determinant (M1)

Correct substitution (A1)

eg 4(5) − 2(2k − 1), 20 − 2(2k − 1), 20 − 4k + 2

Attempting to multiply matrices (M1)

evidence of addition (M1)

eg at least two correct elements

evidence of multiplication (M1)

eg at least two correct elements

evidence of matrix multiplication (in correct order) (M1)

1 (3) + 2 (−2) 1 (0) + 2 (1)

Note: Award A1 for one error, A0 for two or more errors.

det(BA) = (72 – 56) = 16 (M1)A1

A(A–1B + 2A–1)A = BA + 2A (M1)A1

an attempt to evaluate (M1)

(A – kI)3 = A 3 – 3kA2 + 3k2A – k3I A2

Attempting to find det A (M1)

System has a unique solution provided det A ≠ 0 (R1)

k ∈ R \ {−1 ± √ 2} (accept k ≠ −1 ± √ 2, k ≠ −2.41, 0.414)

det A = 5(1) − 7(−2) = 19

Note: If premultiplication by A –1 is used, award (M1)(M0) in part (i) but award

evidence of addition (M1)

eg at least two correct elements

evidence of multiplication (M1)

eg at least two correct elements

evidence of matrix multiplication (in correct order) (M1)