Questions: A sales representative can take one of 2 different routes from City C to City D and any one of 6 different routes from City D to City H. How many different routes can she take from City C to City H, going through City D? There are possible routes.

A sales representative can take one of 2 different routes from City C to City D and any one of 6 different routes from City D to City H. How many different routes can she take from City C to City H, going through City D?

There are possible routes.

Transcript text: A sales representative can take one of 2 different routes from City C to City D and any one of 6 different routes from City D to City H. How many different routes can she take from City C to City H, going through City D? There are $\square$ possible routes.

Solution

Solution Steps

Step 1: Identify the Parameters

Given that there are 2 different routes from City C to City D, and 6 different routes from City D to City H.

Step 2: Apply the Solution Approach

To find the total number of different routes from City $X$ to City $Z$ through City $Y$, we multiply the number of routes from City $X$ to City $Y$ by the number of routes from City $Y$ to City $Z$. Thus, the total number of routes is calculated as: $m \times n = 2 \times 6 = 12$.