+0  
 
0
24
2
avatar+36 

Anyone have an alternate solution to the Leo the Rabbit problem besides combinations?

Just curious

 Aug 25, 2023
 #1
avatar+183 
+1

You could use recursion, let \(a_n\) be the number of ways for \(n\) steps. Then Leo can hop \(1\) step or \(2\) steps on the first hop, so \(a_n=a_{n-1} + a_{n-2}\). You can calculate \(a_1=1\) and \(a_2=2\) and use them to find \(a_{10}\). This is basically the Fibonacci sequence. 

 Aug 25, 2023
edited by plaintainmountain  Aug 25, 2023
edited by plaintainmountain  Aug 25, 2023
edited by plaintainmountain  Aug 25, 2023

4 Online Users

avatar
avatar
avatar