Frog staircase: Difference between revisions
Jump to navigation
Jump to search
Oscarlevin (talk | contribs) |
Oscarlevin (talk | contribs) No edit summary |
||
| Line 8: | Line 8: | ||
{{Hint|Start with smaller staircases and look for a pattern.}} | {{Hint|Start with smaller staircases and look for a pattern.}} | ||
{{Answer| | {{Answer|89 ways.}} | ||
[[Category:Pattern recognition]] | [[Category:Pattern recognition]] | ||
[[Category:Induction]] | [[Category:Induction]] | ||
[[Category:Fibonacci]] | [[Category:Fibonacci]] | ||
Revision as of 09:26, 13 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
89 ways.