SOLUTION: A,B& C be three towns. Suppose there are four routes between A & B. Ane five routes between B & C. In how many different ways one can travel from A to C via B?

SOLUTION: A,B& C be three towns. Suppose there are four routes between A & B. Ane five routes between B & C. In how many different ways one can travel from A to C via B?

Algebra.Com

Question 125201: A,B& C be three towns. Suppose there are four routes between A & B. Ane five routes between B & C. In how many different ways one can travel from A to C via B?
Answer by checkley71(8403) (Show Source): You can put this solution on YOUR website!
4*5=20 DIFFERENT WAYS TO GET FROM A TO C VIA B.
RELATED QUESTIONS
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)

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

There are 5 possible routes from A to B and there are 3 different routes from B to C. If... (answered by ikleyn)

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

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 four routes (call them P, Q, R and S) between Amy�s home and her place of work. (answered by oscargut)

There are 2 roads from City A to City B and 4 roads from City B to City C. How many... (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)

Please show how you got the answer. (a) UMUC Stat Club is sending a delegate of 2... (answered by Theo)