Question

Suppose we have a staircase with n steps (we start on the ground, so we need...

Suppose we have a staircase with n steps (we start on the ground, so we need n total steps to reach the top). We can take as many steps forward at a time, but we will never step backwards. How many ways are there to reach the top? Give your answer as a function of n. For example, if n=3, then the answer is 4. The four options are the following: (1) take one step, take one step, take one step (2) take two steps, take one step (3) take one step, take two steps (4) take three steps.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Lets ways(n) denote the number of ways we can reach the top of the staircase.

Clearly,

ways(1) = 1

ways(2) = 2 ((1) take one step, take one step, (2) take two steps)

ways(3) = 4

If you observe carefully, then the number of ways is given as:

ways(n) = 2n-1

Add a comment
Know the answer?
Add Answer to:
Suppose we have a staircase with n steps (we start on the ground, so we need...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT