Porisma
All chapter practice

Sequences and series

Practice section 15 of 17

Questions 85–90 in this collection

Practice questions

Review practice · 2 of 6

Sum the rows of a triangular labelled board

The n-th row from the top of a board has n tiles, labelled 1,2,…,n1,2,\ldots,n from left to right, as in the diagram. Given ∑r=1nr2=n(n+1)(2n+1)/6\sum_{r=1}^nr^2=n(n+1)(2n+1)/6, find the sum in the k-th row and hence show the sum of all numbers in n rows is n(n+1)(n+2)/6n(n+1)(n+2)/6. [4]

Expand diagram

Use the scrollbars or arrow keys to inspect details.

Given triangular tile board: first row is 1; second row 1,2; third row 1,2,3; ellipses continue the pattern. Every row starts again at 1.
Given triangular tile board: first row is 1; second row 1,2; third row 1,2,3; ellipses continue the pattern. Every row starts again at 1.
Given triangular tile board: first row is 1; second row 1,2; third row 1,2,3; ellipses continue the pattern. Every row starts again at 1.

[2017/NYJC/I/1]

CJC · Review problems · Question 10

Solution

Review practice · 5 of 6

Treat fixed points as candidate limits before proving decrease

The sequence satisfies xn+1=12/(7−xn)x_{n+1}=12/(7-x_n) for positive integers nn.

(i) Find the exact value(s) of ss, the limit of xnx_n. [3]

(ii) Show that if 3<xn<43<x_n<4, then xn+1<xnx_{n+1}<x_n. [3]

[2008/TJC/JC1/MYE/6]

CJC · Review problems · Question 13

Solution

Review practice · 6 of 6

Count elapsed updates separately from the week label

An insect colony initially has 5050 insects. Each week its population doubles, then 3030 die through competition and limited resources. Let unu_n be the population at the beginning of week nn, n=1,2,…n=1,2,\ldots, with all remaining insects alive.

(i) Form a recurrence relating week n and week n−1. [1]

(ii) Find the minimum number of weeks needed for the population to exceed 300000300000. [2]

[2006/MJC/Promo/2(b)]

CJC · Review problems · Question 14

Solution

Back to all practice questions