Confirming your payment

Skip to content

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

Read the passage and answer the questions that follow.

Question 404 marksMedium

Read the passage and answer the questions that follow.

Meena climbs a staircase, taking either 1 step or 2 steps at a time. Let WnW_n be the number of different ways in which she can climb a staircase of nn steps, for n=1,2,3,…n = 1, 2, 3, \dots Then W1=1W_1 = 1 and W2=2W_2 = 2 (1 + 1 or 2). Her last move is either 1 step, after climbing n−1n - 1 steps in some way, or 2 steps, after climbing n−2n - 2 steps in some way. So

Wn=Wn−1+Wn−2for n≥3W_n = W_{n-1} + W_{n-2} \quad \text{for } n \ge 3

(i) Find W5W_5. (1 mark)

(ii) Find W10W_{10}. (1 mark)

(iii) A staircase can be climbed in exactly 233 ways. How many steps does it have? Also verify that W1+W2+⋯+W6=W8−2W_1 + W_2 + \dots + W_6 = W_8 - 2. (2 marks)