(a)
$T_2 = 1.1(6000) – 500$ OR $T_2 = 6600 – 500$
A2
[2 marks]
(b)
(i)
$T_3 = 1.1(6100) – 500 \ \big(T_3 = 1.1(1.1(6000) – 500) – 500\big)$ OR $T_3 = 6710 – 500$
A1
[1 mark]
(ii)
$T_4 = 1.1(6210) – 500$ OR $T_4 = 6831 – 500$
(A1)
[2 marks]
(c)
(i)
EITHER
attempts to eliminate the denominator
(M1)
$T_n = 6000(1.1)^{n-1} – 5000\big((1.1)^{n-1} – 1\big) \ \big(= (6000 – 5000)(1.1)^{n-1} + 5000\big)$
A1
Note: Accept correct equivalent forms, eg. $T_n = 6000(1.1)^{n-1} – 5000(1.1)^{n-1} + 5000$.
OR
attempts to express $T_n$ with a common denominator of $0.1$
(M1)
$T_n = \dfrac{600(1.1)^{n-1} – 500\big((1.1)^{n-1} – 1\big)}{0.1} \ \left(= \dfrac{600(1.1)^{n-1} – 500(1.1)^{n-1} + 500}{0.1}\right)$
A1
Note: Accept correct equivalent forms.
THEN
$T_n = 1000(1.1)^{n-1} + 5000$
AG
[2 marks]
(ii)
EITHER
attempts to find $T_6$ using the explicit formula for $T_n$
(M1)
$T_6 = 1000(1.1)^{6-1} + 5000$ OR $T_6 = 6610.51$
OR
attempts to find $T_6$ using $T_{n+1} = 1.1T_n – 500$
(M1)
$T_4 = 6331, \ T_5 = 6464.1, \ T_6 = 6610.51$
OR
attempts to find $T_6$ using a finance solver application
(M1)
$\text{N} = 5, \ \text{I} = 10\%, \ \text{PV} = -6000$ and $\text{PMT} = 500$
THEN
Note: Accept $6610$.
[2 marks]
(d)
(i)
METHOD 1
attempts to use the explicit formula for $D_n$ to find an expression for $D_{n+1} – D_n$
(M1)
$= 1.1D_n – 750 – \big(-1500(1.1)^{n-1} + 7500\big)$
$= 1.1\big(-1500(1.1)^{n-1} + 7500\big) – 750 – \big(-1500(1.1)^{n-1} + 7500\big)$
A1
EITHER
$= -1650(1.1)^{n-1} + 8250 – 750 + 1500(1.1)^{n-1} – 7500$
A1
OR
$= -1500(1.1)^{n-1} – 1500(1.1)^n$
$= -1500(1.1)^{n-1}(1 – 1.1) \ \big(-1500(1.1)^{n-1}(-0.1)\big)$
A1
THEN
$D_{n+1} – D_n = -150(1.1)^{n-1}$
AG
METHOD 2
attempts to express $D_{n+1} – D_n$ in terms of $D_n$
(M1)
$D_{n+1} – D_n = 1.1D_n – 750 – D_n$
$= 0.1\big(-1500(1.1)^{n-1} + 7500\big) – 750 \ \big(= -150(1.1)^{n-1} + 750 – 750\big)$
A1
$D_{n+1} – D_n = -150(1.1)^{n-1}$
AG
[3 marks]
(ii)
$D_{n+1} – D_n < 0$ (because $(1.1)^{n-1} > 0$ and so $-150(1.1)^{n-1} < 0$)
R1
Note: Award R1 for responses such as:
‘The difference is negative’.
$-150(1.1)^{n-1} < 0$
$D_n = D_{n+1} + 150(1.1)^{n-1}$
Accept responses such as:
$D_n – D_{n+1} > 0$ or ‘the difference is positive’ as long as $D_n – D_{n+1}$ is referred to.
Do not accept arguments based on specific numerical examples.
therefore $D_{n+1} < D_n \Rightarrow D_n > D_{n+1}$
AG
(and hence the predicted number of trout at the start of any year will be greater than the predicted number at the start of the next year)
[1 mark]
(e)
METHOD 1
attempts (numerically, graphically, algebraically or by trial & improvement) to find the
least value of $n$ such that $D_n \le 0 \ (D_n = 0 \text{ OR } D_n < 0)$
(M1)
Note: Award (M1) for attempting to obtain $-1500(1.1)^{n-1} \le -7500$ or
$-1500(1.1)^{n-1} = -7500$ (or equivalent) and then attempting to take the log
of both sides.
For the use of trial & improvement, award (M1), for considering values of
$n$ either side of $D_n = 0$.
EITHER
$17.8863\dots \ \left(= \log_{1.1} 5 + 1, \ = \dfrac{\ln 5}{\ln 1.1} + 1\right)$ (critical value of $n$ seen anywhere)
(A2)
OR
$D_{17} = 607.540\dots \ (607.540\dots < 750)$
(A2)
OR
$D_{18} = -81.7054\dots \ (< 0)$
(A2)
THEN
trout disappears from the lake during (at the end of) the $17\text{th}$ year
A1
Note: Award A1 for $n = 18$ OR (‘during the) $18\text{th}$ year’ or ‘start of the $18\text{th}$ year’.
Note: Award as above for $D_{n+1} \le 0 \ (D_{n+1} = 0 \text{ OR } D_{n+1} < 0)$.
METHOD 2
$S_n = \sum (D_{n+1} – D_n)$ is the total decrease in the number of trout by the end of year $n$ or
start of year $n + 1$
attempts (numerically, graphically, algebraically or by trial & improvement) to find the
least value of $n$ such that $S_n \le -6000 \ (S_n = -6000 \text{ OR } S_n < -6000)$
(M1)
$\dfrac{-150\big((1.1)^n – 1\big)}{1.1 – 1} \ \Big(= -1500\big((1.1)^n – 1\big)\Big) \le -6000$
Note: Award (M1) for attempting to obtain $-1500\big((1.1)^n – 1\big) \le -6000$ or
$-1500\big((1.1)^n – 1\big) = -6000$ (or equivalent) and then attempting to take the
log of both sides.
For the use of trial & improvement, award (M1), for considering values of $n$
either side of $S_n = -6000$.
trout disappears from the lake during (at the end of) the $17\text{th}$ year
A1
Note: Award A1 for $n = 18$ OR (‘during the) $18\text{th}$ year’ or ‘start of the $18\text{th}$ year’.
[4 marks]
(f)
METHOD 1
$C_n = (6000 – 10d)(1.1)^{n-1} + 10d$
(A1)
EITHER
$6000 – 10d = 0$ (recognizes that $C_n$ is independent of $n$)
(M1)
OR
$10d = 6000$ (sets $C_n = 6000$ and compares coefficients)
(M1)
THEN
METHOD 2
EITHER
$C_{n+1} – C_n \, (= 0)$
$6000(1.1)^n – 10d\big((1.1)^n – 1\big) – \Big(6000(1.1)^{n-1} – 10d\big((1.1)^{n-1} – 1\big)\Big) \, (= 0)$
(A1)
OR
$0.1C_n – d \, (= 0)$ (similar to part (d)(i) method 2)
$0.1\Big(6000(1.1)^{n-1} – 10d\big((1.1)^{n-1} – 1\big)\Big) – d \, (= 0)$
(A1)
THEN
attempts to expand to eliminate the linear terms in $d$ and then attempts to factorize
(M1)
$600(1.1)^{n-1} – d(1.1)^{n-1} \, (= 0) \ \Big((600 – d)(1.1)^{n-1} \, (= 0)\Big)$
METHOD 3
considers $C_{n+1} = 1.1C_n – d$ and $C_1 = 6000$
(A1)
EITHER
$6000 = 1.1 \times 6000 – d \ \ (C_1 = C_2 = 6000)$
(A1)
OR
systematically varies the value of $d$
(M1)
THEN
METHOD 4
EITHER
considers a specific $C_n = C_{n+1}$, for example, $C_2 = C_3$
(A1)
$6000(1.1) – 10d(1.1 – 1) = 6000(1.1)^2 – 10d\big((1.1)^2 – 1\big)$
attempts to solve their $C_n = C_{n+1}$ for $d$
(M1)
for example, $1.1d = 660$
OR
considers a specific $C_n = 6000$, for example, $C_2 = 6000$
(A1)
$6000(1.1)^{2-1} – 10d\big((1.1)^{2-1} – 1\big) = 6000$
attempts to solve their $C_n = 6000$ for $d$
(M1)
$6600 – d = 6000$
THEN
[3 marks]
(g)
$n = 1: \ \text{LHS} = u_1$ and $\text{RHS} = \left(u_1 r^{1-1} – \dfrac{d(r^{1-1} – 1)}{r – 1}\right) = u_1 r^0 – \dfrac{d(r^0 – 1)}{r – 1} = u_1$
R1
$\text{LHS} = \text{RHS}$ and so true for $n = 1$
Note: Award R0 for considering $n = 2$.
Subsequent marks after this R1 are independent of this mark and can be awarded.
assume true for $n = k \ \left(u_k = u_1 r^{k-1} – \dfrac{d(r^{k-1} – 1)}{r – 1}\right)$
M1
Note: The assumption of truth must be apparent. Do not award M1 for statements
such as “let $n = k$” or “assume that $n = k$ is true”. Subsequent marks after
this M1 are independent of this mark and can be awarded.
attempts to substitute for $u_k$ in $u_{k+1} = ru_k – d$
M1
$= r\left(u_1 r^{k-1} – \dfrac{d(r^{k-1} – 1)}{r – 1}\right) – d$
$= u_1 r^k – \dfrac{dr(r^{k-1} – 1)}{r – 1} – \dfrac{d(r – 1)}{r – 1} \ \left(= u_1 r^k – \dfrac{dr^k – dr}{r – 1} – d\right)$
A1
$= u_1 r^k – \dfrac{dr^k + dr – dr – d}{r – 1} \ \left(= u_1 r^k – \dfrac{dr^k – d}{r – 1}\right)$
A1
$= u_1 r^k – \dfrac{d(r^k – 1)}{r – 1}$
A1
since true for $n = 1$ and true for $n = k + 1$ if true for $n = k$, hence true for all $n \, (\in \mathbb{Z}^+)$
R1
Note: To obtain the final R1, four of the previous six marks must have been
awarded.
[7 marks]
Total [27 marks]