Recurrence relation asymptotic behaviour

A question is this type if and only if it asks to determine the asymptotic behaviour of a sequence defined by a recurrence relation as n becomes large, often finding a polynomial approximation.

3 questions · Challenging +1.3

1.04e Sequences: nth term and recurrence relations
Sort by: Default | Easiest first | Hardest first
OCR MEI Further Numerical Methods 2019 June Q3
11 marks Standard +0.3
3 In the first week of an outbreak of influenza, 9 patients were diagnosed with the virus at a medical practice in Pencaster. Records were kept of \(y\), the total number of patients diagnosed with influenza in week \(n\). The data are shown in Fig. 3. \begin{table}[h]
\(n\)12345
\(y\)9326396125
\captionsetup{labelformat=empty} \caption{Fig. 3}
\end{table}
  1. Complete the difference table in the Printed Answer Booklet.
  2. Explain why a cubic model is appropriate for the data.
  3. Use Newton's method to find the interpolating polynomial of degree 3 for these data. In both week 6 and week 7 there were 145 patients in total diagnosed with influenza at the medical practice.
  4. Determine whether the model is a good fit for these data.
  5. Determine the maximum number of weeks for which the model could possibly be valid.
Edexcel FD2 AS 2020 June Q4
8 marks Challenging +1.8
4. A sequence \(\left\{ u _ { n } \right\}\), where \(n \geqslant 1\), satisfies the recurrence relation $$2 u _ { n } = u _ { n - 1 } - k n ^ { 2 } \text { where } 4 u _ { 2 } - u _ { 0 } = 27 k ^ { 2 }$$ and \(k\) is a non-zero constant.
Show that, as \(n\) becomes large, \(u _ { n }\) can be approximated by a quadratic function of the form \(a n ^ { 2 } + b n + c\) where \(a , b\) and \(c\) are constants to be determined. Please check the examination details below before entering your candidate information
Candidate surname
Other names Pearson Edexcel
Centre Number
Candidate Number Level 3 GCE \includegraphics[max width=\textwidth, alt={}, center]{a9f21789-1c5b-42f5-9c5a-3b29d9346c46-05_122_433_356_991}



□ \section*{Thursday 14 May 2020} You may not need to use all of these tables.
\cline { 2 - 5 } \multicolumn{1}{c|}{}\(P\)\(Q\)\(R\)\(S\)
\(A\)
\(B\)
\(C\)
\(D\)
\cline { 2 - 5 } \multicolumn{1}{c|}{}\(P\)\(Q\)\(R\)\(S\)
\(A\)
\(B\)
\(C\)
\(D\)
\cline { 2 - 5 } \multicolumn{1}{c|}{}PQRS
A
B
C
D
\cline { 2 - 5 } \multicolumn{1}{c|}{}\(P\)\(Q\)\(R\)\(S\)
\(A\)
\(B\)
\(C\)
\(D\)
\cline { 2 - 5 } \multicolumn{1}{c|}{}PQRS
A
B
C
D
\cline { 2 - 5 } \multicolumn{1}{c|}{}PQRS
A
B
C
D
\cline { 2 - 5 } \multicolumn{1}{c|}{}\(P\)\(Q\)\(R\)\(S\)
\(A\)
\(B\)
\(C\)
\(D\)
\cline { 2 - 5 } \multicolumn{1}{c|}{}\(P\)\(Q\)\(R\)\(S\)
\(A\)
\(B\)
\(C\)
\(D\)
3. \begin{table}[h]
\cline { 3 - 5 } \multicolumn{2}{c|}{}Team B
\cline { 3 - 5 } \multicolumn{2}{c|}{}PaulQaasimRashid
\multirow{3}{*}{Team A}Mischa4- 62
\cline { 2 - 5 }Noel0- 26
\cline { 2 - 5 }Olive- 620
\captionsetup{labelformat=empty} \caption{Table 1}
\end{table} 4. .
Edexcel FD2 AS 2023 June Q4
8 marks Challenging +1.8
4. A sequence \(\left\{ u _ { n } \right\}\), where \(n \geqslant 0\), satisfies the recurrence relation $$u _ { n + 1 } = \frac { 3 } { 2 } u _ { n } - 2 n ^ { 2 } - 4 \quad u _ { 0 } = k$$ where \(k\) is an integer.
  1. Determine an expression for \(u _ { n }\) in terms of \(n\) and \(k\).
    (6) Given that \(u _ { 10 } > 5000\)
  2. determine the minimum possible value of \(k\).
    (2)