In a race in which twelve automobiles are entered and there are no ties, in how many ways can the first three finishers come i
2 answers:
Answer:
1320 ways
Step-by-step explanation:
In a race in which twelve automobiles are entered and there are no ties.
We have to find the ways in which first three finishers come in.
In these questions when order is fixed means when first, second and third positions are fixed (First comes, then second and then third) then we use the permutation to find the number of ways.
3 positions out of 12 automobiles =
=
=
= 12×11×10
= 1320
In 1320 ways first three automobiles may come in.
You might be interested in
Amount of money earned per number of hours of work =
- A composite function is generally a function that is written inside another function.
- Composition of a function is done by substituting one function into another function. For example, f [g (x)] is the composite function of f (x) and g (x). The composite function f [g (x)] is read as “f of g of x”.
To evaluate a composite function f(g(x)) at some x = a, first compute g(a) by substituting x = a in the function g(x). Then substitute g(a) into the function f(x) by substituting x = g(a). In the same way, we can calculate g(f(a)) as well.
Required calculation -
Amount of money (the earning) per unit x =
Number of gallons of ice cream that Barrett makes per hour, where x is the number of hours he works =
we are to find the composite function
Substituting g(x) into the x of f(x), we find:
To learn more about composite function from given link
#SPJ4