Welcome to Adda
A frog is sitting on the vertex A of a square ABCD.it starts jumping to the immediately adjacent vertex on either side in random fashion and stops when it reaches point C. in how many ways can it reaches point C if it makes exactly 7 jumps? please explain the movement of frog . is it from A - B - C - D - A - B - C - D or from A - D - C - B - A - D - C - B or in any other way.Here, immediately adjacent vertex means B or D as the frog is sitting on vertex A .what is this line " either side in random fashion " mean according to the given question ? is it mean that the frog will move from point A to point B then come back to point A and then go to point D and again come back to point A ?
The explanation in the answer predict that the frog can never reach Point C if it makes an odd number of jumps. if so, then how ? can frog reach point C if it makes an even number of jumps ? if yes, then how?
Dont make it more complex, it starts from A. So 1st jump it will be in either B or D. In 2nd jump it can be only on either A or C. In 3rd jump it will be either on D or B. In 4th jump it will either on A or C. So in every odd jump it will be only only on either B or D. So, it cannot reach C in 7th jump. Please make a square and write down possibilities, you will get it easily
A frog is sitting on vertex A of a square ABCD. It starts jumping to the immediately adjacent vertex on either side in random fashion and stops when it reaches point C. In how many ways can it reach point C if it makes exactly 7 jumps ?
