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 ->  Permutations -> 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?      Log On


   

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) About Me  (Show Source):
You can put this solution on YOUR website!
4*5=20 DIFFERENT WAYS TO GET FROM A TO C VIA B.