Problem
COM-B1-M10-P006 Ten Stairs
#6
★★☆☆☆ Level 2 of 5
In how many ways can one climb \(10\) stairs using steps of \(1\) or \(2\)?
This is the same recurrence as for five stairs.
With \(a_0=1\), \(a_1=1\), \(a_n=a_{n-1}+a_{n-2}\), we get \(1,1,2,3,5,8,13,21,34,55,89\). Hence \(a_{10}=89\).
Checks careful indexing.