CAIE FP1 2002 November — Question 1 5 marks

Exam BoardCAIE
ModuleFP1 (Further Pure Mathematics 1)
Year2002
SessionNovember
Marks5
PaperDownload PDF ↗
TopicSequences and series, recurrence and convergence
TypeMethod of differences with exponential terms
DifficultyStandard +0.3 This is a straightforward telescoping series question where the exponential terms cancel systematically. The first part requires recognizing the telescoping pattern (standard FP1 technique), and the second part involves basic convergence analysis using limits of exponential functions. While it's a Further Maths topic, the execution is mechanical with no novel insight required.
Spec1.04j Sum to infinity: convergent geometric series |r|<14.06b Method of differences: telescoping series8.01d Sequence limits: limit of nth term as n tends to infinity, steady-states

1 Given that $$u _ { n } = \mathrm { e } ^ { n x } - \mathrm { e } ^ { ( n + 1 ) x }$$ find \(\sum _ { n = 1 } ^ { N } \| _ { n }\) in terms of \(N\) and \(x\). Hence determine the set of values of \(x\) for which the infinite series $$u _ { 1 } + u _ { 2 } + u _ { 3 } + \ldots$$ is convergent and give the sum to infinity for cases where this exists.

1 Given that

$$u _ { n } = \mathrm { e } ^ { n x } - \mathrm { e } ^ { ( n + 1 ) x }$$

find $\sum _ { n = 1 } ^ { N } \| _ { n }$ in terms of $N$ and $x$.

Hence determine the set of values of $x$ for which the infinite series

$$u _ { 1 } + u _ { 2 } + u _ { 3 } + \ldots$$

is convergent and give the sum to infinity for cases where this exists.

\hfill \mbox{\textit{CAIE FP1 2002 Q1 [5]}}