Question 462945: I have another difficult question that I don't even know how to set up or solve. Please help me with this.
Refer to the given graph. Assume one can move only down or to the right. How many different routes start at A, pass through B, and end at C?
The graph has 5 rows and 5 columns.
It looks similar to this.
a
[][][]b[][]
[][][][][]
[][][][][]
[][][][][]
[][][][][]c
Answer by MathLover1(20855)   (Show Source):
You can put this solution on YOUR website! 1st rout
a
[x][x][x]b[][]
--[][][][x][]
--[][][][x][]
--[][][][x][]
--[][][][x[x]c
2nd rout
a
[x][x][x]b[][]
--[][][][x][]
--[][][][x][]
--[][][][x][x]
---[][][][][x]c
3rd rout
a
[x][x][x]b[][]
--[][][][x][]
--[][][][x][x]
---[][][][][x]
---[][][][][x]c
4th rout
a
[x][x][x]b[][]
---[][][][x][x]
----[][][][][x]
----[][][][][x]
----[][][][][x]c
since one can move only down or to the right, there is 4 different routes start at A, pass through B, and end at C
|
|
|
