plaintainmountain

I'm not sure what is going on but post #10 definitely isn't by history 🤣

I think the confusion is stemming from the wording.

Hint: equiangular $\ne$ regular. 

Please do not answer this question. It is from AoPS, as the link clearly shows. 

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. 

There are a lot of things on this site that need fixing. I don't think Admin has time for it though since he isn't here often.