Y12 MAA HL Functions and

Equations revision [116 marks]

1. [5 marks]

Markscheme
f(−2) = 0(⇒ −24 + 4p − 2q − 2 = 0) M1
f(−1) = 4(⇒ −3 + p − q − 2 = 4) M1
Note: In each case award the M marks if correct substitution attempted and
right-hand side correct.
attempt to solve simultaneously (2p − q = 13, p − q = 9) M1
p = 4 A1
q = −5 A1
[5 marks]
2. [7 marks]

Markscheme
METHOD 1
1 + i is a zero ⇒ 1 – i is a zero (A1)
⇒ 1 + 2i is a zero (A1)
1 – 2i is a zero
(x − (1 − i)) (x − (1 + i)) = (x2 − 2x + 2) (M1)A1
(x − (1 − 2i)) (x − (1 + 2i)) = (x2 − 2x + 5) A1
p(x) = (x2 − 2x + 2)(x2 − 2x + 5) M1
= x4 − 4x3 + 11x2 − 14x + 10 A1
a = −4, b = 11, c = −14, d = 10
[7 marks]
METHOD 2
p(1 + i) = −4 + (−2 + 2i)a + (2i)b + (1 + i)c + d M1
−4 − 2a + c + d = 0
p(1 + i) = 0 ⇒ { M1A1A1
2a + 2b + c = 0
p(1 − 2i) = −7 + 24i + (−11 + 2i)a + (−3 − 4i)b + (1 − 2i)c + d
−7 − 11a − 3b + c + d = 0
p(1 − 2i) = 0 ⇒ { A1
24 + 2a − 4b − 2c = 0

⎛ ⎞ ⎛ ⎞ ⎛ ⎞ ⎛ ⎞
−1
a −2 0 1 1 4 −4
⎜
⎜
b⎟ ⎜ 2 1 0⎟ ⎜ 0 ⎟ ⎜ 11 ⎟
⎜ c ⎟ ⎜ −11 −3 1 1 ⎟
⎟ =⎜ ⎜
⎜ 7 ⎟ ⎟ ⎜⎜ −14 ⎟
2
⎟ ⎟
= M1A1

⎝ d⎠ ⎝ 2 −4 −2 0 ⎠ ⎝ −24 ⎠ ⎝ 10 ⎠
a = −4, b = 11, c = −14, d = 10
[7 marks]
3a. [2 marks]

Markscheme
(a)

shape with y-axis intercept (0, 4) A1

Note: Accept curve with an asymptote at x = 1 suggested.
correct asymptote y = 1 A1
[2 marks]

3b. [1 mark]

Markscheme
range is f −1 (x) > 1(or ]1, ∞[) A1
Note: Also accept ]1, 10] or ]1, 10[.
Note: Do not allow follow through from incorrect asymptote in (a).
[1 mark]
3c. [4 marks]

Markscheme
(4, 0) ⇒ ln(4a + b) = 0 M1
⇒ 4a + b = 1 A1
asymptote at x = 1 ⇒ a + b = 0 M1
⇒ a = 13 , b = − 13 A1
[4 marks]

4a. [5 marks]

Markscheme

A correct graph shape for 0 < x ⩽ 10 A1

maxima (3.78, 0.882) and (9.70, 1.89) A1
minimum (6.22, –0.885) A1
x-axis intercepts (1.97, 0), (5.24, 0) and (7.11, 0) A2
Note: Award A1 if two x-axis intercepts are correct.
[5 marks]
4b. [2 marks]

Markscheme
0 < x ⩽ 1.97 A1
5.24 ⩽ x ⩽ 7.11 A1
[2 marks]

5a. [3 marks]

Markscheme
EITHER
1+3−x
f(x) − 1 = 3x−3−x
M1A1

> 0 as both numerator and denominator are positive R1

OR
3x + 1 > 3x > 3x − 3−x M1A1
Note: Accept a convincing valid argument the numerator is greater than the
denominator.
numerator and denominator are positive R1
hence f(x) > 1 AG
[3 marks]

5b. [4 marks]

Markscheme
one line equation to solve, for example, 4(3x − 3−x ) = 3x + 1, or equivalent
A1
(3y 2 − y − 4 = 0)
attempt to solve a three-term equation M1
4
obtain y= 3
A1

x = log3 ( 43 ) or equivalent A1
Note: Award A0 if an extra solution for x is given.
[4 marks]
6a. [4 marks]

Markscheme
METHOD 1
f ′ (x) = q − 2x = 0 M1
f ′ (3) = q − 6 = 0
q=6 A1
f(3) = p + 18 − 9 = 5 M1
p = −4 A1
METHOD 2
f(x) = −(x − 3)2 + 5 M1A1
= −x2 + 6x − 4
q = 6, p = −4 A1A1
[4 marks]

6b. [2 marks]

Markscheme
g(x) = −4 + 6(x − 3) − (x − 3)2 (= −31 + 12x − x2 ) M1A1
Note: Accept any alternative form which is correct.
Award M1A0 for a substitution of (x + 3) .

[2 marks]
7a. [4 marks]

Markscheme
METHOD 1
f(x) = (x + 1)(x − 1)(x − 2) M1
= x3 − 2x2 − x + 2 A1A1A1
a = −2 , b = −1 and c = 2
METHOD 2
from the graph or using f(0) = 2
c = 2 A1
setting up linear equations using f(1) = 0 and f(–1) = 0 (or f(2) = 0) M1
obtain a = −2 , b = −1 A1A1
[4 marks]

7b. [3 marks]

Markscheme
(i) (1, 0) , (3, 0) and (4, 0) A1
(ii) g(0) occurs at 3f(−2) (M1)
= −36 A1
[3 marks]
8. [6 marks]

Markscheme
(a)

A1A1
Note: Award A1 for correct asymptote with correct behaviour and A1 for
shape.
[2 marks]
y = x (M1)
(b) intersect on
x + ln x = x ⇒ ln x = 0 (A1)
intersect at (1, 1) A1 A1
[4 marks]
Total [6 marks]
9a. [4 marks]

Markscheme
for the equation to have real roots
(y − 1)2 − 4y(y − 1) ⩾ 0 M1
⇒ 3y 2 − 2y − 1 ⩽ 0
(by sign diagram, or algebraic method) M1
− 13 ⩽ y ⩽ 1 A1A1
Note: Award first A1 for − 13 and 1, and second A1 for inequalities. These are
independent marks.
[4 marks]

9b. [3 marks]

Markscheme
x+1
f :x→ x2+x+1
⇒ x + 1 = yx2 + yx + y (M1)
⇒0= yx2 + (y − 1)x + (y − 1) A1
hence, from (a) range is − 13 ⩽ y ⩽ 1 A1
[3 marks]

9c. [1 mark]

Markscheme
a value for y would lead to 2 values for x from (a) R1
Note: Do not award R1 if (b) has not been tackled.
[1 mark]
10a. [6 marks]

Markscheme
1
y= 1+e−x
y(1 + e−x ) = 1 M1
1 1
1 + e−x = y
⇒ e−x = y
− 1 A1

⇒ x = − ln( 1y − 1) A1

f −1 (x) = − ln( 1x − 1) (= ln( 1−x x )) A1

domain: 0 < x < 1 A1A1
Note: Award A1 for endpoints and A1 for strict inequalities.
[6 marks]

10b. [1 mark]

Markscheme
0.659 A1
[1 mark]

11a. [2 marks]

Markscheme
f(x − a) ≠ b (M1)
x ≠ 0 and x ≠ 2a (or equivalent) A1
[2 marks]
11b. [6 marks]

Markscheme
vertical asymptotesx = 0, x = 2a A1
horizontal asymptote y = 0 A1
Note: Equations must be seen to award these marks.
maximum (a, − 1b ) A1A1
Note: Award A1 for correct x-coordinate and A1 for correct y-coordinate.
one branch correct shape A1
other 2 branches correct shape A1

[6 marks]
12a. [2 marks]

Markscheme
1
(i) (g ∘ f) (x) = 2x+3
, x ≠ − 32 (or equivalent) A1
2
(ii) (f ∘ g) (x) = x
+ 3, x ≠ 0 (or equivalent) A1
[2 marks]

12b. [4 marks]

Markscheme
EITHER
f(x) = (g −1 ∘ f ∘ g) (x) ⇒ (f ∘ g) (x) (M1)
1 2
2x+3
= x
+ 3 A1
OR
1
(g −1 ∘ f ∘ g) (x) = 2 A1
x
+3
1
2x + 3 = 2 M1
x
+3

THEN
6x2 + 12x + 6 = 0 (or equivalent) A1
x = −1, y = 1 (coordinates are (−1, 1) ) A1
[4 marks]

13. [5 marks]

Markscheme
EITHER
using row reduction (or attempting to eliminate a variable) M1

⎛ 2 −1 3 2 ⎞
⎜
⎜ 3 1 2 −2 ⎟
⎟ → 2R2 − 3R1
⎝ −1 2 a b ⎠ → 2R3 + R1

⎛ ⎞
 ⎛ 2 −1 3 2 ⎞
⎜
⎜ 0 5 −5 −10 ⎟
⎟ → R2/5 A1
⎝ 0 3 2a + 3 2b + 2 ⎠
Note: For an algebraic solution award A1 for two correct equations in two
variables.

⎛ 2 −1 3 2 ⎞
⎜
⎜ 0 1 −1 −2 ⎟
⎟
⎝ 0 3 2a + 3 2b + 2 ⎠ → R3 − 3R2

⎛ 2 −1 3 2 ⎞
⎜
⎜ 0 1 −1 −2 ⎟
⎟
⎝ 0 0 2a + 6 2b + 8 ⎠
Note: Accept alternative correct row reductions.
recognition of the need for 4 zeroes M1
so for multiple solutions a = – 3 and b = – 4 A1A1
[5 marks]
OR
∣ 2 −1 3 ∣
∣ 3 1 2 ∣∣ = 0 M1
∣
∣ −1 2 a∣
⇒ 2(a − 4) + (3a + 2) + 3(6 + 1) = 0
⇒ 5a + 15 = 0
⇒ a = −3 A1
∣ 2 −1 2 ∣
∣ 3 1 −2 ∣∣ = 0 M1
∣
∣ −1 2 b ∣
⇒ 2(b + 4) + (3b − 2) + 2(6 + 1) = 0 A1
⇒ 5b + 20 = 0
⇒ b = −4 A1
[5 marks]

14. [5 marks]

Markscheme
(a) EITHER
⎛1 1 2 ∣ −2 ⎞ ⎛1 1 2 ∣ −2 ⎞
⎛1 1 2 ∣ −2 ⎞ ⎛ 1 1 2 ∣ −2 ⎞
⎜3 ⎟ → ⎜0 ⎟
−1 14 ∣ 6 1 −2 ∣ −3 M1
⎝1 2 0 ∣ −5 ⎠ ⎝ 0
∣
0 0 ∣ 0 ⎠
∣

row of zeroes implies infinite solutions, (or equivalent). R1

Note: Award M1 for any attempt at row reduction.
OR
∣1 1 2 ∣
∣3 −1 14 ∣∣ = 0 M1
∣
∣1 2 0 ∣
∣1 1 2 ∣
∣3 −1 14 ∣∣ = 0 with one valid point R1
∣
∣1 2 0 ∣
OR
x + y + 2z = −2
3x − y + 14z = 6
x + 2y = −5 ⇒ x = −5 − 2y
substitute x = −5 − 2y into the first two equations:
−5 − 2y + y + 2z = −2
3(−5 − 2y) − y + 14z = 6 M1
−y + 2z = 3
−7y + 14z = 21
the latter two equations are equivalent (by multiplying by 7) therefore an
infinite number of solutions. R1
OR
for example, 7 × R1 − R2 gives 4x + 8y = −20 M1
this equation is a multiple of the third equation, therefore an infinite
number of solutions. R1
[2 marks]
y = t M1
(b) let
then x = −5 − 2t A1
t+3
z= 2 A1
OR
let x = t M1
−5−t
then y = 2 A1

1−
 1−t
z= 4
A1
OR
letz = t M1
then x = 1 − 4t A1
y = −3 + 2t A1
OR
attempt to find cross product of two normal vectors:
∣ i j k∣
eg: ∣ 1 1 2 ∣ = −4i + 2j + k M1A1
∣ ∣
∣1 2 0∣
x = 1 − 4t
y = −3 + 2t
z = t A1
(or equivalent)
[3 marks]
Total [5 marks]

15a. [3 marks]

Markscheme
⎛ 0 2 1⎞⎛x⎞ ⎛3⎞
⎜ −1 1 3⎟⎜ y⎟ = ⎜1⎟
⎝ −2 1 2⎠⎝ z ⎠ ⎝k⎠
∣ 0 2 1∣
∣ −1 1 3 ∣∣ = 0 − 2 (−2 + 6) + (−1 + 2) = −7 M1A1
∣
∣ −2 1 2∣
since determinant ≠ 0 ⇒ unique solution to the system R1
planes intersect in a point AG
Note: For any method, including row reduction, leading to the explicit solution
( 6−5
7
k
, 7
, 7 ), award M1 for an attempt at a correct method, A1 for two
10+k 1−2k

correct coordinates and A1 for a third correct coordinate.

[3 marks]
15b. [5 marks]

Markscheme
∣ a 2 1 ∣
∣ −1 a+1 3 ∣∣ = a ((a + 1) (a + 2) − 3) − 2 (−1 (a + 2) + 6) + (−1 + 2 (a
∣
∣ −2 1 a + 2∣
M1(A1)
⇒ no unique solution i.e. determinant = 0 (M1)
planes not meeting in a point
a (a2 + 3a − 1) + (2a − 8) + (2a + 1) = 0
a3 + 3a2 + 3a − 7 = 0 A1
a = 1 A1
[5 marks]

16a. [3 marks]

Markscheme
(f ∘ f)(x) = f ( 2−x x ) =
x
2−x
M1A1
2− 2−x x

(f ∘ f)(x) = x
4−3x
A1

[3 marks]
16b. [8 marks]

Markscheme

(f ∘ f∘. . . ∘f)
P (n) : ntimes (x) = Fn (x)
P (1) : f(x) = F1 (x)
LHS = f(x) = x andRHS
2−x
= F1 (x) = x = x A1A1
2−x
2 −(21−1)x
1

∴ P (1)true


(f ∘ f∘. . . ∘f)
assume that P(k) is true, i.e., k times (x) = Fk (x) M1
consider P (k + 1)
EITHER

 ⎛ ⎞
(f ∘ f∘. . . ∘f) f ∘ f∘. . . ∘f
k+1times (x) = ⎜f ∘ k times ⎟ (x) = f (Fk (x)) (M1)
⎝ ⎠
x

=f( x )= 2k−(2k−1)x
2− k xk
A1
2 −(2k−1)x
k
2 −(2 −1)x

= x = x A1
2(2k−(2k−1) x)−x 2k+1−(2k+1−2)x−x

OR

 ⎛ ⎞
(f ∘ f∘. . . ∘f) f ∘ f∘. . . ∘f
k+1times (x) = ⎜f ∘ k times ⎟ (x) = Fk (f(x)) (M1)
⎝ ⎠

Fk ( 2−x x )
x
= = 2−x
A1
2k−(2k−1) 2−x x

= x A1
2k+1−2kx−2kx+x
THEN
= x = Fk+1 (x) A1
2k+1−(2k+1−1) x

P(k) true implies P(k + 1) true, P(1) true so P(n) true for all n ∈ Z+ R1
[8 marks]
 16c. [6 marks]

Markscheme
METHOD 1
y
x= 2n−(2n−1)y
⇒ 2n x − (2n − 1)xy = y M1A1
2nx
⇒ 2n x = ((2n − 1)x + 1) y ⇒ y = (2n−1)x+1
A1
2nx
Fn−1 (x) = (2n−1) x+1
A1

Fn−1 (x) = 2n−1

x M1
+1
2n x 2n

Fn−1 (x) = x
(1−2−n)x+2−n
A1

Fn−1 (x) = x
2−n−(2−n−1)x
AG

METHOD 2
attempt F−n (Fn (x)) M1
x

= F−n ( x
2n−(2n−1)x
)= 2n−(2n−1)x
2−n−(2−n−1) 2n−(2xn−1)
A1A1
x

= x
2−n(2n−(2n−1)x)−(2−n−1)x
A1A1

Note: Award A1 marks for numerators and denominators.

= x
1 = x A1AG
METHOD 3
attempt Fn (F−n (x)) M1
x

= Fn ( x
2−n−(2−n−1)x
)= 2−n−(2−n−1)x
2n−(2n−1) −n x−n
A1A1
2 −(2 −1)x

= x
2n(2−n−(2−n−1)
A1A1
x)−(2n−1)x
Note: Award A1 marks for numerators and denominators.
= x
1 = x A1AG
[6 marks]

© International Baccalaureate Organization 2021

International Baccalaureate® - Baccalauréat International® - Bachillerato Internacional®

Printed for ISLAND SCH