SOLUTION: There are 5 possible routes from A to B and there are 3 different routes from B to C. If James has to go from A to C through B, how many different options does he have?

SOLUTION: There are 5 possible routes from A to B and there are 3 different routes from B to C. If James has to go from A to C through B, how many different options does he have?

Algebra.Com

Question 1089403: There are 5 possible routes from A to B and there are 3 different routes from B to C. If James has to go from A to C through B, how many different options does he have?
Answer by ikleyn(52807) (Show Source): You can put this solution on YOUR website!
.
5*3 = 15 different options.

RELATED QUESTIONS
A,B& C be three towns. Suppose there are four routes between A & B. Ane five routes... (answered by checkley71)

There are 2 roads from City A to City B and 4 roads from City B to City C. How many... (answered by stanbon)

there are 3 roads connecting town A and B, and 4 roads connecting towns B and C. how many (answered by checkley71)

Please help me solve this problem. There are 4 roads going from city A to city B,... (answered by stanbon)

A salesman can take 7 routes from city A to city B. He can take 5 routes from city B to... (answered by jorel1380)

I have two questions the first questions is there are three highways from city A... (answered by edjones)

Towns A, B, C, and D are located in such a way that there are five roads from A to B,... (answered by Edwin McCravy)

Suppose there are ten roads from City A to City B and five roads from City B to City C. (answered by ikleyn)

There are 5 roads from Albany to Briscoe, 6 from Briscoe to Chadwick, and 3 from Chadwick (answered by nyc_function)