abhimahatu
New member
- Joined
- Jun 3, 2016
- Messages
- 1
[FONT="]There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs at a time. Count the number of ways, the person can reach the top.
I know a way to solve this by making a recurrence relation. Is there any way to solve this using permutations and combination?[/FONT]
I know a way to solve this by making a recurrence relation. Is there any way to solve this using permutations and combination?[/FONT]