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?

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Is it 7 by any chance?

No, but it's a multiple of 7 ;)

make that 14.. or am i lolling myself again?

Looking for something else?

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

## More answers

Looking for something else?

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