Porisma

Original question & working

A rational map approaches two · source reference

[2011/TPJC/Prelim/I/2] · Question pp. 3 · Working pp. 7, 8

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

A sequence u1,u2,u3,…u_1,u_2,u_3,\ldots is such that u1=1u_1=1 and

un+1=5un+42un+3(n≥1).u_{n+1}=\frac{5u_n+4}{2u_n+3}\quad(n\ge1).

As n→∞n\to\infty, un→lu_n\to l.

(i) Find ll exactly. [2]

(ii) Considering y=5x+42x+3−xy=\frac{5x+4}{2x+3}-x, show un+1<unu_{n+1}<u_n if un>lu_n>l. [3]

(iii) State the behaviour when u1=0u_1=0. [1]

Printed working

(i) As n→∞n\to\infty, un→l,un+1→lu_n\to l,u_{n+1}\to l:

l=5l+42l+3⇒2l2−2l−4=0⇒l2−l−2=0⇒(l−2)(l+1)=0.l=\frac{5l+4}{2l+3}\Rightarrow2l^2-2l-4=0\Rightarrow l^2-l-2=0\Rightarrow(l-2)(l+1)=0.

l=2l=2 or −1-1 (rejected as l>0l>0).

(ii) If un>l=2u_n>l=2, then y<0y<0 for y=5x+42x+3−xy=\frac{5x+4}{2x+3}-x.

5un+42un+3−un<0⇒un+1−un<0⇒un+1<un.\frac{5u_n+4}{2u_n+3}-u_n<0\Rightarrow u_{n+1}-u_n<0\Rightarrow u_{n+1}<u_n.

Alternative solution:

un+1−un=5un+42un+3−un=−2un2+2un+42un+3=−2[(un−1/2)2−9/4]2un+3<0(un>l).u_{n+1}-u_n=\frac{5u_n+4}{2u_n+3}-u_n=\frac{-2u_n^2+2u_n+4}{2u_n+3}=\frac{-2[(u_n-1/2)^2-9/4]}{2u_n+3}<0\quad(u_n>l).

Hence un+1<unu_{n+1}<u_n.

(iii) From GC, un→2u_n\to2 as n→∞n\to\infty.

Source diagrams redrawn

13-09

Printed answer key

(i) 2; (iii) un→2u_n\to2 as n→∞n\to\infty

Mathematical review and qualifications

(i) 2l2−2l−4=02l^2-2l-4=0, giving l=2l=2 or −1-1. Starting at 1, positivity is preserved, so l=2l=2.

(ii) F(x)−x=−2(x−2)(x+1)/(2x+3)F(x)-x=-2(x-2)(x+1)/(2x+3). For x>2x>2 this is negative, proving the required decrease. Also F(x)−2=(x−2)/(2x+3)>0F(x)-2=(x-2)/(2x+3)>0, so it stays above 2.

(iii) Starting at 0, for 0≤x<20\le x<2 the increment is positive and F(x)<2F(x)<2. Induction gives increasing terms bounded above by 2. Monotone convergence and the fixed-point equation imply convergence to 2.

Provenance

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