A naughty kid climbing stairs with N steps .From any step he can take 1 step or 2 steps at a time. Find the total distinct ways of reaching
Answers
Answered by
12
Answer:
A naughty child has a staircase of n stairs to climb. Each step the child takes can cover either 1 stair or 2 stairs. Let an denote the number of different ways for the child to ascend the n-stair staircase Prove that the recurrence relation for an is the Fibonacci recurrence: aa- + a-2
Similar questions