A sales representative can take one of 3 different routes from City Upper B to City Upper D and any one of 6 different routes from City Upper D to City Upper G. How many different routes can she take from City Upper B to City Upper G, going through City Upper D?

It is a theorem that states that if there are n things, each with [tex]n_1, n_2, \cdots, n_n[/tex] ways to be done, each thing independent of the other, the number of ways they can be done is:

[tex]N = n_1 \times n_2 \times \cdots \times n_n[/tex]

In this problem:

From City Upper B to City Upper D, there are 3 routes, hence [tex]n_1 = 3[/tex].

From City Upper D to City Upper G, there are 6 routes, hence [tex]n_2 = 6[/tex].

Hence, the total number of routes is given by:

T = 3 x 6 = 18.

More can be learned about the Fundamental Counting Theorem at https://brainly.com/question/24314866

#SPJ2

A sales representative can take one of 3 different routes from City Upper B to City Upper D and any one of 6 different routes from City Upper D to City Upper G. How many different routes can she take from City Upper B to City Upper G​, going through City Upper D​?

Respuesta :

What is the Fundamental Counting Theorem?

Otras preguntas

A sales representative can take one of 3 different routes from City Upper B to City Upper D and any one of 6 different routes from City Upper D to City Upper G. How many different routes can she take from City Upper B to City Upper G, going through City Upper D?