Afleet of nine taxis is to be dispatched to three airports in such a way that three go to airport a, five go to airport b, and one goes to airport c. in how many distinct ways can this be accomplished?

There are 504 distinct ways can this be accomplished.

Step-by-step explanation:

A fleet of nine taxis is to be dispatched to three airports.

3 go to airport a, 5 go to airport b, and 1 goes to airport c.

The number of distinct ways this can this be accomplished is:

=

= 504

Therefore, there are 504 distinct ways can this be accomplished.

the terms of a geometric sequence can be found by beginning with the first term and multiplying by the common ratio repeatedly. a recursive formula for a geometric sequence with common ratio r is given by an=ran−1 a n = r a n − 1 for n≥2 n ≥ 2 .

step-by-step explanation:

30 feet

step-by-step explanation:

that would be 2 1/2 * 12

= 24 + 6

= 30 feet   (answer)