n 1 SolutionSolution We know that the combination of n dist

Solution

Solution : We know that the combination of n distinct objects taking r at a time, is C(n, r) or ⁿC_r .

When n stairs climb at a time then it is represented by C_n.

We also know that Cr = n! / r!(n-r)!

Thus number of ways to climb the stairscase with 1 stairs = C1.

Similarly, Number of ways to climb the stairscase with 2 stairs = C2.

Thus number of ways to climb the stairscase with 3 stairs = C3.