Confirming your payment

Skip to content

Competency-Based Questions (CBQ) · Question 80 of 80

Read the passage and answer the questions that follow.

Question 804 marksHard

Read the passage and answer the questions that follow.

Arjun climbs a staircase taking 1, 2 or 3 steps at a time. Let TnT_n be the number of different ways in which he can climb a staircase of nn steps (the order of the moves matters, so 1 then 2 is different from 2 then 1). By listing, T1=1T_1 = 1, T2=2T_2 = 2 and T3=4T_3 = 4 (the ways for 3 steps are 1+1+1, 1+2, 2+1 and 3).

(i) Explain why Tn=Tn−1+Tn−2+Tn−3T_n = T_{n-1} + T_{n-2} + T_{n-3} for n≥4n \ge 4. (1 mark)

(ii) Find T8T_8. (1 mark)

(iii) Find the least number of steps for which Arjun has more than 1000 ways to climb. (2 marks)