Hopping rabbit
A rabbit climbs a staircase, hopping 1 or 2 steps at a time. The number of distinct ways to climb stairs is a Fibonacci number. How many ways for stairs?
Show hints (2)+
- Ways to reach step n = ways to (n−1) + ways to (n−2).
- Start from $f(1)=1, f(2)=2$.
Answer
Reveal answer →Final answer
89
Want the full step-by-step worked solution? It's part of Premium — along with a worked solution for every question in the bank.
Asked at: IMC, Akuna Capital