A professor who is late for class is running up a staircase of n stairs. The professor takes steps that cover either 2,
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
A professor who is late for class is running up a staircase of n stairs. The professor takes steps that cover either 2,
A professor who is late for class is running up a staircase of n stairs. The professor takes steps that cover either 2, 4 or 5 stairs. But steps of 4 or 5 stairs are exhausting. So after each step of 5, the professor takes a step that covers only 2 stairs. After a step of 4 stairs, the professor makes a step of 2 or 4 stairs, but after two consecutive steps of 4 stairs he can only make a step of 2 stairs. Find a recurrence relation for an, the number of different ways for the professor to ascend the n-staircase. Justify your result. [6]
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!