## New Problem: Flight of Stairs

You’re climbing a flight of 20 stairs. Each time you take a step, you can choose to cover either one or two stairs. How many different ways can you climb to the top?

Now generalize to $n$ stairs.

In basketball, you can score $1, 2,$ or $3$ points at a time. How many ways can you score $n$ points?

Can you generalize this to an arbitrary list of possible steps/points to advance at a time?

Advertisements

### One Response to “New Problem: Flight of Stairs”

1. Answer: Flight Of Stairs « Arcsecond Says:

[…] Flight Of Stairs By Mark Eichenlaub I got this problem from Shelley Chang, who says it’s one of her […]