A community for students.
Here's the question you clicked on:
 0 viewing
mathmath333
 one year ago
Counting Question
mathmath333
 one year ago
Counting Question

This Question is Closed

mathmath333
 one year ago
Best ResponseYou've already chosen the best response.1dw:1440284134239:dw

mathmath333
 one year ago
Best ResponseYou've already chosen the best response.1\(\large \color{black}{\begin{align} & \normalsize \text{The Red and Green lines are perpendicular to each other}\hspace{.33em}\\~\\ & \normalsize \text{Find the number of shortest paths to go from A to B.}\hspace{.33em}\\~\\ & \normalsize \text{Find the total number of paths to go from A to B.}\hspace{.33em}\\~\\ & \normalsize \text{(Assume the points are equidistant)}\hspace{.33em}\\~\\ \end{align}}\)

Loser66
 one year ago
Best ResponseYou've already chosen the best response.1I'm on iPad , cannot draw out the paths, b to me , there are 2 shortest ways , and their weight is 6

zzr0ck3r
 one year ago
Best ResponseYou've already chosen the best response.1I will go look at my graph theory book and I am sure I will find something.

Loser66
 one year ago
Best ResponseYou've already chosen the best response.1Go, diagonal fromA, 3 times, then go straight to B 3 more

zzr0ck3r
 one year ago
Best ResponseYou've already chosen the best response.1there are algorithms for this, that would be a pain to teach on here. google Dijkstra's algorithm

mathmate
 one year ago
Best ResponseYou've already chosen the best response.1Assume each of the 6 red spaces have the same distance as the 3 green spaces, Number of paths = 9!/(6!3!)=84 ways

mathmate
 one year ago
Best ResponseYou've already chosen the best response.1along the lines, if the question was for me.

mathmath333
 one year ago
Best ResponseYou've already chosen the best response.1Djikistra algorithm finds shortest distance, where as i need the number of shortest paths

Loser66
 one year ago
Best ResponseYou've already chosen the best response.1Go to the right of A 1, then, diagonal, then right,then,diagonal,repeat 1 more time to get B

Loser66
 one year ago
Best ResponseYou've already chosen the best response.1Use adjacent matrix to find them out. It works also

Loser66
 one year ago
Best ResponseYou've already chosen the best response.1Why not diagonal? Since it is = right+ vertical up.?

mathmath333
 one year ago
Best ResponseYou've already chosen the best response.1answer is 210 for 1st one

mathmath333
 one year ago
Best ResponseYou've already chosen the best response.1the path has to along the lines can't jump diagonally

Loser66
 one year ago
Best ResponseYou've already chosen the best response.1Ohoh, so I'm wrong, hehe.

mathmath333
 one year ago
Best ResponseYou've already chosen the best response.1dw:1440285501178:dw an example

zzr0ck3r
 one year ago
Best ResponseYou've already chosen the best response.1Yes that is right, there is some algorithm that will tell you.

mathmate
 one year ago
Best ResponseYou've already chosen the best response.1It's like a permutation with 9 objects, 3 red and 6 green. RGRGRGGGG RRRGGGGGG .... Using the multinomial theorem, the number of ways would be 9!/(6!3!)

mathmath333
 one year ago
Best ResponseYou've already chosen the best response.1thanks @mathmate ur anwers was correct
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.