Strides of Any Length
A staircase has 10 steps. You start at the bottom (step 0) and must finish exactly on step 10. Each stride carries you up any positive whole number of steps (1, 2, 3, ..., or all 10 at once). Climbs are different if their sequences of strides differ. How many different climbs are there? Give an integer.
Related problems & prerequisites
Worth solving first
- Eight Rooks 4.0/10
Source: Classic exercise in wide circulation; no traceable original source. Statement written for AxiomIQ.