We have a rabbit at the bottom of a staircase having \(8\) steps. The rabbit has to climb the \(8\) steps to reach the top. The rabbit can make three different moves - jump from one step to the very next, make a 2 step jump (skip one step and land at the next) or make a \(3\) step jump (skip 2 steps and land at the next). In how many different ways can the rabbit reach the top?

\(\textbf{Details and Assumptions:}\)

Suppose the rabbit is just one step from the top, then it has to make a one step jump to reach the top (same with other analogous cases). At the end of the staircase extra jumps are not allowed. .

×

Problem Loading...

Note Loading...

Set Loading...