• anonymous
Just another super easy problem, A $$5\times 5$$ square is made of square tiles of dimensions $$1\times 1$$. A mouse can leap along the diagonal or along the side of square tiles. In how many ways can the mouse reach the right lower corner vertex of the square from the lower left corner vertex of the square leaping exactly $$5$$ times?
Mathematics

Looking for something else?

Not the answer you are looking for? Search for more explanations.