Difference between revisions of "Frog staircase"

From Math Puzzle Wiki
Jump to: navigation, search
Line 12: Line 12:
 
[[Category:Pattern recognition]]
 
[[Category:Pattern recognition]]
 
[[Category:Induction]]
 
[[Category:Induction]]
[[Category:Fibonacci]]
+
[[Category:Sequences]]

Revision as of 13:05, 28 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.