All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Climbing the stairs (Posted on 2002-09-05) Difficulty: 3 of 5
A stairway has 100 steps. You can climb it by one step at a time, or by two steps. How many different ways to ascend this stairway exist?

See The Solution Submitted by levik    
Rating: 3.3333 (12 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: A new approach with no proof | Comment 4 of 24 |
(In reply to A new approach with no proof by TomM)

I think I can justify this trend...

Generalize the stairway to n steps.

Think about the last step you will take on the stairs. It is either one-step or two-step. Which means you are either standing at n-1 or at n-2.

So the number of ways to ascend n steps is equal to the number of ways to get to step n-1 plus the number of ways to get to step n-2. This is exactly the Fibonacci sequence.
  Posted by levik on 2002-09-05 20:44:08

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information