CAIE FP1 2009 June — Question 12 EITHER

Exam BoardCAIE
ModuleFP1 (Further Pure Mathematics 1)
Year2009
SessionJune
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicComplex numbers 2
TypeSum geometric series with complex terms
DifficultyChallenging +1.8 This is a sophisticated Further Maths question requiring multiple advanced techniques: summing a geometric series with complex terms, extracting real parts using de Moivre's theorem, and applying the result to two non-trivial special cases. While the framework is provided ('by considering...'), students must recognize how to convert between trigonometric and complex exponential forms, manipulate sec^k terms, and handle inverse trigonometric substitutions. The multi-part structure with increasing abstraction places this well above average difficulty but remains within the scope of well-prepared FM students.
Spec1.05j Trigonometric identities: tan=sin/cos and sin^2+cos^2=14.02n Euler's formula: e^(i*theta) = cos(theta) + i*sin(theta)4.02q De Moivre's theorem: multiple angle formulae4.06b Method of differences: telescoping series

By considering \(\sum _ { k = 0 } ^ { n - 1 } ( 1 + \mathrm { i } \tan \theta ) ^ { k }\), show that $$\sum _ { k = 0 } ^ { n - 1 } \cos k \theta \sec ^ { k } \theta = \cot \theta \sin n \theta \sec ^ { n } \theta$$ provided \(\theta\) is not an integer multiple of \(\frac { 1 } { 2 } \pi\). Hence or otherwise show that $$\sum _ { k = 0 } ^ { n - 1 } 2 ^ { k } \cos \left( \frac { 1 } { 3 } k \pi \right) = \frac { 2 ^ { n } } { \sqrt { 3 } } \sin \left( \frac { 1 } { 3 } n \pi \right)$$ Given that \(0 < x < 1\), show that $$\sum _ { k = 0 } ^ { n - 1 } \frac { \cos \left( k \cos ^ { - 1 } x \right) } { x ^ { k } } = \frac { \sin \left( n \cos ^ { - 1 } x \right) } { x ^ { n - 1 } \sqrt { } \left( 1 - x ^ { 2 } \right) }$$

By considering $\sum _ { k = 0 } ^ { n - 1 } ( 1 + \mathrm { i } \tan \theta ) ^ { k }$, show that

$$\sum _ { k = 0 } ^ { n - 1 } \cos k \theta \sec ^ { k } \theta = \cot \theta \sin n \theta \sec ^ { n } \theta$$

provided $\theta$ is not an integer multiple of $\frac { 1 } { 2 } \pi$.

Hence or otherwise show that

$$\sum _ { k = 0 } ^ { n - 1 } 2 ^ { k } \cos \left( \frac { 1 } { 3 } k \pi \right) = \frac { 2 ^ { n } } { \sqrt { 3 } } \sin \left( \frac { 1 } { 3 } n \pi \right)$$

Given that $0 < x < 1$, show that

$$\sum _ { k = 0 } ^ { n - 1 } \frac { \cos \left( k \cos ^ { - 1 } x \right) } { x ^ { k } } = \frac { \sin \left( n \cos ^ { - 1 } x \right) } { x ^ { n - 1 } \sqrt { } \left( 1 - x ^ { 2 } \right) }$$

\hfill \mbox{\textit{CAIE FP1 2009 Q12 EITHER}}