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?

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 […]

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s


%d bloggers like this: