Frog staircase: Difference between revisions
Jump to navigation
Jump to search
Oscarlevin (talk | contribs) No edit summary |
Oscarlevin (talk | contribs) |
||
| Line 1: | Line 1: | ||
First saw this gem in PProblem SSSolving. | First saw this gem in PProblem SSSolving. | ||
A frog must climb a 10 step staircase. He can hop up either one step or two steps at a time. How many ways are there for him to make it to the top? | A frog must climb a 10 step staircase. He can hop up either one step or two steps at a time. How many ways are there for him to make it to the top? | ||
< | ==Help== | ||
{{Hint|Start with smaller staircases and look for a pattern.}} | |||
{{Answer|<private>89 ways.</private>}} | |||
[[Category:Pattern recognition]] | [[Category:Pattern recognition]] | ||
[[Category:Induction]] | [[Category:Induction]] | ||
[[Category:Fibonacci]] | [[Category:Fibonacci]] | ||
Revision as of 13:12, 12 May 2010
First saw this gem in PProblem SSSolving.
A frog must climb a 10 step staircase. He can hop up either one step or two steps at a time. How many ways are there for him to make it to the top?
Help
Hint
Start with smaller staircases and look for a pattern.
Answer
<private>89 ways.</private>