Recursive (Counting) AMC8 Basic
2010


Problem - 1150
Everyday at school, Jo climbs a flight of $6$ stairs. Joe can take the stairs $1$, $2$, or $3$ at a time. For example, Jo could climb $3$, then $1$, then $2$. In how many ways can Jo climb the stairs?

The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error