When climbing a staircase, you can take either one or three stairs in a single step.
(a) Write “Let Sn be the number of ways to climb a staircase with n stairs.” Prove the recurrence relation Sn = Sn-1 + Sn-3.
(b) Write down what S0, S1, S2 are (or alternatively, what S1, S2, S3 are). No justification needed.
(c) Use (a) and (b) to answer the following question. How many ways are there to climb a staircase with 12 stairs?
Get Answers For Free
Most questions answered within 1 hours.