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?
Is it 7 by any chance?
No, but it's a multiple of 7 ;)
make that 14.. or am i lolling myself again?
idk why but i feel it's 21.
I havent solved it yet, just a guess.
|dw:1338132939113:dw| need one more.
Why did the tiled square got deleted? It was helpful.
Now I will have to draw on my notebook :/
Join our real-time social learning platform and learn together with your friends!