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 n?
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.
That is 3 slots 12 in 1st slot 11 in 2nd 10 in 3rd so that is 12*11*10 or 1320 ways
You might be interested in
Answer:
Step-by-step explanation:
57.6
1. She could get 9 envelopes for 4 dollars each (or the other way around) 2. She could get 12 envelopes for 3 dollars each (or the other way around) 3. She could get 18 envelopes for 2 dollars each (or the other way around)
Hello,
nice as problem.
Here x has a power of 5 as divider and a power of 2 as divider (in order to make a power of 10.
Numbers of dividers: (8+1)*(7+1)=9*8=72
Answer:
i would go for a but im not really sure. sorry if incorrect
Step-by-step explanation:
Answer:
-3
Step-by-step explanation:
x - 4 = - 7
Carry over the - 4 and make x the subject.
x= - 7 + 4
x= - 3
Therefore x is - 3