Year: 2014
Paper: 1
Question Number: 6
Course: LFM Pure
Section: Trigonometry 2
More than 1800 candidates sat this paper, which represents another increase in uptake for this STEP paper. The impression given, however, is that many of these extra candidates are just not sufficiently well prepared for questions which are not structured in the same way as are the A-level questions that they are, perhaps, more accustomed to seeing. Although STEP questions try to give all able candidates "a bit of an intro." into each question, they are not intended to be easy, and (at some point) imagination and real flair (as well as determination) are required if one is to score well on them. In general, it is simply not possible to get very far into a question without making some attempt to think about what is actually going on in the situation presented therein; and those students who expect to be told exactly what to do at each stage of a process are in for a shock. Too many candidates only attempt the first parts of many questions, restricting themselves to 3-6 marks on each, rather than trying to get to grips with substantial portions of work – the readiness to give up and try to find something else that is "easy pickings" seldom allows such candidates to acquire more than 40 marks (as was the case with almost half of this year's candidature, in fact). Poor preparation was strongly in evidence – curve-sketching skills were weak, inequalities very poorly handled, algebraic capabilities (especially in non-standard settings) were often pretty poor, and the ability to get to grips with extended bits of working lacking in the extreme; also, an unwillingness to be imaginative and creative, allied with a lack of thoroughness and attention to detail, made this a disappointing (and, possibly, very uncomfortable) experience for many of those students who took the paper. On the other side of the coin, there was a very pleasing number of candidates who produced exceptional pieces of work on 5 or 6 questions, and thus scored very highly indeed on the paper overall. Around 100 of them scored 90+ marks of the 120 available, and they should be very proud of their performance – it is a significant and noteworthy achievement.
Difficulty Rating: 1500.0
Difficulty Comparisons: 0
Banger Rating: 1474.3
Banger Comparisons: 2
\begin{questionparts}
\item The sequence of numbers $u_0, u_1, \ldots $ is given by
$u_0=u$ and, for $n\ge 0$,
\begin{equation}
u_{n+1} =4u_n(1- u_n)\,.
\tag{$*$}
\end{equation}
In the case $u= \sin^2\theta$ for some given angle $\theta$, write down and simplify expressions for $u_1$ and $u_2$ in terms of $\theta$. Conjecture an expression for $u_n$ and prove your conjecture.
\item The sequence of numbers $v_0, v_1, \ldots$ is given by $v_0=
v \text{ and, for }n\ge 0$,
\[
v_{n+1} = -pv_n^2 +qv_n +r\,,
\]
where $p$, $q$ and $r$ are given numbers, with $p\ne0$. Show that a substitution of the form $v_n =\alpha u_n +\beta$, where $\alpha$ and $\beta$ are suitably chosen, results in the sequence $(*)$ provided that
\[
4pr = 8 +2q -q^2 \,.
\]
Hence obtain the sequence satisfying $v_0=1$ and, for $n\ge0$, $v_{n+1} = -v_n^2 +2 v_n +2 \,$.
\end{questionparts}
\begin{questionparts}
\item Suppose $u_0 = u = \sin^2 \theta$ then
\begin{align*}
&& u_1 &= 4 u_0 (1-u_0) \\
&&&= 4 \sin^2 \theta ( 1- \sin^2 \theta) \\
&&&= 4 \sin^2 \theta \cos^2 \theta \\
&&&= (2 \sin \theta \cos \theta)^2 \\
&&&= (\sin 2 \theta)^2 = \sin^2 2 \theta \\
\\
&& u_2 & = 4u_1 (1-u_1) \\
&&&= 4 \sin^2 2\theta \cos^2 2 \theta \\
&&&= \sin^2 4 \theta
\end{align*}
Claim: $u_n = \sin^2 2^n \theta$.
Proof: (By Induction) Base case is clear, suppose it's true for $n=k$, then
\begin{align*}
&& u_{k+1} &= 4u_k(1-u_k) \\
&&&= 4 \sin^2 2^k \theta(1-\sin^2 2^k \theta) \\
&&&= (2 \sin 2^k \theta \cos 2^k \theta)^2 \\
&&&= (\sin 2^{k+1} \theta)^2 \\
&&&= \sin^2 2^{k+1} \theta
\end{align*}
Therefore since it is true for $n = 1$ and if it's true for $n = k$ it is true for $n=k+1$ it must be true for all $k$.
\item Suppose $v_n = \alpha u_n + \beta$ then
\begin{align*}
&& (\alpha u_{n+1}+\beta) &= -p(\alpha u_n + \beta)^2 + q(\alpha u_n + \beta) + r \\
&&&= -p\alpha^2u_n^2+\alpha(q-2p\beta) u_n -p \beta^2 +q \beta+r \\
\Rightarrow && u_{n+1} &= u_n(q-2p\beta -p \alpha u_n) -(p\beta^2-(q-1)\beta-r)
\end{align*}
So if $\alpha = \frac{4}{p}$ and $q-2p\beta = 4$ ie $\beta = \frac{q-4}{2p}$ then we also need the constant term to vanish, ie
\begin{align*}
0 &&&= p\beta^2-(q-1)\beta+r \\
&&&= p \left (\frac{q-4}{2p} \right)^2 - (q-1) \frac{q-4}{2p} - r \\
\Rightarrow && 0 &= p(q-4)^2 -(q-1)(q-4)2p - 4p^2r \\
\Rightarrow && 0 &= (q-4)^2-2(q-1)(q-4)-4pr \\
&&&= q^2-8q+16-2q^2+10q-8-4pr \\
\Rightarrow && 4pr &= -q^2+2q+8
\end{align*}
Suppose $v_{n+1} = -v_n^2 + 2v_n +2$ then since $4\cdot 1 \cdot 2 = 8$ and $8 + 4 -4 = 8$ we can apply our method.
$v_n = 4u_n + \frac{-2}{2} = 4u_n -1 = 4\sin^2 (2^{n-1} \pi)-1$
\end{questionparts}
Around half of the candidates attempted this question, though successful working was (yet again) almost entirely limited to the opening part. Even here, there were far too many candidates who were unable to turn 4sin²θcos²θ into sin²2θ. Many of those who did spot this simplification had difficulties trying to find u₂ in a similar form – thereby completely overlooking the fact that starting with sin²(A) at any stage of the process clearly had to yield sin²(2A) at the next. This also applies to the inductive step, which thus requires almost no further working – a position which was carefully avoided by all those who ploughed on into the standard format of a proof by induction without thinking about what they had just established. Part (ii) was not often attempted. Some candidates substituted for vn but not vn+1; others thought that un and un² were the same thing and collected their coefficients up together; and, generally, the algebra was clearly found very unappealing. The very last part of the question required a "hence" approach, so those candidates who simply set about the sequence numerically scored only one mark. Even those who played the game according to the "hence" overlooked the need to check that the given condition was satisfied.