Porisma

Original question & working

Shift an affine recurrence into a GP · source reference

[2011/TJC/Prelim/II/1)] · Question pp. 1 · Working pp. 3, 4

Open the interactive lesson

The working and teaching notes are included in the interactive lesson.

View source review notes
Full original question, working & notes

Printed question

The nnth term of a sequence is denoted by ana_n. The sequence is defined by

an+1=pan+q(n≥1),a_{n+1}=pa_n+q\quad(n\ge1),

where p,qp,q are constants. The first three terms are a1=0,a2=2,a3=7a_1=0,a_2=2,a_3=7.

(i) Find p,qp,q. [2]

(ii) Express ana_n in terms of nn, for n≥3n\ge3. [4]

Printed working

(i) a2=pa1+q⇒q=2a_2=pa_1+q\Rightarrow q=2.

a3=pa2+q⇒7=2p+2⇒p=52a_3=pa_2+q\Rightarrow7=2p+2\Rightarrow p=\frac52.

(ii) Given an+1=52an+2a_{n+1}=\frac52a_n+2,

a2=2,a3=52a2+2=52(2)+2,a4=52[52(2)+2]+2=(52)2(2)+52(2)+2,an=(52)n−2(2)+(52)n−3(2)+⋯+52(2)+2=2[1+52+(52)2+⋯+(52)n−2]=2[(5/2)n−1−1]5/2−1=43[(52)n−1−1],n≥3.\begin{aligned}a_2&=2,\\a_3&=\frac52a_2+2=\frac52(2)+2,\\a_4&=\frac52\left[\frac52(2)+2\right]+2=\left(\frac52\right)^2(2)+\frac52(2)+2,\\a_n&=\left(\frac52\right)^{n-2}(2)+\left(\frac52\right)^{n-3}(2)+\cdots+\frac52(2)+2\\&=2\left[1+\frac52+\left(\frac52\right)^2+\cdots+\left(\frac52\right)^{n-2}\right]\\&=\frac{2[(5/2)^{n-1}-1]}{5/2-1}=\frac43\left[\left(\frac52\right)^{n-1}-1\right],\quad n\ge3.\end{aligned}

Teacher notes

Observe the pattern in the series: do not simplify to numerical values. Leave (52)2(2)+52(2)+2\left(\frac52\right)^2(2)+\frac52(2)+2 instead of 252+5+2=392\frac{25}2+5+2=\frac{39}2.

The bracketed series is a GP with first term 1 and common ratio 52\frac52.

Printed answer key

(i) p=5/2,q=2p=5/2,q=2; (ii) an=43[(5/2)n−1−1]a_n=\frac43[(5/2)^{n-1}-1], n≥3n\ge3

Mathematical review and qualifications

(i) 2=p(0)+q2=p(0)+q gives q=2q=2; 7=2p+27=2p+2 gives p=5/2p=5/2.

(ii) Set bn=an+4/3b_n=a_n+4/3. Then bn+1=(5/2)bnb_{n+1}=(5/2)b_n, b1=4/3b_1=4/3. Therefore an=43[(5/2)n−1−1]a_n=\frac43[(5/2)^{n-1}-1], valid in particular for n≥3n\ge3. Substitution gives 0,2,70,2,7 as required.

Provenance

2025 TJC H2 Math (9758) JC2 MSM: RECURRENCE RELATIONS. [2011/TJC/Prelim/II/1)] Question PDF pages 1; solution PDF pages 3, 4. The original files remain private QA records outside this native content.