2 The curves C1 and C2 both satisfy the differential equation
dxdy=x−kxykxy−y,
where k=ln2.
All points on C1 have positive x and y co-ordinates and C1 passes through (1,1). All points on C2 have negative x and y co-ordinates and C2 passes through (−1,−1).
(i) Show that the equation of C1 can be written as (x−y)2=(x+y)2−2x+y.
Determine a similar result for curve C2.
Hence show that y=x is a line of symmetry of each curve.
(ii) Sketch on the same axes the curves y=x2 and y=2x, for x⩾0. Hence show that C1 lies between the lines x+y=2 and x+y=4.
In both cases the equation is invariant under (x,y)↦(y,x), so symmetric in y=x.
2(ii)
Graphs: correct shapes of y=x2 and y=2x, intersections at (2,4) and (4,16).
(x−y)2≥0 implies (x+y)2>2x+y, so x+y must lie between 2 and 4.
Graph: symmetry about y=x; closed curve between x+y=2 and x+y=4; passes through (1,1) and (2,2).
2(iii)
Sketches of y=x2 and y=2x+4; x2>2x+4 only when x<−2.
Graph: symmetry about y=x; passes through (−1,−1); y→0 as x→∞, y→−∞ as x→0.
Model Solution
Part (i)
The differential equation is
dxdy=x−kxykxy−y=x(1−ky)y(kx−1)
Separating variables:
y1−kydy=xkx−1dx⟹(y1−k)dy=(k−x1)dx
Integrating both sides:
ln∣y∣−ky=kx−ln∣x∣+c
Rearranging:
ln∣x∣+ln∣y∣=k(x+y)+c⟹ln∣xy∣=k(x+y)+c
So ∣xy∣=ec⋅ek(x+y). Writing A=ec>0:
∣xy∣=A⋅ek(x+y)=A⋅2x+y
Curve C1 (positive x,y): Here xy=∣xy∣, so xy=A⋅2x+y.
Substituting (1,1): 1=A⋅22, so A=41. Hence
xy=41⋅2x+y=2x+y−2
Using the identity (x+y)2=(x−y)2+4xy:
(x−y)2=(x+y)2−4⋅2x+y−2=(x+y)2−2x+y
This is the equation of C1.
Curve C2 (negative x,y): Here xy>0, so again xy=∣xy∣, giving xy=A⋅2x+y.
Substituting (−1,−1): 1=A⋅2−2, so A=4. Hence
xy=4⋅2x+y=2x+y+2
(x−y)2=(x+y)2−4⋅2x+y+2=(x+y)2−2x+y+4
This is the equation of C2.
Symmetry: In both cases the equation involves only (x−y)2 and (x+y)2, both of which are invariant under the swap (x,y)↦(y,x). Therefore y=x is a line of symmetry for each curve.
Part (ii)
The curves y=x2 and y=2x (for x⩾0) intersect at x=2 (both equal 4) and x=4 (both equal 16). For 2<x<4, we have x2>2x, and outside this interval 2x>x2.
For any point on C1, we have (x−y)2⩾0, so from the equation of C1:
(x+y)2−2x+y⩾0⟹(x+y)2⩾2x+y
Setting t=x+y>0, this requires t2⩾2t, which holds if and only if 2⩽t⩽4. Therefore
2⩽x+y⩽4
so C1 lies between the lines x+y=2 and x+y=4.
Sketch of C1: The curve is a closed oval, symmetric about y=x, lying entirely in the first quadrant between the two parallel lines x+y=2 and x+y=4. It passes through (1,1) (where x+y=2) and (2,2) (where x+y=4). At (1,1) the curve is tangent to x+y=2, and at (2,2) it is tangent to x+y=4.
Part (iii)
For C2 with (x−y)2=(x+y)2−2x+y+4, the condition (x−y)2⩾0 gives
(x+y)2⩾2x+y+4
Setting u=x+y<0, we need u2⩾2u+4. At u=−2: 4=4. For u<−2: u2 grows while 2u+4 shrinks, so the inequality holds. For −2<u<0: 2u+4>u2, so the inequality fails. Therefore x+y⩽−2.
From xy=2x+y+2: as x→−∞, 2x+y+2→0, so y→0−. By symmetry, as y→−∞, x→0−.
Sketch of C2: The curve is an open curve in the third quadrant, symmetric about y=x, with x+y⩽−2. It passes through (−1,−1) where it touches the boundary line x+y=−2. As x→0−, y→−∞ (and vice versa by symmetry). The curve has both axes as asymptotes.
3 A sequence u1,u2,…,un of positive real numbers is said to be unimodal if there is a value k such that
u1⩽u2⩽⋯⩽uk
and
uk⩾uk+1⩾⋯⩾un.
So the sequences 1, 2, 3, 2, 1; 1, 2, 3, 4, 5; 1, 1, 3, 3, 2 and 2, 2, 2, 2, 2 are all unimodal, but 1, 2, 1, 3, 1 is not.
A sequence u1,u2,…,un of positive real numbers is said to have property L if ur−1ur+1⩽ur2 for all r with 2⩽r⩽n−1.
(i) Show that, in any sequence of positive real numbers with property L,
ur−1⩾ur⟹ur⩾ur+1.
Prove that any sequence of positive real numbers with property L is unimodal.
(ii) A sequence u1,u2,…,un of real numbers satisfies ur=2αur−1−α2ur−2 for 3⩽r⩽n, where α is a positive real constant. Prove that, for 2⩽r⩽n,
ur−αur−1=αr−2(u2−αu1)
and, for 2⩽r⩽n−1,
ur2−ur−1ur+1=(ur−αur−1)2.
Hence show that the sequence consists of positive terms and is unimodal, provided u2>αu1>0.
In the case u1=1 and u2=2, prove by induction that ur=(2−r)αr−1+2(r−1)αr−2.
Let α=1−N1, where N is an integer with 2⩽N⩽n.
In the case u1=1 and u2=2, prove that ur is largest when r=N.
Hint
3(i) Suppose ∃k:2≤k≤n−1 such that uk−1≥uk but uk<uk+1. Since all terms are positive, uk2<uk−1uk+1, so the sequence does not have property L. Therefore, once uk−1≥uk, all subsequent terms must also decrease (unimodality).
3(ii)ur−αur−1=α(ur−1−αur−2), so ur−αur−1=αr−2(u2−αu1).
ur2−ur−1ur+1=ur2−ur−1(2αur−α2ur−1)=(ur−αur−1)2 for r≥2.
The first identity shows ur>0 for all r if u2>αu1>0. The second identity shows property L holds, hence unimodal.
3(iii) Base cases: u1=1, u2=2. Inductive step: assume for uk−2,uk−1, then uk=2αuk−1−α2uk−2=αk−1(2−k)+2αk−2(k−1).
When r=N: uN−uN+1=N2αN−2(N−1)>0. When r=N−1: uN−1−uN=N2−2αN−3<0. So ur is largest when r=N.
Model Solution
Part (i)
We are given that a sequence of positive real numbers has property L: ur−1ur+1⩽ur2 for all 2⩽r⩽n−1.
We want to show ur−1⩾ur⟹ur⩾ur+1.
Suppose ur−1⩾ur>0. From property L:
ur−1ur+1⩽ur2
Since ur−1>0, we can divide both sides:
ur+1⩽ur−1ur2
Since ur−1⩾ur>0, we have ur−11⩽ur1, so:
ur+1⩽ur−1ur2⩽urur2=ur
Therefore ur⩾ur+1, as required.
Now we prove any sequence with property L is unimodal. Consider two cases:
Case 1:u1⩽u2⩽⋯⩽un (the sequence is non-decreasing). Then k=n satisfies the definition.
Case 2: The sequence is not non-decreasing. Then there exists a smallest index k such that uk<uk+1 is false, i.e., uk⩾uk+1. By the minimality of k, we have u1⩽u2⩽⋯⩽uk.
By the result above, uk⩾uk+1⟹uk+1⩾uk+2, and applying this repeatedly gives uk⩾uk+1⩾⋯⩾un.
Therefore the sequence is unimodal.
Part (ii)
First identity. Define vr=ur−αur−1 for r⩾2. From the recurrence ur=2αur−1−α2ur−2:
4 (i) Given that a,b and c are the lengths of the sides of a triangle, explain why c<a+b, a<b+c and b<a+c.
(ii) Use a diagram to show that the converse of the result in part (i) also holds: if a,b and c are positive numbers such that c<a+b,a<b+c and b<c+a then it is possible to construct a triangle with sides of length a,b and c.
(iii) When a,b and c are the lengths of the sides of a triangle, determine in each case whether the following sets of three lengths can
always
sometimes but not always
never
form the sides of a triangle. Prove your claims.
(A)a+1,b+1,c+1.
(B)ba,cb,ac.
(C)∣a−b∣,∣b−c∣,∣c−a∣.
(D)a2+bc,b2+ca,c2+ab.
(iv) Let f be a function defined on the positive real numbers and such that, whenever x>y>0,
f(x)>f(y)>0 but xf(x)<yf(y).
Show that, whenever a,b and c are the lengths of the sides of a triangle, then f(a),f(b) and f(c) can also be the lengths of the sides of a triangle.
Hint
4(i) The straight line distance between two points must be less than the length of any other rectilinear path.
4(ii) Diagram: two circles with radii a, b and line of length c. Either the straight line is the longest, or one circle cannot be contained inside the other. The circles must meet.
4(iii)(A) If a+b>c then (a+1)+(b+1)>c+2>c+1et cycl., so always. (B)a=b=c=1 gives 1,1,1 (works); a=1,b=c=2 gives 21,1,2 (fails). Sometimes but not always. (C) If p≥q≥r then ∣p−q∣+∣q−r∣=p−r=∣p−r∣, so never. (D)(a−b)2+c(a+b)+2ab>c2+abet cycl., so always.
4(iv) Since a+b>a,b: af(a)>a+bf(a+b) and bf(b)>a+bf(a+b). Since c<a+b, f(c)<f(a+b). Thus f(a)+f(b)>f(a+b)>f(c)et cycl.
Model Solution
Part (i)
If a,b,c are the side lengths of a triangle, then the triangle inequality states that the length of any one side is strictly less than the sum of the other two. Geometrically, the straight-line distance between two vertices is shorter than any path that goes through the third vertex (since a straight line is the shortest path between two points). Therefore c<a+b, a<b+c, and b<a+c.
Part (ii)
Suppose a,b,c>0 satisfy c<a+b, a<b+c, and b<c+a.
Without loss of generality, assume c is the largest of the three values. Then c<a+b ensures that the longest length is strictly less than the sum of the other two.
Draw a line segment AB of length c. With centre A, draw a circle of radius b. With centre B, draw a circle of radius a.
Since c<a+b, neither circle is contained inside the other: circle A extends to distance b from A, and circle B extends to distance a from B; since b+a>c, each circle reaches past the centre of the other.
Since c>∣a−b∣ (which follows from c+min(a,b)>max(a,b), true because c>0 and the triangle inequalities hold), the circles are not disjoint.
Therefore the two circles must intersect. Let C be a point of intersection. Then AC=b and BC=a, so triangle ABC has side lengths a, b, c.
Part (iii)
(A) a+1,b+1,c+1: Always form a triangle.
We need to show (a+1)+(b+1)>c+1 (and cyclically). Since a+b>c:
(a+1)+(b+1)=a+b+2>c+2>c+1
The cyclic inequalities follow identically. Therefore a+1, b+1, c+1 always form a triangle.
(B) ba,cb,ac: Sometimes but not always form a triangle.
Example where they do:a=b=c=1. Then ba=cb=ac=1, and 1+1>1. They form an equilateral triangle.
Example where they do not:a=1,b=2,c=2. The three values are 21,1,2. Then 21+1=23<2, so the triangle inequality fails.
Therefore ba,cb,ac can sometimes, but not always, form the sides of a triangle.
(C) ∣a−b∣,∣b−c∣,∣c−a∣: Never form a triangle.
Let p=max(a,b,c), r=min(a,b,c), and let q be the remaining value, so p⩾q⩾r.
Then the three lengths are:
∣p−q∣=p−q,∣q−r∣=q−r,∣p−r∣=p−r
Now:
∣p−q∣+∣q−r∣=(p−q)+(q−r)=p−r=∣p−r∣
So two of the three lengths sum to exactly the third. The triangle inequality requires strict inequality, so these three lengths can never form a triangle.
(D) a2+bc,b2+ca,c2+ab: Always form a triangle.
We must show (a2+bc)+(b2+ca)>c2+ab (and cyclically).
(a2+bc)+(b2+ca)−(c2+ab)=a2+b2−c2+bc+ca−ab
=a2+b2−2ab+c(a+b)−c2=(a−b)2+c[(a+b)−c]
Since a+b>c and (a−b)2⩾0:
(a−b)2+c(a+b−c)>0
By the same argument applied cyclically (with a,b,c permuted), all three triangle inequalities hold. Therefore a2+bc,b2+ca,c2+ab always form a triangle.
Part (iv)
We are given that f is defined on positive reals, and whenever x>y>0:
f(x)>f(y)>0 (so f is strictly increasing and positive), and
xf(x)<yf(y) (so xf(x) is strictly decreasing).
Let a,b,c be the side lengths of a triangle, so a+b>c (and cyclically). We want to show f(a)+f(b)>f(c).
Since a+b>a and a+b>b, the decreasing property of xf(x) gives:
By the same argument applied cyclically to the other two triangle inequalities, we obtain f(b)+f(c)>f(a) and f(c)+f(a)>f(b). Therefore f(a),f(b),f(c) can form the sides of a triangle.
5 If x is a positive integer, the value of the function d(x) is the sum of the digits of x in base 10. For example, d(249)=2+4+9=15.
An n-digit positive integer x is written in the form ∑r=0n−1ar×10r, where 0⩽ar⩽9 for all 0⩽r⩽n−1 and an−1>0.
(i) Prove that x−d(x) is non-negative and divisible by 9.
(ii) Prove that x−44d(x) is a multiple of 9 if and only if x is a multiple of 9.
Suppose that x=44d(x). Show that if x has n digits, then x⩽396n and x⩾10n−1, and hence that n⩽4.
Find a value of x for which x=44d(x). Show that there are no further values of x satisfying this equation.
(iii) Find a value of x for which x=107d(d(x)). Show that there are no further values of x satisfying this equation.
Hint
5(i)x−d(x)=∑r=0n−1ar(10r−1). Since 10r≥1 for all r, this is non-negative. Since 9∣(10r−1) for all r, it is divisible by 9.
5(ii)x−44d(x)=44(x−d(x))−43x. It is a multiple of 9 iff 43x is. Since gcd(43,9)=1, iff x is a multiple of 9.
If x has n digits, d(x)≤9n, so x=44d(x)≤396n. Also x≥10n−1. These cannot hold for n≥5 (396×5<104), so n≤4.
Since x=44d(x)=0(mod9), x is a multiple of 9. Also 44∣x. Since gcd(9,44)=1, 396∣x, so x=396k with k≤4. Checking: only k=2 works (x=792).
5(iii)x−107d(d(x))=107(x−d(x))+107(d(x)−d(d(x)))−106x. Both (x−d(x)) and (d(x)−d(d(x))) are divisible by 9, so x is divisible by 9. Also 107∣x, so 963∣x. Then x≤963n and x≥10n−1 gives n≤4, k≤4. Checking: only k=1 works (x=963).
Model Solution
Part (i)
Write x=r=0∑n−1ar×10r where 0⩽ar⩽9 for all r and an−1>0. Then d(x)=r=0∑n−1ar.
Since 10r⩾1 for all r⩾0, and ar⩾0, every term in the sum is non-negative, so x−d(x)⩾0.
Also, 10r−1=r digits99…9 is divisible by 9 for every r⩾0. Therefore 9∣ar(10r−1) for each r, and so 9∣(x−d(x)).
(Q5(i))
Part (ii)
We write:
x−44d(x)=x−d(x)−43d(x)=[x−d(x)]−43d(x)
Hmm, a cleaner decomposition. Alternatively:
x−44d(x)=[x−d(x)]−43d(x)
Wait, let us use the hint’s approach:
x−44d(x)=44[x−d(x)]−43x
From part (i), 9∣(x−d(x)), so 9∣44(x−d(x)). Therefore:
9∣[x−44d(x)]⟺9∣43x
Since gcd(43,9)=1, we have 9∣43x⟺9∣x. Therefore x−44d(x) is a multiple of 9 if and only if x is a multiple of 9.
Now suppose x=44d(x).
Upper bound. If x has n digits, then d(x)⩽9n (since each digit is at most 9), so:
x=44d(x)⩽44×9n=396n
Lower bound. Any n-digit positive integer satisfies x⩾10n−1.
Combining:10n−1⩽396n. Checking:
n=4: 103=1000⩽396×4=1584. Holds.
n=5: 104=10000>396×5=1980. Fails.
For n⩾5, 10n−1 grows much faster than 396n, so the inequality fails for all n⩾5. Hence n⩽4.
Finding x. Since x=44d(x)=0, and 9∣0, we know 9∣x from the result above. Also x=44d(x) means 44∣x. Since gcd(9,44)=1, we get 396∣x. So x=396k for some positive integer k, and since x⩽396×4=1584, we have k⩽4.
Checking each:
k
x=396k
d(x)
44d(x)
Match?
1
396
18
792
No
2
792
18
792
Yes
3
1188
18
792
No
4
1584
18
792
No
The only solution is x=792.
We have shown n⩽4, and among the multiples of 396 in the range [1,1584], only x=792 satisfies the equation. Therefore there are no further solutions.
(Q5(ii))
Part (iii)
Claim:x=963 satisfies x=107d(d(x)).
Check: d(963)=9+6+3=18, then d(18)=1+8=9, and 107×9=963.
Uniqueness. Suppose x=107d(d(x)). We show x must be 963.
First, x−107d(d(x))=0, so:
x−107d(d(x))=107[x−d(x)]+107[d(x)−d(d(x))]−106x
From part (i), 9∣(x−d(x)) and 9∣(d(x)−d(d(x))) (applying part (i) with d(x) in place of x). Therefore 9∣106x. Since gcd(106,9)=gcd(106,9)=1 (as 106=11×9+7), we get 9∣x.
Since x=107d(d(x)), we also have 107∣x. Since gcd(9,107)=1 (107 is prime and not 3), we get 963∣x.
Bounding the number of digits. If x has n digits, then d(x)⩽9n, and applying part (i) to d(x): d(d(x))⩽d(x)⩽9n. So:
x=107d(d(x))⩽107×9n=963n
Also x⩾10n−1. Since 104=10000>963×4=3852, the inequality 10n−1⩽963n fails for n⩾5, so n⩽4. This gives x⩽963×4=3852, and since 963∣x, the candidates are x=963k with k=1,2,3,4.
6 A 2×2 matrix M is real if it can be written as M=(acbd), where a,b,c and d are real. In this case, the trace of matrix M is defined to be tr(M)=a+d and det(M) is the determinant of matrix M. In this question, M is a real 2×2 matrix.
(i) Prove that
tr(M2)=tr(M)2−2det(M).
(ii) Prove that
M2=I but M=±I⟺tr(M)=0 and det(M)=−1,
and that
M2=−I⟺tr(M)=0 and det(M)=1.
(iii) Use part (ii) to prove that
M4=I⟺M2=±I.
Find a necessary and sufficient condition on det(M) and tr(M) so that M4=−I.
(iv) Give an example of a matrix M for which M8=I, but which does not represent a rotation or reflection. [Note that the matrices ±I are both rotations.]
Hint
6(i) Let M=(acbd); then M2=(a2+bcc(a+d)b(a+d)d2+bc), so tr(M2)=a2+d2+2bc=(a+d)2−2(ad−bc).
6(ii)M2=(aτ−δcτbτdτ−δ) where τ=tr(M), δ=det(M). Thus M2=±I⇔τ=0 and δ=∓1, or b=c=0 and a2=d2=±1. If b=c=0 and a=d=±1, then M=±I. If b=c=0 and a=−d=±1, then τ=0 and δ=−1. So M2=I⇔τ=0,δ=−1; M2=−I⇔τ=0,δ=+1.
6(iii) Part (ii) implies det(M2)=−1 if M4=I but M2=±I. But det(M2)=det(M)2≥0, so impossible. Clearly M2=±I⇒M4=I. For M4=−I: need tr(M2)=0 and det(M2)=1, so tr(M)2=2det(M) and det(M)=±1, giving tr(M)=±2 and det(M)=1.
6(iv) Any example satisfying conditions for M2=I, M2=−I, or M4=−I, which is not a rotation or reflection.
Every 2×2 matrix satisfies its own characteristic equation (Cayley—Hamilton):
M2−tr(M)M+det(M)I=0⟹M2=tr(M)M−det(M)I
First statement:M2=I but M=±I⟺tr(M)=0 and det(M)=−1.
(⇒) Suppose M2=I and M=±I. From Cayley—Hamilton:
I=tr(M)M−det(M)I⟹tr(M)M=(1+det(M))I
If tr(M)=0, then M=tr(M)1+det(M)I=λI for some scalar λ. Then M2=λ2I=I forces λ=±1, giving M=±I, contradicting our assumption.
Therefore tr(M)=0. Substituting into the trace identity from part (i):
tr(M2)=tr(I)=2=0−2det(M)⟹det(M)=−1
(⇐) Suppose tr(M)=0 and det(M)=−1. From Cayley—Hamilton:
M2=0⋅M−(−1)I=I
We verify M=±I: if M=±I, then tr(M)=±2=0, a contradiction.
Second statement:M2=−I⟺tr(M)=0 and det(M)=1.
(⇒) Suppose M2=−I. From Cayley—Hamilton:
−I=tr(M)M−det(M)I⟹tr(M)M=(det(M)−1)I
If tr(M)=0, then M=λI and M2=λ2I=−I requires λ2=−1, which has no real solution. Contradiction.
Therefore tr(M)=0. Then:
tr(M2)=tr(−I)=−2=0−2det(M)⟹det(M)=1
(⇐) Suppose tr(M)=0 and det(M)=1. From Cayley—Hamilton:
M2=0⋅M−1⋅I=−I
(Q6(ii))
Part (iii)
Claim:M4=I⟺M2=±I.
(⇐) If M2=I, then M4=I2=I. If M2=−I, then M4=(−I)2=I.
(⇒) Suppose M4=I, so (M2)2=I. Applying part (ii) to the matrix N=M2: either N=±I (which means M2=±I, and we are done), or tr(N)=0 and det(N)=−1.
But det(M2)=det(M)2⩾0 for any real matrix M. So det(M2)=−1 is impossible.
Therefore M2=±I.
Condition for M4=−I.
By part (ii) applied to N=M2:
M4=−I⟺tr(M2)=0 and det(M2)=1
From part (i): tr(M2)=tr(M)2−2det(M).
Also: det(M2)=det(M)2.
So the conditions are:
tr(M)2−2det(M)=0anddet(M)2=1
From det(M)2=1: det(M)=±1.
If det(M)=−1: tr(M)2=−2, which has no real solution.
If det(M)=1: tr(M)2=2, so tr(M)=±2.
Therefore:
M4=−I⟺det(M)=1 and tr(M)=±2
(Q6(iii))
Part (iv)
We need a real 2×2 matrix M with M8=I that is neither a rotation nor a reflection.
Take:
M=(102−1)
Verification that M8=I: We have tr(M)=0 and det(M)=−1. By part (ii), M2=I, so M8=(M2)4=I4=I.
Verification that M is not a rotation: A rotation matrix has determinant +1. Since det(M)=−1, M is not a rotation.
Verification that M is not a reflection: A reflection about a line through the origin is a symmetric matrix (it has the form I−2nnT). Since M is not symmetric (b=2=0=c), M is not a reflection.
(i) Let z be the complex number 3+ti, where t∈R. Show that ∣w−1∣ is independent of t. Hence show that, if z is a complex number on the line Re(z)=3 in the Argand diagram, then w lies on a circle in the Argand diagram with centre 1.
Let V be the line Re(z)=p, where p is a real constant not equal to 2. Show that, if z lies on V, then w lies on a circle whose centre and radius you should give in terms of p. For which z on V is Im(w)>0?
(ii) Let H be the line Im(z)=q, where q is a non-zero real constant. Show that, if z lies on H, then w lies on a circle whose centre and radius you should give in terms of q. For which z on H is Re(w)>0?
Hint
7(i) ∣w−1∣2=1+ti1−ti2=(1+ti)(1−ti)(1−ti)(1+ti)=1, which is independent of t.
Points on the line Re(z)=3 have the form z=3+ti and the points satisfying ∣w−1∣=1 lie on a circle with centre 1.
so the circle has centre −q1iA1 and radius c2=∣q∣1A1.
w=(t−2)+qi2=(t−2)2+q22(t−2)−2qi,
so Re(w)>0 when t>2; that is, for those z on H with real part greater than 2.
Model Solution
Part (i)
Let z=3+ti where t∈R. Then
w=z−22=(3+ti)−22=1+ti2
We compute w−1:
w−1=1+ti2−1=1+ti2−(1+ti)=1+ti1−ti
Taking the modulus:
∣w−1∣=∣1+ti∣∣1−ti∣=1+t21+t2=1
This is independent of t, as required.
Since z=3+ti parametrises all points on the line Re(z)=3 as t ranges over R, and ∣w−1∣=1 for every such z, the image of this line under w=z−22 is the circle with centre 1 and radius 1 in the Argand diagram.
General line V: Re(z)=p, p=2.
Let z=p+ti with t∈R. Then
w=(p−2)+ti2=(p−2)2+t22[(p−2)−ti]
So
Re(w)=(p−2)2+t22(p−2),Im(w)=(p−2)2+t2−2t
We seek a real constant c such that ∣w−c∣2 is independent of t. We have
∣w−c∣2=((p−2)2+t22(p−2)−c)2+[(p−2)2+t2]24t2
Writing this over a common denominator:
∣w−c∣2=[(p−2)2+t2]2[2(p−2)−c(p−2)2−ct2]2+4t2
Expanding the numerator, the coefficient of t2 is −2c[2(p−2)−c(p−2)2]+4 and the coefficient of t4 is c2. For this to equal some constant K times [(p−2)2+t2]2, we need the numerator to have the form K[(p−2)4+2(p−2)2t2+t4]. Matching the t4 coefficient: c2=K. Matching the constant term: [2(p−2)−c(p−2)2]2=K(p−2)4=c2(p−2)4.
Taking the positive square root (for the numerator to factor correctly): 2(p−2)−c(p−2)2=c(p−2)2, giving 2(p−2)=2c(p−2)2, so c=p−21.
With c=p−21, we verify: 2(p−2)−c(p−2)2=2(p−2)−(p−2)=p−2, and c2(p−2)4=(p−2)2. Indeed (p−2)2=(p−2)2.
The numerator simplifies to (p−2)2+(p−2)2t4+(p−2)22(p−2)2⋅t2=(p−2)2(p−2)4+2(p−2)2t2+t4=(p−2)2[(p−2)2+t2]2
Therefore
∣w−c∣2=(p−2)21⟹∣w−c∣=∣p−2∣1
The image of the line Re(z)=p is the circle with centre p−21 and radius ∣p−2∣1.
Which z on V give Im(w)>0?
From above, Im(w)=(p−2)2+t2−2t, which is positive if and only if t<0. So Im(w)>0 for those points z=p+ti on V with Im(z)<0.
Part (ii)
Let z=t+qi with t∈R and q=0. Then
w=(t−2)+qi2=(t−2)2+q22[(t−2)−qi]
So
Re(w)=(t−2)2+q22(t−2),Im(w)=(t−2)2+q2−2q
We seek a real constant c such that ∣w−ci∣2 is independent of t. We have
∣w−ci∣2=[(t−2)2+q2]24(t−2)2+((t−2)2+q2−2q−c)2
=[(t−2)2+q2]24(t−2)2+[−2q−c(t−2)2−cq2]2
Expanding the second term in the numerator: [(−2q−cq2)−c(t−2)2]2. For the numerator to be a constant multiple of [(t−2)2+q2]2, we need the (t−2)2 cross-term to produce 2q2 when combined with the 4(t−2)2 term.
8 In this question, f(x) is a quartic polynomial where the coefficient of x4 is equal to 1, and which has four real roots, 0, a, b and c, where 0<a<b<c.
F(x) is defined by F(x)=∫0xf(t)dt.
The area enclosed by the curve y=f(x) and the x-axis between 0 and a is equal to that between b and c, and half that between a and b.
(i) Sketch the curve y=F(x), showing the x co-ordinates of its turning points.
Explain why F(x) must have the form F(x)=51x2(x−c)2(x−h), where 0<h<c.
Find, in factorised form, an expression for F(x)+F(c−x) in terms of c, h and x.
(ii) If 0⩽x⩽c, explain why F(b)+F(x)⩾0 and why F(b)+F(x)>0 if x=a. Hence show that c−b=a or c>2h.
By considering also F(a)+F(x), show that c=a+b and that c=2h.
(iii) Find an expression for f(x) in terms of c and x only.
Show that the points of inflection on y=f(x) lie on the x-axis.
Hint
8(i)
Graph: Zeroes at x=0,c and one other point (h: label not required) in (a,b).
Graph: Turning points at x=0,a,b,c.
Graph: Quintic shape with curve below axis in (0,h) and above axis in (h,c)
The area conditions give F(0)=F(c)=0.
F′(x)=f(x), so F′(0)=F′(a)=F′(b)=F′(c)=0
Since f is a quartic and the coefficient of x4 is 1,
F must be a quintic and the coefficient of x5 is 51.
F(0)=F′(0)=0 and F(c)=F′(c)=0, so F must have double roots at x=0 and c.
So F(x) must have the given form.
[Explanation must be clear that the double roots are deduced from the fact that F(x)=F′(x)=0 at those points.]
Let A be the (positive) area enclosed by the curve between 0 and a.
The maximum turning point of F(x) occurs at x=b, with F(b)=A.
The minimum turning point of F(x) occurs at x=a, with F(a)=−A.
Therefore F(x)≥−A, with equality iff x=a.
So F(b)+F(x)≥0, with equality iff x=a.
F(a)+F(x)≤0, with equality iff x=b.
Since F(b)+F(c−b)=51b2(c−b)2(c−2h),
either c>2h, or c=2h and c−b=a.
Also, F(a)+F(c−a)=51a2(c−a)2(c−2h), so
either c<2h, or c=2h and c−a=b.
Thus c=a+b and c=2h.
8(iii)
F(x)=101x2(x−c)2(2x−c)
So f(x)=51x(x−c)(5x2−5xc+c2)
The roots of the quadratic factor must be a and b.
Therefore f′′(x)=0 at x=a and x=b and so (a,0) and (b,0) are points of inflection.
Model Solution
Part (i)
Sketch of y=F(x):
The quartic f(x) has leading coefficient 1 and roots 0,a,b,c with 0<a<b<c, so
f(x)=x(x−a)(x−b)(x−c)
Since f is positive for x<0 (four negative factors), negative on (0,a), positive on (a,b), negative on (b,c), and positive for x>c.
F(x)=∫0xf(t)dt, so F(0)=0 and F′(x)=f(x). The turning points of F are at x=0,a,b,c (where f=0).
Let A denote the positive area enclosed between y=f(x) and the x-axis on [0,a]. The area conditions state:
Area on [0,a] = Area on [b,c]
Area on [0,a] = 21 Area on [a,b]
Since f<0 on (0,a): F(a)=∫0af(t)dt=−A.
Since f>0 on (a,b): F(b)=F(a)+∫abf(t)dt=−A+2A=A.
Since f<0 on (b,c): F(c)=F(b)+∫bcf(t)dt=A−A=0.
So F has a minimum at x=a with value −A, a maximum at x=b with value A, and F(0)=F(c)=0. The curve dips below the axis on (0,h) and rises above on (h,c), where h is the unique zero of F in (0,c) (with a<h<b).
Why F(x)=51x2(x−c)2(x−h):
F is the integral of a quartic with leading coefficient 1, so F is a quintic with leading coefficient 51.
At x=0: F(0)=0 and F′(0)=f(0)=0, so F has a double root at x=0.
At x=c: F(c)=0 and F′(c)=f(c)=0, so F has a double root at x=c.
Since F is a quintic with leading coefficient 51 and double roots at 0 and c, it must have the form
F(x)=51x2(x−c)2(x−h)
for some constant h. The remaining root is x=h. Since F(a)=−A<0 and F(b)=A>0, by the intermediate value theorem F has a zero between a and b, so a<h<b, and in particular 0<h<c.
We established that F(x)⩾−A for all x∈[0,c], with F(x)=−A if and only if x=a (the unique global minimum of F on [0,c]). Since F(b)=A:
F(b)+F(x)=A+F(x)⩾A+(−A)=0
with equality if and only if x=a. So F(b)+F(x)>0 for x=a.
Showing c−b=a or c>2h:
Evaluate the identity from part (i) at x=b:
F(b)+F(c−b)=51b2(c−b)2(c−2h)
Since b∈(0,c), we have c−b∈(0,c), so F(b)+F(c−b)⩾0.
The left side is ⩾0, and b2(c−b)2>0, so c−2h⩾0, i.e., c⩾2h.
If c>2h: this is one of the two alternatives. If c=2h: then F(b)+F(c−b)=0, which requires c−b=a (the only point where equality holds). So either c>2h, or c=2h and c−b=a.
Considering F(a)+F(x):
Similarly, F(x)⩽A for all x∈[0,c], with F(x)=A if and only if x=b. Since F(a)=−A:
F(a)+F(x)=−A+F(x)⩽0
with equality if and only if x=b.
Evaluate the identity at x=a:
F(a)+F(c−a)=51a2(c−a)2(c−2h)
Since a∈(0,c), we have c−a∈(0,c), so F(a)+F(c−a)⩽0.
Since a2(c−a)2>0, we need c−2h⩽0, i.e., c⩽2h.
Combining both results:
From the F(b)+F(x) analysis: c⩾2h.
From the F(a)+F(x) analysis: c⩽2h.
Therefore c=2h.
When c=2h, the identity F(x)+F(c−x)=0 for all x. In particular:
From F(b)+F(c−b)=0: since equality requires c−b=a, we get c=a+b.
From F(a)+F(c−a)=0: since equality requires c−a=b, we again get c=a+b.
Therefore c=a+b and c=2h.
Part (iii)
Expression for f(x) in terms of c and x:
With h=2c (from c=2h):
F(x)=51x2(x−c)2(x−2c)=101x2(x−c)2(2x−c)
Differentiating:
f(x)=F′(x)=101dxd[x2(x−c)2(2x−c)]
Using the product rule with u=x2(x−c)2 and v=2x−c:
The points of inflection of f occur where f′′(x)=0. First compute f′(x):
f(x)=51(5x4−10cx3+6c2x2−c3x)
f′(x)=51(20x3−30cx2+12c2x−c3)
f′′(x)=51(60x2−60cx+12c2)=512(5x2−5cx+c2)
Setting f′′(x)=0:
5x2−5cx+c2=0
x=105c±25c2−20c2=105c±c5=10c(5±5)
But the quadratic 5x2−5cx+c2 is exactly the same factor appearing in f(x)=51x(x−c)(5x2−5cx+c2). Therefore f′′(x)=0 precisely when 5x2−5cx+c2=0, which means at those values of x, the factor 5x2−5cx+c2=0, so
f(x)=51x(x−c)⋅0=0
The roots a=10c(5−5) and b=10c(5+5) satisfy 0<a<c and 0<b<c (since 5≈2.236, we get a≈0.276c and b≈0.724c), confirming they are the roots of f in (0,c).
Therefore the points of inflection occur at x=a and x=b, and at both points f(a)=f(b)=0. The points of inflection (a,0) and (b,0) lie on the x-axis.