QCEVault

Mathematical induction and trigonometric proofs — Question 253

Original QCE Vault practice · 13 marks

Q253 · Practice questionTechnology-activeVery complex unfamiliar13 marks

QUESTION 253 (13 marks)

A game has centre c=(1,−1)\mathbf c=(1,-1) and checkpoints p0=c+(8,0)\mathbf p_0=\mathbf c+(8,0), pn+1=c+A(pn−c)\mathbf p_{n+1}=\mathbf c+A(\mathbf p_n-\mathbf c), where A=14(1−331)A=\frac14\begin{pmatrix}1&-\sqrt3\\\sqrt3&1\end{pmatrix}. A player visits the checkpoints in order along straight segments. Coordinates are in metres. You may use ∑n=0∞rn=1/(1−r)\sum_{n=0}^\infty r^n=1/(1-r) for ∣r∣<1|r|<1.
Checkpoint spiral about C=(1,-1), showing the first straight segments as solid lines, a dashed smooth spiral, and labelled early points P0, P1 and P2. Later point labels are omitted to avoid crowding.
a)
Prove by induction that An=2−n(cos⁡(nπ/3)−sin⁡(nπ/3)sin⁡(nπ/3)cos⁡(nπ/3))A^n=2^{-n}\begin{pmatrix}\cos(n\pi/3)&-\sin(n\pi/3)\\\sin(n\pi/3)&\cos(n\pi/3)\end{pmatrix} for every n≥0n\ge0.
[4 marks]
b)
Determine the exact total length of the infinitely many straight segments.
[3 marks]
c)
A smooth alternative path is z(t)=1−i+8e−(ln⁡2)tcis⁡(πt/3)z(t)=1-i+8e^{-(\ln2)t}\operatorname{cis}(\pi t/3), t≥0t\ge0. Verify that it passes through every checkpoint at the corresponding integer time and determine its speed.
[3 marks]
d)
Determine the exact length of the smooth path and compare the two lengths numerically to three decimal places.
[3 marks]
Question linkSyllabus coverage

Related questions

  1. Q178 · Original practice · 6 marks
    Consider (cos⁡θ+isin⁡θ)4(\cos\theta+i\sin\theta)^4.
    Mathematical induction and trigonometric proofs
  2. Q179 · Original practice · 6 marks
    For positive integers n, let Sn=∑k=1n(2k−1)3S_n=\sum_{k=1}^n(2k-1)^3.
    Mathematical induction and trigonometric proofs
  3. Q180 · Original practice · 6 marks
    For positive integers n, consider 8n−18^n-1.
    Mathematical induction and trigonometric proofs
  4. Q181 · Original practice · 6 marks
    A programmable light display contains k2kk2^k lights in row k, for k=1,…,nk=1,\ldots,n.
    Mathematical induction and trigonometric proofs