KnowledgeBoat Logo
|

Mathematics

Angaan wants to climb an 8-step staircase. His playful rule is that he can take either 1 step or 2 steps at a time. For example, one of his paths is 1, 2, 2, 1, 2. In how many different ways can he reach the top?

Number Play

1 Like

Answer

We can count directly by grouping the paths according to how many 2-steps are used:

No 2-step (eight 1-steps): 1 way

One 2-step (with six 1-steps): 7 ways

Two 2-steps (with four 1-steps): 15 ways

Three 2-steps (with two 1-steps): 10 ways

Four 2-steps (no 1-step): 1 way

Total = 1 + 7 + 15 + 10 + 1 = 34 ways.

Hence, Angaan can reach the top of the 8-step staircase in 34 different ways.

Answered By

1 Like


Related Questions