A frog wants to cross a river that is 11 feet across.
There are 10 stones in a line leading across the river, separated by 1 foot. He can either jump to the next stone or jump over a stone, but always moving forward (toward the other side of the river).
How many different ways can he cross the river? Remember, just getting to the 10th rock won't be quite enough, he would need to make one final jump to get across.
For example, one way to cross would be (where 1 means he goes to the next rock and 2 means he skips one):
1,2,2,1,1,2,1,1
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
To get to the ( n + 2 ) th stone, he could either come from the ( n + 1 ) th stone or the n th stone.
So, the number of ways to get to the n th stone is a n = a n − 1 + a n − 2 or the famous Fibonacci numbers.
So a 1 1 = 1 4 4