1,237 views
0 votes
0 votes
A grasshopper is sitting on a little stone, which we'll call stone zero. Ahead of him, arranged in a line, are stones one, two, three, et cetera, all the way up to nine.

The grasshopper would like to reach that ninth stone, for reasons unknown. What we do know is that he'll get there by combining little grasshopper jumps, each of which will take our friend forward by either one or two steps. To be clear, this means the grasshopper has exactly two ways to reach stone two: he could take one big jump, or two little ones.

How many different paths can the grasshopper take to reach his destination?

2 Answers

Best answer
0 votes
0 votes
Answer is 55, solve it using Fibinacci series. F(9)=F(8)+F(7), keep doing it, until F(2)=F(1)+F(0)=1+1=2(as given in the question too that to reach stone 2 we have 2 paths), now trace back F(3) and so on. Final answer is the 9th term in fibonacci series assuming the series begins from 1,2,3,5...55.
0 votes
0 votes
My approach: Between every two stones he has two choices. Either take two small jumps or one big jump. Therefore for every pair he has two choices. Total choices :2*2*2*2*...9 times.. please correct me if wrong @Arjun suresh sir

Related questions

0 votes
0 votes
0 answers
3