mathmath333
  • mathmath333
Counting Question
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
mathmath333
  • mathmath333
|dw:1440284134239:dw|
mathmath333
  • mathmath333
\(\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}}\)
Miracrown
  • Miracrown
You're welcom

Looking for something else?

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

More answers

Loser66
  • Loser66
I'm on iPad , cannot draw out the paths, b to me , there are 2 shortest ways , and their weight is 6
zzr0ck3r
  • zzr0ck3r
I will go look at my graph theory book and I am sure I will find something.
mathmath333
  • mathmath333
are u sure its 6
Loser66
  • Loser66
Go, diagonal fromA, 3 times, then go straight to B 3 more
zzr0ck3r
  • zzr0ck3r
there are algorithms for this, that would be a pain to teach on here. google Dijkstra's algorithm
mathmate
  • mathmate
Assume each of the 6 red spaces have the same distance as the 3 green spaces, Number of paths = 9!/(6!3!)=84 ways
zzr0ck3r
  • zzr0ck3r
diagonal?
mathmate
  • mathmate
along the lines, if the question was for me.
mathmath333
  • mathmath333
Djikistra algorithm finds shortest distance, where as i need the number of shortest paths
Loser66
  • Loser66
Go to the right of A 1, then, diagonal, then right,then,diagonal,repeat 1 more time to get B
Loser66
  • Loser66
Use adjacent matrix to find them out. It works also
Loser66
  • Loser66
Why not diagonal? Since it is = right+ vertical up.?
mathmath333
  • mathmath333
answer is 210 for 1st one
mathmath333
  • mathmath333
the path has to along the lines can't jump diagonally
Loser66
  • Loser66
Ohoh, so I'm wrong, hehe.
mathmath333
  • mathmath333
|dw:1440285501178:dw| an example
zzr0ck3r
  • zzr0ck3r
Yes that is right, there is some algorithm that will tell you.
mathmate
  • mathmate
It'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
  • mathmath333
thanks @mathmate ur anwers was correct
mathmate
  • mathmate
You're welcome! :)

Looking for something else?

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