CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

There are ten steps in a staircase and a person has to take those steps. At every step, the person has got a choice of taking one step or two steps or three steps. The number of ways in which a person can take those steps is

A
310
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
39
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
38
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
None of these
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Open in App
Solution

The correct option is D None of these

We have,

Let Nk denote the number of ways to climb k stairs in the manner described. (So we’re looking for N10.) Notice that for k ≥ 4 there are 3 “moves” one can do for your first step: you can climb 1,2 or 3 stairs. If you climb 1 stair then there are Nk−1 ways to finish; if you climb 2 stairs there are Nk−2 ways to finish; and if you climb 3 stairs there are Nk−3 ways to finish. Thus: Nk = Nk−1 + Nk−2 + Nk−3 Well, it’s pretty easy to see that for the k < 4 we have N1 = 1, N2 = 2 and N3 = 4, so using the above we can calculate N10 using brute force.

N4= N3+ N2+ N1= 4 + 2 + 1 = 7

N5= N4+ N3+ N2=7 + 4 + 2 = 13

N6= N5+ N4+ N3= 13 + 7 + 4 = 24

N7= N6+ N5+ N4= 24 + 13 + 7 = 44

N8= N7+ N6+ N5= 44 + 24 + 13 = 81

N9= N8+ N7+ N6= 81 + 44 + 24 = 149

N10= N9+ N8+ N7= 149 + 81 + 44 = 274

There are 274 ways to climb the stairs.
Hence, this is the answer.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Forced Oscillation and Resonance
PHYSICS
Watch in App
Join BYJU'S Learning Program
CrossIcon