Frog staircase: Difference between revisions
Jump to navigation
Jump to search
Oscarlevin (talk | contribs) No edit summary |
|||
| (4 intermediate revisions by 2 users not shown) | |||
| 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|89 ways.}} | |||
[[Category:Pattern recognition]] | [[Category:Pattern recognition]] | ||
[[Category:Induction]] | [[Category:Induction]] | ||
[[Category: | [[Category:Sequences]] | ||
Current revision as of 17:19, 23 November 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.