Frog staircase: Difference between revisions
Jump to navigation
Jump to search
Oscarlevin (talk | contribs) Created page with 'First saw this gem in PProblem SSSolving. ==Puzzle== 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…' |
Oscarlevin (talk | contribs) No edit summary |
||
| Line 3: | Line 3: | ||
==Puzzle== | ==Puzzle== | ||
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? | ||
<spoiler>89 ways.</spoiler> | |||
[[Category:Pattern recognition]] | [[Category:Pattern recognition]] | ||
[[Category:Induction]] | [[Category:Induction]] | ||
[[Category:Fibonacci]] | [[Category:Fibonacci]] | ||
Revision as of 12:19, 29 March 2010
First saw this gem in PProblem SSSolving.
Puzzle
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?
<spoiler>89 ways.</spoiler>