A person can either take one step or two steps at a time to go up a stairs. There will be 1 way to go up one step. There will be 2 ways going up 2 steps. there will be 3 ways going up 3 steps (2-1-1 and 1-2-1 and 1-1-2). There will be 5 ways going up 4 steps (1-1-2 and 2-2 and 2-1-1 and 1-2-1 and 1-1-2). There will be 8, 13,21, 34 , 55 and 89 ways to go up 5,6,7,8,9 and 10 steps in a stair. If you could write those out, there is a pattern. but is there a way to prove that this pattern goes on infinitely? for example n-number of steps?
2006-09-15
09:02:12
·
3 answers
·
asked by
Sky Australia
1