A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 4 years ago
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?
anonymous
 4 years ago
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?

This Question is Closed

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0No, but it's a multiple of 7 ;)

apoorvk
 4 years ago
Best ResponseYou've already chosen the best response.0make that 14.. or am i lolling myself again?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0idk why but i feel it's 21.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0I havent solved it yet, just a guess.

apoorvk
 4 years ago
Best ResponseYou've already chosen the best response.0dw:1338132939113:dw need one more.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Why did the tiled square got deleted? It was helpful.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Now I will have to draw on my notebook :/

experimentX
 4 years ago
Best ResponseYou've already chosen the best response.1dw:1338133230250:dw Not so better than before!!

apoorvk
 4 years ago
Best ResponseYou've already chosen the best response.0dw:1338133213060:dw okay 5 more  i learnt not to 'derive' answers lol.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Instead of 5, we can try three and four to get a generalized pattern. Counting isn't the right way.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0For me at least. I keep messing up my count.

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3dw:1338134999071:dwi made a picture :)

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3...now somebody analyze it

apoorvk
 4 years ago
Best ResponseYou've already chosen the best response.0I got 21  and am pretty sure.

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3I'd like to show it though. I wanna figure a way to count based on the number of horizontal moves the mouse makes, like there is only 1 possible path with 5 moves horizontaldw:1338135897949:dw4 not possible... how many ways can he do it if he goes 3 horizontal steps?\ at least that's how I'm thinking...

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3dw:1338136237586:dwI see 3 possibilities along the bottom and one if he goes along the middle totaling 4 now it would be nice to find a pattern rather than count for 2

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3no, there are more... I made a mistake

apoorvk
 4 years ago
Best ResponseYou've already chosen the best response.0That is what I drew above  the black lines are the movements along the grid.

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3I think you are right @apoorvk I just can't prove it

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0How do we know it's 21?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Are you sure of your counting?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0dw:1338137956244:dw

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0The triangle doesnt trace this path.

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3what path is that o0 ? it's all corner moves, right?

apoorvk
 4 years ago
Best ResponseYou've already chosen the best response.0It's 21 for this  I am sure of this  checked that. How do we generalise this though?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0What do you mean by corner move?

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3" In how many ways can the mouse reach the right lower corner vertex from the lower left corner vertex of the square" he can't start in the middle of a square, only a corner, so he cannot move vertically at all

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0" A mouse can leap along the diagonal or along the side of square tiles."

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3yeah, but try it if he makes a vertical move he will never reach the lower left corner

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3he's got to stay on the grid is the point I think

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0dw:1338138315764:dw

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3dw:1338138438753:dw" ...from the lower left corner vertex of the square " I took that to mean that he starts at this pointdw:1338138495546:dw

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3and how is thisdw:1338138529062:dwmoving "along the edge of the tile"? I'd say that's moving through the middle of it

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0@FoolForMath is offline :/

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3he gave me a medal for my drawing, so I think that would mean I interpreted it correctly how did you read it @apoorvk ?

apoorvk
 4 years ago
Best ResponseYou've already chosen the best response.0yeah ofcourse on the grid!! The instructions are pretty clear about that  it's about "vertextovertex" jump, not from "spottospot".

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0I see. I was doing it wrong all along :/ :( such a wasted effort :/

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.3but that's great, now you can do it correctly for us @Ishaan94 :D

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.021 is the right answer. The general solution is also amazing :D Thanks to M.SE I found this one: http://en.wikipedia.org/wiki/Motzkin_number http://math.stackexchange.com/questions/150420/

experimentX
 4 years ago
Best ResponseYou've already chosen the best response.1lol ... that wasn't easy!! enlightening though!!
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.