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.)
Some Thoughts A Toughie | Comment 1 of 24
I can't think of any easy equation or algorithm for solving this quickly, but it obviously has a definite and finite answer.

My first step is to rephrase the question, focusing in on the steps that are skipped when you take two together, and then converting the problem into pure number theory:

How many subsets of (1, 2, 3, ..., 100} are there that satisfy the follwing condition: if n is a member of subset (A sub m), then neither n + 1 nor n - 1 can be members.
  Posted by TomM on 2002-09-05 19:02:27
Please log in:
Remember me:
Sign up! | Forgot password

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

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