A stairway has 100 steps. You can climb it by one step at a time, or by two steps. How many different ways to ascend this stairway exist?
(In reply to
2 answers by John zadeh)
Ok, I can see the problem in a new light.
There is only 1 way to ascend the stairs without taking 1 step at a time. This would be by taking 2 steps at a time - all the way to the top.
The other ways you can ascend the steps would include.......
TAKING
1 step, 1 time
1 step, 2 times
1 step, 3 times
ect....
This is a combinatrix problem. The solution would be granted by summing 100C0 + 100C1 + 100C2 + 100C3 + 100C4......100C100
BUT I didn't actually do it.
re: 2 answers
