To state: The numbers of possible different routes from town A to town C by way of B if there are three roads from town A to town B and four roads from town B to town C .
The resultant answer is 12 routes.
Given information:
There are three roads from town A to town B and four roads from town B to town C .
Explanation:
Number of roads from town A to B : 3
Number of roads from town B to C : 4
One route has to be chosen between towns A to B and then one route has to be chosen between towns B to C, to reach town C from town A .
Now the number of ways of selecting one route between towns A to B from the three routes is 3.
Similarly, the number of ways of selecting one route between towns B to C from the four available routes is 4.
Then the number of routes from town A to town C is through town B is:
Therefore, there are 12 routes to reach town C.
Chapter 9 Solutions
PRECALCULUS:GRAPHICAL,...-NASTA ED.
- Calculus: Early TranscendentalsCalculusISBN:9781285741550Author:James StewartPublisher:Cengage LearningThomas' Calculus (14th Edition)CalculusISBN:9780134438986Author:Joel R. Hass, Christopher E. Heil, Maurice D. WeirPublisher:PEARSONCalculus: Early Transcendentals (3rd Edition)CalculusISBN:9780134763644Author:William L. Briggs, Lyle Cochran, Bernard Gillett, Eric SchulzPublisher:PEARSON
- Calculus: Early TranscendentalsCalculusISBN:9781319050740Author:Jon Rogawski, Colin Adams, Robert FranzosaPublisher:W. H. FreemanCalculus: Early Transcendental FunctionsCalculusISBN:9781337552516Author:Ron Larson, Bruce H. EdwardsPublisher:Cengage Learning