Porisma

Original question & working

A logarithmic fixed-point iteration · source reference

[2012/MI/Prelim/10] · Question pp. 2 · Working pp. 6

Open the interactive lesson

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

Finding possible limits does not prove convergence; every logarithm requires xnx_n>1.

View source review notes
Full original question, working & notes

Printed question

The diagram shows y=ln⁡(x−1)−x+4y=\ln(x-1)-x+4. Its roots are α,β\alpha,\beta, with α<β\alpha<\beta.

(i) Find α,β\alpha,\beta correct to 3 decimal places. [2]

A sequence of real numbers satisfies xn+1=ln⁡(xn−1)+4x_{n+1}=\ln(x_n-1)+4, n≥1n\ge1.

(ii) Prove algebraically that if the sequence converges, it converges to either α\alpha or β\beta. [3]

(iii) By considering the maximum point of y=ln⁡(x−1)−x+4y=\ln(x-1)-x+4, show xn+1≤xn+2x_{n+1}\le x_n+2. [3]

Printed working

(i) From GC: α=1.052,β=5.505\alpha=1.052,\beta=5.505.

(ii) If a sequence converges, as n→∞n\to\infty, xn→L,xn+1→Lx_n\to L,x_{n+1}\to L.

L=ln⁡(L−1)+4⇒ln⁡(L−1)−L+4=0.L=\ln(L-1)+4\Rightarrow\ln(L-1)-L+4=0.

Hence L=αL=\alpha or β\beta.

(iii) Maximum point: (2,2)(2,2).

xn+1−xn=ln⁡(xn−1)−xn+4.x_{n+1}-x_n=\ln(x_n-1)-x_n+4.

Since ln⁡(x−1)−x+4≤2\ln(x-1)-x+4\le2, xn+1−xn≤2x_{n+1}-x_n\le2, so xn+1≤xn+2x_{n+1}\le x_n+2.

Source diagrams redrawn

13-07

Printed answer key

(i) α=1.052,β=5.505\alpha=1.052,\beta=5.505

Mathematical review and qualifications

(i) Numerical solution on (1,2)(1,2) and (2,∞)(2,\infty) gives α=1.052\alpha=1.052, β=5.505\beta=5.505 to 3 d.p.

(ii) For a convergent real sequence defined at every step, L=1L=1 is impossible, since ln⁡(xn−1)+4\ln(x_n-1)+4 would tend to −∞-\infty. Hence L>1L>1, and continuity gives L=ln⁡(L−1)+4L=\ln(L-1)+4, so h(L)=0h(L)=0. Therefore L=αL=\alpha or β\beta.

(iii) dhdx=1/(x−1)−1\frac{dh}{dx}=1/(x-1)-1, zero only at 2; d2hdx2=−1/(x−1)2<0\frac{d^2h}{dx^2}=-1/(x-1)^2<0. The global maximum is h(2)=2h(2)=2. Thus xn+1−xn=h(xn)≤2x_{n+1}-x_n=h(x_n)\le2.

Finding possible limits does not prove convergence; every logarithm requires x_n>1.

Provenance

2025 TJC H2 Math (9758) JC2 MSM: RECURRENCE RELATIONS. [2012/MI/Prelim/10] Question PDF pages 2; solution PDF pages 6. The original files remain private QA records outside this native content.