1 Note: In this question you may use without proof the result dxd(arctanx)=1+x21.
Let
In=∫01xnarctanxdx,
where n=0,1,2,3,….
(i) Show that, for n⩾0,
(n+1)In=4π−∫011+x2xn+1dx
and evaluate I0.
(ii) Find an expression, in terms of n, for (n+3)In+2+(n+1)In.
Use this result to evaluate I4.
(iii) Prove by induction that, for n⩾1,
(4n+1)I4n=A−21∑r=12n(−1)rr1,
where A is a constant to be determined.
Hint
The opening “Note” clearly flags a result which will prove important in this question; this is a ‘standard’ result, but one that can slip by unnoticed in single-maths A-levels; it is, therefore, worth learning as an “extra”, if necessary.
In (i), it should be obvious that the process of integration by parts is to be used and that the initial hint indicates that the “first part” must be the “arctan x” term, despite appearing as the second term of the product to be integrated. This will lead directly to the given result,
following which the substitution of n=0 leads to the integral ∫011+x2xdx. This can be done
by “recognition” (or reverse-Chain Rule integration) or by substitution. In the first instance,
one would note that ∫011+x2xdx=21∫011+x22xdx, where the numerator is precisely the
derivative of the denominator – the standard “log. integral” form; in the second instance, the substitution u=1+x2 will also work, though it might take just a few lines more working.
In (ii), one needs only to use the result given in (i), this time replacing n by (n+2) to find an expression for (n+3)In+2; and then adding to it the given expression for (n+1)In. This leads to a result in which two integrals must be added to get, when simplified,
∫011+x2xn+1(1+x2)dx, which should need no further comment. Setting n=0 and then n=2 in
this result then yields a numerical answer for I4, since I0 has already been calculated. In (iii), no matter how demanding the process of mathematical induction appears to be, it is very formulaic in some respects and there are always some marks to be had. To begin with, there is always the “baseline” case of (usually) n=1. In this case, one must set n=1 in the proposed formula and check it against the value of I4 already known. This reveals the value of A to be 41π−21ln2. However, since it is constant, it remains fixed during all of the remaining work and one can most easily progress through the rest of the inductive proof by simply continuing to use the letter A.
A clearly stated induction hypothesis is enormously helpful (usually replacing the n by another dummy index, k say) rather than vague statements such as “assume the result is true for n=k” or meaningless statements such as “assume n=k”. We thus proceed
assuming (4k+1)I4k+1=A−21∑r=12k(−1)rr1.
The remainder of the proof relies more on carefulness than inspiration, especially as the process relies on exactly the same techniques as were used in part (ii), using k and (k+1) in turn in the given result.
Model Solution
Part (i)
Using integration by parts with u=arctanx and dv=xndx:
du=1+x21dx,v=n+1xn+1
In=[n+1xn+1arctanx]01−n+11∫011+x2xn+1dx
Evaluating the boundary term: at x=1, n+11⋅4π; at x=0, 0.
This confirms the inductive step. Hence by induction, the result holds for all n≥1 with A=4π−21ln2.
Examiner Notes
Almost all candidates attempted this question, making it the most popular on the paper; it was also the highest-scoring, with a mean score of 15. Indeed, the careful structure meant that its direction was clear to almost all candidates and it was only the rather tricky induction proof in (iii) that prevented the question from being completely transparent.
2 The sequence of numbers x0,x1,x2,… satisfies
xn+1=xn+baxn−1.
(You may assume that a,b and x0 are such that xn+b=0.)
Find an expression for xn+2 in terms of a,b and xn.
(i) Show that a+b=0 is a necessary condition for the sequence to be periodic with period 2.
Note: The sequence is said to be periodic with period k if xn+k=xn for all n, and there is no integer m with 0<m<k such that xn+m=xn for all n.
(ii) Find necessary and sufficient conditions for the sequence to have period 4.
Hint
The opening part of the question is essentially identical to the process of composition of functions. Moreover, if subscripts are likely to prove confusing, then begin with a statement
such as “Let xn=X.” Thus xn+1=X+baX−1 and xn+2=(X+baX−1)+ba(X+baX−1)−1, which simply needs
tidying up. This yields xn+2=(a+b)X+(b2−1)(a2−1)X−(a+b). The “Note” in (i) reminds the reader that
the period of a periodic sequence is the length of the smallest cycle of repetition; thus, we require xn+2=xn but notxn+1=xn. A moment’s thought should reveal it to be obvious that a constant sequence should still yield part of the same algebra which gives xn+2=xn and it is worth exploring this first:
if xn+1=xn then aX−1=X2+bX⇒0=X2−(a−b)X+1.
One might be tempted to try to solve this (using the Quadratic formula, for instance), but there is really nothing to be gained by so doing, since the constant sequence is of no interest to us, only the conditions that give it (which we need to have in mind later on). Proceeding to explore xn+2=xn gives us, upon collecting up, 0=(a+b){X2−(a−b)X+1}. Fortunately, the factor (a+b) is readily apparent, but the quadratic factor should have been anticipated also, for the reasons outlined above. Thus, a+b=0 is a necessary condition for a period 2 sequence. (There is no requirement to explore the issue of sufficiency, which could be done by setting b=−a in the initial expression for xn+1 and then following it through to see what happens.)
Finally, we are asked to see what happens when xn+4=xn, and this can be done the long way round by finding xn+3=(a2+ab+b2−1)X−(a+2b+b3)(a3−2a−b)X−(a2+ab+b2−1) and then
xn+4=xn+3+baxn+3−1, but there is at least one very obvious shortcut to what is starting to look
like some complicated algebra: namely, considering the “two-step” result already found and repeating that, going from xn to xn+4 via xn+2. It also helps if one realises that whatever algebraic expression appears, we know that it must have the previously found factors of (a+b) and {X2−(a−b)X+1} within it.
The quadratic X2−(a−b)X+1=0 has at most two roots, so it cannot hold for a sequence that takes more than two distinct values. For a sequence with period exactly 2 (which must take at least two distinct values that both satisfy this equation), the quadratic can account for at most two terms. But for xn+2=xn to hold for alln, the factor (a+b) must be zero. Hence a+b=0 is a necessary condition.
Part (ii)
For period 4 we need xn+4=xn for all n but xn+2=xn for at least some n.
The two-step map xn+2=g(xn) where g(X)=(a+b)X+(b2−1)(a2−1)X−(a+b) is a M”obius transformation. Its four-step composition xn+4=g(g(xn)) is also a M”obius transformation.
Writing p=a2−1, q=−(a+b), r=a+b, s=b2−1, the composition g∘g is:
For g(g(X))=X to hold for all X in the sequence, the M”obius transformation g∘g must be the identity. This requires a2+b2−2=0, i.e.,
a2+b2=2
(If a2+b2=2, then g(g(X))=X only at the roots of the quadratic, so xn+4=xn fails for generic x0.)
With a2+b2=2, the map g satisfies g∘g=id, so xn+4=xn for all n. The period is exactly 4 (not 1 or 2) provided:
a+b=0 (otherwise g=id and the period is 1 or 2), and
x0 is not a fixed point of g, i.e., x02−(a−b)x0+1=0 (otherwise x2=x0 and the period is 1 or 2).
The necessary and sufficient conditions for period 4 are therefore:
a2+b2=2,a+b=0,x02−(a−b)x0+1=0
Examiner Notes
This was the second most popular question of all, attempted by over 80% of candidates; but scoring relatively poorly with a mean score of under 10. It was, of course, heavily algebraic and this meant that many candidates found it challenging, getting lost in the algebra. In most cases, this was largely avoidable: the simple device of calling the first term “X” (say) would have prevented a lot of unnecessary subscripts from cluttering up the working. A few moments of thought from those candidates who simply embarked on the (potentially) intricate algebra could have saved a lot of trouble. The point of a sequence’s periodicity is that it is the smallest cycle over which terms repeat; it should be noted that the condition for each term to be equal (a constant sequence) must clearly be embedded in any condition that gives xn+2=xn. Similarly, in order to satisfy xn+4=xn, we must automatically have the cases when all terms are the same and every other term equal present somewhere. This makes any ensuing factorisations much easier to deal with.
It could be noted that the requirement for xn+4=xn can be thought of as a two-stage sequence using every other term; and this situation has just been sorted out.
3 (i) Sketch, on x-y axes, the set of all points satisfying siny=sinx, for −π⩽x⩽π and −π⩽y⩽π. You should give the equations of all the lines on your sketch.
(ii) Given that
siny=21sinx
obtain an expression, in terms of x, for y′′ when 0⩽x⩽21π and 0⩽y⩽21π, and show that
y′′=−(4−sin2x)233sinx.
Use these results to sketch the set of all points satisfying siny=21sinx for 0⩽x⩽21π and 0⩽y⩽21π.
Hence sketch the set of all points satisfying siny=21sinx for −π⩽x⩽π and −π⩽y⩽π.
(iii) Without further calculation, sketch the set of all points satisfying cosy=21sinx for −π⩽x⩽π and −π⩽y⩽π.
Hint
Whilst this question might appear somewhat daunting on first reading, it involves little more than an understanding of the sine curve and the key results that relate to “angles in all quadrants”.
To begin with, "siny=sinx⇒y=x" is the kind of response expected from those candidates who have failed to understand that there are many functions (even the simple ones covered at A-level) that don’t map “one-to-one”. Though the general formula "siny=sinx⇒y=nπ+(−1)nx" might be unfamiliar, it only says that if siny=sinx (imagining x to be positive and acute) then y could be any “first quadrant” equivalent of x … an even multiple of π plus x … or a “second quadrant” supplement of x … an odd multiple of π minus x. (Apart from that, y‘s corresponding to non-acute x‘s arise from application of the same principles, with “quadrants” taking care of themselves due to the symmetries of the sine curve.)
In (i), it is then found that the general formula (or its equivalent in two bits) gives three graphs that are of interest here: n=−1 (y=−π−x), n=0 (y=x) and n=1 (y=π−x), all of which give straight-line segments in the interval required.
In (ii), there is rather less thinking to be done – at least to begin with – since one is only required to differentiate twice and do some tidying up. This calculus can be done implicitly or directly after rearranging into an arcsine form. That is not to say that it is easy calculus, since the Product, Quotient and Chain rules can all play a part in the processes that follow.
In sketching the graph, one should start simple and work up. Initially, dxdy=21 at (0,0), with
the curve increasing to a maximum at (2π,6π), since dx2d2y<0. This gives
x
y
0
0
...
$\frac{1}{2}\pi$
$\frac{1}{6}\pi$
Thereafter, for whatever “other” bits there are to the curve, these follow from symmetries, applied to the above portion: namely, reflection symmetry in x=2π; rotational symmetry about O; and reflection symmetry in y=±2π.
Part (iii)‘s graph follows by applying the result cosy≡sin(2π−y).
Model Solution
Part (i)
The general solution of siny=sinx is y=nπ+(−1)nx for integer n.
For −π⩽x⩽π and −π⩽y⩽π:
n=0: y=x (the diagonal from (−π,−π) to (π,π))
n=1: y=π−x (from (−π,2π)… but y must be in [−π,π], so we need π−x∈[−π,π], i.e., x∈[0,2π]. Restricted to x∈[0,π]: from (0,π) to (π,0))
n=−1: y=−π−x (from (−π,0) to (0,−π))
n=2: y=2π+x, which exceeds π for x>−π, so no segment in range.
The sketch consists of three line segments:
y=x for −π⩽x⩽π
y=π−x for 0⩽x⩽π
y=−π−x for −π⩽x⩽0
These form a “bow-tie” pattern: the main diagonal y=x, plus a segment from (0,π) to (π,0) and a segment from (−π,0) to (0,−π).
Part (ii)
Differentiating siny=21sinx implicitly:
cosy⋅y′=21cosx⟹y′=2cosycosx
For the second derivative, using implicit differentiation of cosy⋅y′=21cosx:
−siny⋅(y′)2+cosy⋅y′′=−21sinx
y′′=cosy−21sinx+siny⋅(y′)2
Since siny=21sinx and (y′)2=4cos2ycos2x:
siny⋅(y′)2=8cos2ysinxcos2x
Also cos2y=1−sin2y=1−41sin2x=44−sin2x, so cosy=24−sin2x.
At x=0: y=0, y′(0)=21. Since y′′<0 for x>0, the curve is concave down. At x=2π: y=6π. The curve rises from the origin with slope 21, curving concavely to the point (2π,6π).
Extending to [−π,π]2:
The equation siny=21sinx has:
Rotational symmetry about the origin: replacing (x,y) by (−x,−y) preserves the equation.
No reflection symmetry in x=0 since sin(−x)=−sinx.
The full curve consists of four arcs, forming a closed “rounded diamond” shape:
(0,0)→(2π,6π)→(π,6π) (concave down, first quadrant)
(π,6π)→(π,−6π) (a short segment along x=π… actually no, the curve connects through x=π continuously)
More precisely: The curve is a closed convex-like shape passing through (0,0), (2π,6π), (π,6π), (2π,−6π), (0,0)… No, let me reconsider.
The full curve passes through (0,0), (π,6π), (0,0)… Hmm. Actually the curve is closed and passes through the origin. By the rotational symmetry, if (x0,y0) is on the curve, so is (−x0,−y0). The four arcs connect:
Arc in first quadrant: (0,0) to (π,6π)
Arc in fourth quadrant: (π,−6π) to (0,0) (by symmetry)
Arc in third quadrant: (0,0) to (−π,−6π) (by symmetry)
Arc in second quadrant: (−π,6π) to (0,0) (by symmetry)
These form a closed loop through the origin, with the curve passing through (±π,±6π).
Part (iii)
Using cosy=sin(2π−y), set Y=2π−y, so sinY=21sinx.
This is exactly the equation from part (ii) in the (x,Y) plane. The transformation y=2π−Y shifts the curve upward by 2π and reflects in Y.
The curve from part (ii) in the (x,Y) plane passes through (0,0), (π,6π), (−π,−6π), etc.
In the (x,y) plane with y=2π−Y:
(x,Y)=(0,0)→(x,y)=(0,2π)
(x,Y)=(π,6π)→(x,y)=(π,3π)
(x,Y)=(0,0)→(x,y)=(0,2π)
The curve cosy=21sinx is the part (ii) curve shifted vertically by 2π, forming a closed loop passing through (0,2π), (π,3π), (0,−2π), (−π,−3π), and back to (0,2π). It is symmetric about the origin (since replacing (x,y) by (−x,−y) preserves cosy=21sinx).
Examiner Notes
Attempts fell to around the 50% figure with marks scored by those who attempted the question averaging about 10 out of 20. There is not much to this question beyond the baseline realisation that siny=sinx does not necessarily imply that y=x. In essence, it is all about “quadrants” work, where candidates need to consider the two solutions, x and π−x in one period of the sine function, and then adding or subtracting multiples of 2π as necessary. Once one has done this, the accompanying straight-line segments are straightforward marks in the last part of (i).
A lot of marks were gained in (ii), as candidates were clearly attracted by the familiar “differentiate this couple of times” demand; most of them were quite happy with the differentiation, performed either implicitly or directly using arcsines.
The drawings required in (ii) and (iii) then relied on an appreciation of the symmetries of the sine function, along with the use of the identity cosy≡sin(21π−y).
4 The Schwarz inequality is
(∫abf(x)g(x)dx)2⩽(∫ab(f(x))2dx)(∫ab(g(x))2dx).(*)
(i) By setting f(x)=1 in (∗), and choosing g(x), a and b suitably, show that for t>0,
et+1et−1⩽2t.
(ii) By setting f(x)=x in (∗), and choosing g(x) suitably, show that
∫01e−21x2dx⩾12(1−e−41)2.
(iii) Use (∗) to show that
25π64⩽∫021πsinxdx⩽2π.
Hint
This is an interesting question and very straightforward in some respects. To begin with, you are told in part (i) that f(x) = 1. At this point, it would be wise to write down what the Schwarz inequality gives in this case:
(∫abg(x) dx)2≤(∫ab1 dx)(∫ab[g(x)]2 dx); i.e. (∫abg(x) dx)2≤(b−a)(∫ab[g(x)]2 dx).
A few moments of careful thought (inspecting the given answer) should make you realise that a=0, b=t give the terms (b−a)=(t−0) and (et−e0) when g(x)=ex. Following it through from there is relatively routine, provided one spots the difference-of-two-squares factorisation and that we can divide throughout by (et+1), which is guaranteed to be positive (an important consideration when dealing with inequalities).
In (ii), it is (again) best to start by seeing how things appear when you have used the given information that f(x) = x and, by clear implication, a=0 and b=1:
(∫01x g(x) dx)2≤(∫01x2 dx)(∫01[g(x)]2 dx); i.e. (∫01x g(x) dx)2≤31(∫01[g(x)]2 dx).
The e−41 in the given answer, along with the fact that (e−41x2)2=e−21x2 should point the way
towards choosing g(x)=e−41x2. Following this through carefully again yields the required result.
The result in part (iii) clearly requires the use of the Schwarz inequality twice, once each for the right- and left-halves of the given result. Setting f(x)=1, g(x)=sinx, a=0 and
b=21π leads to ∫021πsinx dx≤2π. However, the left-hand half of the result does require a
bit more thought and, preferably, familiarity with the integration of trig. functions where powers of sinx (in this case) appear along with its derivative, cosx. The real clue is that, for
the ∫021πsinx dx to appear on the other side of the inequality to the one found using the
obvious candidates that led to the right-hand half of the result, sinx must now be the result of the squaring process. It is then experience (or insight) that suggests setting f(x)=cosx, g(x)=4sinx, a=0 and b=21π. You will then find that the LHS of the Schwarz inequality requires the integration of a function of sinx multiplied by its derivative, cosx; and this (as in Q1) can be done by “recognition” or substitution. (You will also need to be able to integrate cos2x, which calls upon the use of the standard double-angle formula for cosine.)
Model Solution
Part (i)
Set f(x)=1, g(x)=ex, a=0, b=t in the Schwarz inequality:
(∫0texdx)2⩽(∫011dx)(∫0te2xdx)
(et−1)2⩽t⋅2e2t−1
(et−1)2⩽2t(et−1)(et+1)
Since et−1>0 for t>0, divide both sides by (et−1)(et+1)>0:
First integral on the right: Using cos2x=21(1+cos2x):
∫0π/2cos2xdx=21[x+2sin2x]0π/2=4π
So:
2516⩽4π∫0π/2sinxdx
∫0π/2sinxdx⩾25π64
Combining both results:
25π64⩽∫0π/2sinxdx⩽2π
Examiner Notes
This is the first question where the difference between “attempts” and “serious attempts” arises to any significant extent: there were just over 800 of the former but well under 500 of the latter. This is also a good point at which to raise a key issue in respect of strategy for candidates sitting a STEP. Spending a few minutes of reading time, at some particular time during the examination, could be a significant asset, especially to those candidates who have particular strengths and weaknesses to play to or to avoid. A very brief analysis of this question, on first reading, should help one recognise that a result is being given (with no requirement to establish it in any way) and all that is required is to use it. Part (i) then clearly directs part of the way, and the required limits are rather obviously flagged, as is the fact that g(x) must be something to do with the exponential function. One of the two functions to be used in (ii) is also given, as are the limits; an inspection of the given should
lead to the (correct) conclusion that g(x)must be e−41x2. Getting just this far takes the candidate to the 10-mark point, a perfectly good return for a candidate who has read the question through sufficiently carefully to realise that it has decent potential for mark-acquisition.
In the final part of the question some careful thought was needed, with only the required limits obvious at first glance. Most attempts, serious or otherwise, picked up the majority of their marks in (i) and (ii) and efforts at (iii) were very varied: many candidates simply gave up and moved on; many more picked up a few extra marks by setting g(x)=sinx (which is a fairly obvious candidate to try) and working towards the right-hand half of the given result. Very few candidates indeed had the experience to realise that sinx now needed to appear as the squared term, which also meant that a cosine term had to be involved.
5 A curve C is determined by the parametric equations
x=at2,y=2at,
where a>0.
(i) Show that the normal to C at a point P, with non-zero parameter p, meets C again at a point N, with parameter n, where
n=−(p+p2).
(ii) Show that the distance ∣PN∣ is given by
∣PN∣2=16a2p4(p2+1)3
and that this is minimised when p2=2.
(iii) The point Q, with parameter q, is the point at which the circle with diameter PN cuts C again. By considering the gradients of QP and QN, show that
2=p2−q2+p2q.
Deduce that ∣PN∣ is at its minimum when Q is at the origin.
Hint
In many ways, much of this question is also relatively routine. Find dxdy for the gradient of
the tangent; find its negative reciprocal for the gradient of the normal and then any one of a number of formulae for the equation of a line. At some stage, you will need to replace t by p for the normal at P and then replace x and y in this equation by an2 and 2an for another point on the curve. Solving for n in terms of p – noting that the factor (n−p) must be involved somewhere, since n=p must be one solution to whatever equation arises as the line is already known to meet the curve at P – should then yield the given answer.
In (ii), employing the distance formula PN2=(xP−xN)2+(yP−yN)2 is clearly the way
forwards, as is replacing n by −(p+p2) at some stage of the proceedings. The rest is just
careful algebra. Differentiating the given expression for PN2 with respect to p is routine enough, in principle, and it is then only required to justify that the (only) values of p that arise will give minimum points. One could use the first-derivative test (looking for a change of sign), the second-derivative test (examining its sign) or argue from the shape of the curve
(y=)p416a2(p2+1)3... which is symmetric in the y-axis, asymptotic to the y-axis for small
values of p, and can be arbitrarily large as ∣p∣→∞; thus, any turning-points must be minima.
For part (iii), one starts by noting that PQ and NQ are perpendicular (since ∠PQN=90∘, by
“Angle in a semi-circle”). Then, setting the products of their gradients, p+q2 and n+q2,
equal to −1, replacing n by −(p+p2) once again, and using p2=2, takes you almost the
whole way there: q2=p2q. From this point, we have q=0 or q=p2=±2. Finally, these
final two cases should be eliminated by noting that they give q=p, i.e. Q=P, which is not the case as they are being taken to be distinct points.
Model Solution
Part (i)
The gradient of the tangent at parameter t is:
dxdy=dx/dtdy/dt=2at2a=t1
The normal at P=(ap2,2ap) has gradient −p and equation:
y−2ap=−p(x−ap2)
The point N=(an2,2an) lies on C and on this normal:
2an−2ap=−p(an2−ap2)
2a(n−p)=−ap(n2−p2)=−ap(n−p)(n+p)
Since n=p (as N=P), divide by a(n−p)=0:
2=−p(n+p)
n+p=−p2
n=−p−p2
Part (ii)
∣PN∣2=(ap2−an2)2+(2ap−2an)2=a2(p2−n2)2+4a2(p−n)2
=a2(p−n)2[(p+n)2+4]
From part (i): n−p=−p2−2p=−p2(p2+1), so (p−n)2=p24(p2+1)2.
Also n+p=−p2, so (n+p)2+4=p24+4=p24(p2+1).
∣PN∣2=a2⋅p24(p2+1)2⋅p24(p2+1)=p416a2(p2+1)3
Minimising: Let u=p2>0, so ∣PN∣2=16a2⋅h(u) where h(u)=u2(u+1)3.
h′(u)<0 for u<2 and h′(u)>0 for u>2, so h has a minimum at u=2, i.e., p2=2.
Part (iii)
Since PN is a diameter of the circle and Q lies on the circle, ∠PQN=90∘ (angle in a semicircle).
The gradient of PQ: ap2−aq22ap−2aq=p+q2.
The gradient of QN: aq2−an22aq−2an=q+n2.
Since PQ⊥QN:
p+q2⋅q+n2=−1
4=−(p+q)(q+n)
4=−q2−(p+n)q−pn
q2+(p+n)q+pn+4=0
Substituting n=−p−p2:
p+n=−p2,pn=p(−p−p2)=−p2−2
q2−p2q+(−p2−2)+4=0
q2−p2q+2−p2=0
which rearranges to 2=p2−q2+p2q, as required.
Deduction: At the minimum, p2=2, so 2−p2=0 and the equation becomes:
q2−p2q=0⟹q(q−p2)=0
So q=0 or q=p2.
If q=p2: checking against p, when p=2, q=2=p (so Q=P, rejected); when p=−2, q=−2=p (again Q=P, rejected).
Therefore q=0, meaning Q is the origin.
Examiner Notes
Attempts at this question were over the thousand figure, making it the third most popular question on the paper, with the second-highest mean score. Part (i) proved to be very routine; the calculus requirements in (ii) were obvious to most, though justifying the minimum distance was often poorly handled; for instance, finding the second derivative is a poor way to spend one’s time when examining the sign of the first derivative is easily undertaken. The needs of part (iii) were also easily spotted though, again, a couple of marks were almost universally lost as the need to eliminate the two other cases that arise was largely ignored.
Part (i) explicitly required induction, so there is a standard procedure to follow – check it works when n = 1, assume it works when n = k and show that this leads to it being true when n = k + 1. Only the last part causes any issue. There is some fairly subtle logic: using the n = k assumption it can be shown that
S_{k+1} ≤ 2√k - 1 + 1/√(k+1)
However, what is really needed is: S_{k+1} ≤ 2√(k+1) - 1.
One way in which this can be established (technically a sufficient, but not necessary condition) is if it can be shown that
2√k - 1 + 1/√(k+1) ≤ 2√(k+1) - 1
A bit of tidying and rearranging shows that this is equivalent to 4k² + 4k ≤ 4k² + 4k + 1, which is “obviously” true. You might worry a little about the fact that the equality is never satisfied, but showing that the strict inequality is true is sufficient.
The first part of part (ii) is also just about squaring up and showing that the statement is equivalent to an “obviously” true statement (in this case that 16k³ + 24k² + 9k + 1 > 16k³ + 24k² + 9k). No induction required!
In the final part we first need to come up with a conjecture. A reasonable place to start is to try n = 1, so that 1 ≥ 2.5 - C. For this to work we need that C ≥ 1.5 so C = 1.5 is the smallest value that works for S_1. However will this work for all subsequent S_n too? It turns out that it does, but that requires proving the conjecture
S_n ≥ 2√n + 1/(2√n) - 1.5
This requires induction, following a very similar argument to part (i). One line of the algebra in the proof requires (4k + 1)√(k+1) ≥ (4k + 3)√k, which can be done using the initially unimportant fact at the beginning of part (ii) – always look out for making links between the different parts of questions!
Model Solution
Part (i)
Base case (n=1): S1=1⩽21−1=1. True.
Inductive step: Assume Sk⩽2k−1 for some k⩾1. Then
Sk+1=Sk+k+11⩽2k−1+k+11
We need 2k−1+k+11⩽2k+1−1, i.e.,
k+11⩽2(k+1−k)
Rationalising the right side:
2(k+1−k)=k+1+k2
We need k+1+k2⩾k+11, which is equivalent to 2k+1⩾k+1+k, i.e., k+1⩾k. This is true for all k⩾1.
Hence Sk+1⩽2k+1−1, completing the induction.
Part (ii)
First result: Both sides are positive for k⩾0, so squaring preserves the inequality:
(4k+1)2(k+1)>(4k+3)2k
LHS =(16k2+8k+1)(k+1)=16k3+24k2+9k+1
RHS =(16k2+24k+9)k=16k3+24k2+9k
LHS − RHS =1>0, so the inequality holds for all k⩾0.
Determining C: For n=1: S1=1⩾2+21−C requires C⩾23. We claim C=23 works for all n, i.e.,
Sn⩾2n+2n1−23
Base case (n=1): 1⩾2+21−23=1. True.
Inductive step: Assume the result for k⩾1. Then
Sk+1=Sk+k+11⩾2k+2k1−23+k+11
We need:
2k+2k1+k+11⩾2k+1+2k+11
Rearranging:
2k−2k+1+2k1+k+11−2k+11⩾0
−2(k+1−k)+2k1+2k+11⩾0
We need 2k1+2k+11⩾2(k+1−k).
Let a=k, b=k+1 (so a,b>0 and b>a). The inequality becomes:
2a1+2b1⩾2(b−a)
2aba+b⩾a+b2
Cross-multiplying (all terms positive):
(a+b)2⩾4ab
(a−b)2⩾0
which is true, with strict inequality since a=b. This completes the induction, so C=23.
Examiner Notes
This question was relatively popular, but it turned out to be one of the hardest of the pure questions. The first part was a reasonably standard example of induction but nearly all candidates failed to understand the subtlety of what was required in the last part. Most candidates made significant progress with part (i), clearly being familiar with the process of induction. However, the algebra to complete the proof was too much for most candidates. Inequalities were frequently handled poorly and the general presentation of logical arguments was unclear with many candidates assuming what was required and not making implications clear. Attempts which brought in calculus were rarely relevant and even less frequently correct.
In the second part, candidates tended to overcomplicate the question. Squaring up (since both sides are clearly positive) and expanding brackets was all that was required. It would have been nice if students had shown some awareness that the squaring process was valid since both sides were positive, however if we had required this it would have effectively been a one mark penalty for all candidates.
In the final part candidates often considered S_1 to find a necessary bound on C. However, further work – usually an induction using their guess – was required to show that this bound works for all n. Many candidates seemed unaware that this final stage was required.
(i) By taking logarithms, or otherwise, show that f(x)>x for 0<x<1. Show further that x<g(x)<f(x) for 0<x<1.
Write down the corresponding results for x>1.
(ii) Find the value of x for which f′(x)=0.
(iii) Use the result xlnx→0 as x→0 to find limx→0f(x), and write down limx→0g(x).
(iv) Show that x−1+lnx⩾1 for x>0.
Using this result, or otherwise, show that g′(x)>0.
Sketch the graphs, for x>0, of y=x, y=f(x) and y=g(x) on the same axes.
Hint
In this question the difficulty is being able to see that some result is “obviously” true but then having great difficulty in justifying it from particular starting-points: it is not enough to make a true statement (especially when it is given in the question) … one must justify it fully from given, or known, facts and careful deductive reasoning.
Here, in (i), it is known that, for 0 < x < 1, x is positive and ln x is negative. Thus 0 > x ln x > ln x can be deduced by multiplying the first inequality throughout by a negative quantity (remembering that this reverses the direction of inequality signs). This is just ln 1 > ln(x^x) > ln x and, since the logarithmic function is strictly increasing, (1 >) f(x) > x. A more complete argument along similar lines shows that x < g(x) < f(x). The final part requires no further justification; since for x > 1, ln x > 0 we now have x < f(x) < g(x).
For part (ii), it is customary to use logs first and then differentiate implicitly. In (iii), only an informal understanding regarding the justification of limits is expected, but one still should have a grasp as to how things should be set out. Here, something along the lines of
lim_{x→0} f(x) = lim_{x→0} e^{x ln x} = lim_{x→0} e^0 = 1
and so lim_{x→0} g(x) = lim_{x→0} x^{f(x)} = lim_{x→0} x^1 = 0 would be expected.
In (iv), the use of calculus is the most straightforward approach, differentiating y = 1/x + ln x for x > 0 and showing that it has a unique minimum turning point at (1, 1). This is then fed in to the derivative of g(x) – again using the logarithmic form and implicit differentiation – along with a simple observation that squares are necessarily non-negative and this all falls nicely into place. Most of what is required in order to sketch x, f(x) and g(x) has already been established and all that is left is to put it together in a sensibly-sized diagram.
Model Solution
Part (i)
For 0<x<1: lnx<0, so multiplying 0<x<1 by the negative quantity lnx reverses the inequalities:
0>xlnx>lnx
Since 0=ln1 and xlnx=ln(xx):
ln1>ln(xx)>lnx
Since ln is strictly increasing: 1>xx>x, i.e., f(x)>x.
For g(x)=xf(x): since x<f(x)<1 and lnx<0, multiplying by lnx reverses the inequalities:
xlnx>f(x)lnx>lnx
i.e., ln(xx)>ln(xf(x))>lnx, so xx>xf(x)>x, giving x<g(x)<f(x).
For x>1: lnx>0, so 0<xlnx<lnx gives 1<xx<x, hence x<f(x).
Since x>1 and x<f(x): xlnx<f(x)lnx (both positive), so xx<xf(x), giving f(x)<g(x).
Therefore: x<f(x)<g(x) for x>1.
Part (ii)
Taking logarithms: lnf(x)=xlnx. Differentiating:
f(x)f′(x)=1+lnx
f′(x)=xx(1+lnx)
Setting f′(x)=0: since xx>0, we need 1+lnx=0, giving x=e−1.
Part (iii)
limx→0+f(x)=limx→0+exlnx=elimx→0+xlnx=e0=1
limx→0+g(x)=limx→0+xf(x)=limx→0+x1=0
since f(x)→1 as x→0+.
Part (iv)
Proving x−1+lnx⩾1: Let h(x)=x1+lnx for x>0.
h′(x)=−x21+x1=x2x−1
h′(x)<0 for 0<x<1 and h′(x)>0 for x>1, so h has a minimum at x=1:
The bracket is x1+lnx+(lnx)2. Since x1+lnx⩾1 and (lnx)2⩾0:
x1+lnx+(lnx)2⩾1>0
Since xx>0 and xf(x)>0 for x>0, we conclude g′(x)>0.
Sketch (for x>0):
All three curves pass through (1,1).
y=x: the straight line through the origin.
y=f(x)=xx: approaches 1 as x→0+, has a minimum at x=e−1 where f(e−1)=e−1/e≈0.692, then increases through (1,1) and grows faster than any polynomial for large x.
y=g(x)=xf(x): starts at 0 as x→0+, strictly increasing (since g′(x)>0), passes through (1,1), and grows even faster than f(x) for x>1.
For 0<x<1: x<g(x)<f(x)<1.
For x>1: 1<x<f(x)<g(x).
The ordering from bottom to top switches at x=1: below x=1, g is between x and f; above x=1, f is between x and g.
Examiner Notes
Just over one thousand candidates attempted this question, but more than 400 of these attempts were not substantial; removing the large number of those scripts which got no further than part (i) raises the mean score from well under 8 to just over 12 out of 20.
The difficulty with questions like this is that it is very easy to make correct statements but much more difficult to support them with logically-crafted steps of reasoning based on results either given or known. Moreover, one needs to reason in such a way that the steps of working one writes down are justified … this was the principal barrier to anything more than the most faltering of starts. So, part (i) was an issue for candidates, with much written but not much of it coherently stated or supported. Of the few marks gained in the weaker attempts, part (ii) provided the majority of them, since most candidates were happy to take logs and then differentiate (the standard procedure for exponential equations of this kind).
It was slightly surprising to note that so few candidates attempted to establish the initial result in part (iv) using calculus; most of those that got this far presumably thought some other ‘inequality’ technique was being tested.
Finally, even for those who had made good progress in several of the previous parts, the graphs at the end were frequently marred by a lack of labelling.
8 All vectors in this question lie in the same plane.
The vertices of the non-right-angled triangle ABC have position vectors a, b and c, respectively. The non-zero vectors u and v are perpendicular to BC and CA, respectively.
Write down the vector equation of the line through A perpendicular to BC, in terms of u, a and a parameter λ.
The line through A perpendicular to BC intersects the line through B perpendicular to CA at P. Find the position vector of P in terms of a, b, c and u.
Hence show that the line CP is perpendicular to the line AB.
Hint
Although vectors expressed in general terms are not handled well by the majority of STEP candidates, such questions invariably involve little that is of any great difficulty. If one is sufficiently confident in handling vectors, this question is perhaps the easiest on the paper. The only things involved in this question are the equations of lines in the standard vector form r = p + tq and the use of the scalar product for finding angles (in particular the result that, for non-zero vectors p and q, p·q = 0 ⇔ p and q are perpendicular).
Thus, we have the line through A perpendicular to BC is r = a + λu and the line through B perpendicular to CA is r = b + μv, which meet when a + λu = b + μv ⇒ v = (1/μ)(a - b + λu).
Since v is perpendicular to CA, (a - b + λu)·(a - c) = 0 which leads to a scalar expression for λ and hence a vector expression for p = a + λu.
Next, CP = p - c = a - c + λu, and
CP·AB = (a - c + λu)·(b - a) = (a - c)·(b - a) + λu·(b - a).
Now u·(b - c) = 0 since u is perpendicular to BC ⇒ u·b = u·c. Substituting this into CP·AB leads very quickly to the required zero for the perpendicularity result required.
Note: those readers familiar with the common geometric ‘centres’ of triangles will, no doubt, have spotted that this question is about nothing more than the orthocentre of a triangle; that is, the point at which the three altitudes meet. In this question, you are given two altitudes; find their point of intersection, and then show that the line from the third vertex through this point meets the opposite side at right-angles.
Model Solution
Line through A perpendicular to BC:
r=a+λu
Finding P:
The line through B perpendicular to CA is r=b+μv. At the intersection P:
a+λu=b+μv
Since v is perpendicular to CA=a−c, taking the dot product with (a−c):
(a+λu−b)⋅(a−c)=0
(a−b)⋅(a−c)+λu⋅(a−c)=0
λ=−u⋅(a−c)(a−b)⋅(a−c)
Therefore the position vector of P is:
p=a−u⋅(a−c)(a−b)⋅(a−c)u
Showing CP⊥AB:
CP=p−c=(a−c)+λu
CP⋅AB=[(a−c)+λu]⋅(b−a)
=(a−c)⋅(b−a)+λu⋅(b−a)
Since u is perpendicular to BC=c−b, we have u⋅b=u⋅c, so:
since (a−c)⋅(b−a)=−(a−b)⋅(a−c) by symmetry of the dot product (both equal −(a−b)⋅(a−c)… let me verify).
Actually: (a−c)⋅(b−a) and (a−b)⋅(a−c).
(a−b)⋅(a−c)=a⋅a−a⋅c−b⋅a+b⋅c
(a−c)⋅(b−a)=a⋅b−a⋅a−c⋅b+c⋅a
=−(a⋅a−a⋅c−b⋅a+b⋅c)=−(a−b)⋅(a−c)
So indeed (a−c)⋅(b−a)=−(a−b)⋅(a−c), confirming:
CP⋅AB=−(a−b)⋅(a−c)+(a−b)⋅(a−c)=0
Hence CP is perpendicular to AB. (This shows that the three altitudes of triangle ABC are concurrent at the orthocentre P.)
Examiner Notes
The vectors question again proved extremely unpopular, despite the fact that it is perhaps the easiest question on the paper. It drew the least number of attempts from the Pure Maths questions (the only one under half of the entry) and two-thirds of these were not substantial attempts. In this case, it is easy to say what (almost invariably) appeared: candidates generally got no further than the first three marks, which could be gained by writing down two line equations, r = a + λu and r = b + μv, and then equating the two expressions for r. Few made further progress, revealing a reluctance to engage with the algebraic manipulation of vectors (handling numerical vectors is, of course, a completely different matter altogether).