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(4): A new approach with no proof | Comment 8 of 24 |
(In reply to re(3): A new approach with no proof by TomM)

Yes, the 101st Fibonacci number is the correct solution. I got the same answer using a different (more complicated lol) method of adding up the numbers of combinations:
SUM (n+0)!/n!0!, (n-1)!/(n-2)!1!, (n-2)!/(n-4)!2!, ... , (0+n/2)!/0!(n/2)!
I wasn't actually calculating all these expressions individually, but I created a couple of formulas in Excel and copied them a few times till i got to (0,50) and then summped up the results.
  Posted by lucky on 2002-09-06 09:25:52

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 (12)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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