Porisma

Original question & working

A telescoping increment · source reference

[2011/DHS/Prelim/II/4b(i),(ii)] · Question pp. 1 · Working pp. 1

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=32u_1=\frac32 and

un+1=un+1(n+1)(n+2),n∈Z+.u_{n+1}=u_n+\frac1{(n+1)(n+2)},\qquad n\in\mathbb Z^+.

(i) Find the values of u2,u3,u4u_2,u_3,u_4. [2]

(ii) Form a conjecture for unu_n in terms of nn. [1]

Printed working

(i) Given u1=32u_1=\frac32,

u2=53,u3=74,u4=95.u_2=\frac53,\quad u_3=\frac74,\quad u_4=\frac95.

(ii) Conjecture: un=2n+1n+1u_n=\frac{2n+1}{n+1} for n∈Z+n\in\mathbb Z^+.

Printed answer key

(i) u2=5/3,u3=7/4,u4=9/5u_2=5/3,u_3=7/4,u_4=9/5; (ii) un=(2n+1)/(n+1)u_n=(2n+1)/(n+1), n∈Z+n\in\mathbb Z^+

Mathematical review and qualifications

(i) u2=3/2+1/6=5/3u_2=3/2+1/6=5/3, u3=5/3+1/12=7/4u_3=5/3+1/12=7/4, u4=7/4+1/20=9/5u_4=7/4+1/20=9/5.

(ii) The conjecture is un=(2n+1)/(n+1)=2−1/(n+1)u_n=(2n+1)/(n+1)=2-1/(n+1). It is verified by u1=3/2u_1=3/2 and un+1−un=1/(n+1)−1/(n+2)u_{n+1}-u_n=1/(n+1)-1/(n+2), exactly the prescribed increment.

Provenance

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