Date | May 2021 | Marks available | 4 | Reference code | 21M.3.AHL.TZ2.2 |
Level | Additional Higher Level | Paper | Paper 3 | Time zone | Time zone 2 |
Command term | Prove and Hence or otherwise | Question number | 2 | Adapted from | N/A |
Question
This question asks you to investigate and prove a geometric property involving the roots of the equation zn=1 where z∈ℂ for integers n, where n≥2.
The roots of the equation zn=1 where z∈ℂ are 1, ω, ω2, …, ωn-1, where ω=e2πin. Each root can be represented by a point P0, P1, P2, …, Pn-1, respectively, on an Argand diagram.
For example, the roots of the equation z2=1 where z∈ℂ are 1 and ω. On an Argand diagram, the root 1 can be represented by a point P0 and the root ω can be represented by a point P1.
Consider the case where n=3.
The roots of the equation z3=1 where z∈ℂ are 1, ω and ω2. On the following Argand diagram, the points P0, P1 and P2 lie on a circle of radius 1 unit with centre O(0, 0).
Line segments [P0P1] and [P0P2] are added to the Argand diagram in part (a) and are shown on the following Argand diagram.
P0P1is the length of [P0P1] and P0P2 is the length of [P0P2].
Consider the case where n=4.
The roots of the equation z4=1 where z∈ℂ are 1, ω, ω2 and ω3.
On the following Argand diagram, the points P0, P1, P2 and P3 lie on a circle of radius 1 unit with centre O(0, 0). [P0P1], [P0P2] and [P0P3] are line segments.
For the case where n=5, the equation z5=1 where z∈ℂ has roots 1, ω, ω2, ω3 and ω4.
It can be shown that P0P1×P0P2×P0P3×P0P4=5.
Now consider the general case for integer values of n, where n≥2.
The roots of the equation zn=1 where z∈ℂ are 1, ω, ω2, …, ωn-1. On an Argand diagram, these roots can be represented by the points P0, P1, P2, …, Pn-1 respectively where [P0P1], [P0P2], …, [P0Pn-1] are line segments. The roots lie on a circle of radius 1 unit with centre O(0, 0).
P0P1 can be expressed as |1-ω|.
Consider zn-1=(z-1)(zn-1+zn-2+ … +z+1) where z∈ℂ.
Show that (ω-1)(ω2+ω+1)=ω3-1.
Hence, deduce that ω2+ω+1=0.
Show that P0P1×P0P2=3.
By factorizing z4-1, or otherwise, deduce that ω3+ω2+ω+1=0.
Show that P0P1×P0P2×P0P3=4.
Suggest a value for P0P1×P0P2× … ×P0Pn-1.
Write down expressions for P0P2 and P0P3 in terms of ω.
Hence, write down an expression for P0Pn-1 in terms of n and ω.
Express zn-1+ zn-2+ … +z+1 as a product of linear factors over the set ℂ.
Hence, using the part (g)(i) and part (f) results, or otherwise, prove your suggested result to part (e).
Markscheme
METHOD 1
attempts to expand (ω-1)(ω2+ω+1) (M1)
=ω3+ω2+ω-ω2-ω-1 A1
=ω3-1 AG
METHOD 2
attempts polynomial division on ω3-1ω-1 M1
=ω2+ω+1 A1
so (ω-1)(ω2+ω+1)=ω3-1 AG
Note: In part (a), award marks as appropriate where ω has been converted into Cartesian, modulus-argument (polar) or Euler form.
[2 marks]
(since ω is a root of z3=1)⇒ω3-1=0 R1
and ω≠1 R1
⇒ω2+ω+1=0 AG
Note: In part (a), award marks as appropriate where ω has been converted into Cartesian, modulus-argument (polar) or Euler form.
[2 marks]
METHOD 1
attempts to find either P0P1 or P0P2 (M1)
accept any valid method
e.g. 2 from either or
e.g. use of Pythagoras’ theorem
e.g. by calculating the distance between points
A1
A1
Note: Award a maximum of M1A1A0 for any decimal approximation seen in the calculation of either or or both.
so AG
METHOD 2
attempts to find (M1)
A1
and since R1
so AG
[3 marks]
METHOD 1
A1
( is a root hence) and R1
AG
Note: Condone the use of throughout.
METHOD 2
considers the sum of roots of (M1)
the sum of roots is zero (there is no term) A1
AG
METHOD 3
substitutes for (M1)
e.g.
A1
Note: This can be demonstrated geometrically or by using vectors. Accept Cartesian or modulus-argument (polar) form.
AG
METHOD 4
A1
as R1
AG
[2 marks]
METHOD 1
A1
attempts to find either or (M1)
Note: For example and .
Various geometric and trigonometric approaches can be used by candidates.
A1A1
Note: Award a maximum of A1M1A1A0 if labels such as are not clearly shown.
Award full marks if the lengths are shown on a clearly labelled diagram.
Award a maximum of A1M1A1A0 for any decimal approximation seen in the calculation of either or or both.
AG
METHOD 2
attempts to find M1
A1
since and A1
and since R1
so AG
METHOD 3
A1
attempts to find M1
A1
since and R1
so AG
[4 marks]
A1
[1 mark]
A1A1
[2 marks]
A1A1
Note: Accept from symmetry.
[1 mark]
considers the equation (M1)
the roots are (A1)
so A1
[3 marks]
METHOD 1
substitutes into M1
(A1)
takes modulus of both sides M1
A1
so AG
Note: Award a maximum of M1A1FTM1A0 from part (e).
METHOD 2
are the roots of M1
coefficient of is and the coefficient of is A1
product of the roots is A1
A1
so AG
[4 marks]