SOLUTION: A container contains 10 diesel engines. The company chooses 6 engines at​ random, and will not ship the container if any of the engines chosen are defective. Find the probabi

Algebra ->  Permutations -> SOLUTION: A container contains 10 diesel engines. The company chooses 6 engines at​ random, and will not ship the container if any of the engines chosen are defective. Find the probabi      Log On


   



Question 1072879: A container contains 10 diesel engines. The company chooses 6 engines at​ random, and will not ship the container if any of the engines chosen are defective. Find the probability that a container will be shipped even though it contains 2 defectives if the sample size is 6.
Can someone please breakdown the steps to solve this. This is an online class and the help feature isn't explaining how to get the numbers needed to solve it. Thank you

Answer by KMST(5328) About Me  (Show Source):
You can put this solution on YOUR website!
I am baffled by the phrase "if the sample size is 6" at the end of the problem.
The problem said before that the company chooses 6 engines out of the 10 in the container. What is that phrase about sample size for?

Anyway, there are
different possible sets of 6 engines that can be chosen.
NOTE: That is combinations of 10 taking 6 at a time.
Your online class may use a symbol with a C for combinations,
instead of the %28matrix%282%2C1%2C10%2C6%29%29 notation I used.

There are only %28matrix%282%2C1%2C8%2C6%29%29=%28matrix%282%2C1%2C8%2C2%29%29=8%2A7%2F2=4%2A7=28
sets of 6 good engines that can be made with the
10-2=8 good engines in that container that has 2 defective ones.
As a fraction that is 28%2F210=highlight%282%2F15%29 ,
and that is the probability that the set of 6 engines chosen does not have a defective one.

FORMULAS:
I do not like formulas as a substitute for understanding concepts.
The concept that is relevant to this problem is the concept of combinations.
The number ways of choosing a set of 6 engines
out of a set of 10 engines, can be seen as
%28matrix%282%2C1%2C10%2C6%29%29 , the number of ways to pick the chosen 6 ,
or %28matrix%282%2C1%2C10%2C4%29%29 , the number of ways of selecting the (4 not chosen.
%28matrix%282%2C1%2C10%2C4%29%29=10%2A9%2A8%2A7%2F%284%2A3%2A2%29=10%2A3%2A7=210 ,
with 4 factors in numerator, and 4 factors in denominator,
makes for an easier calculation than
%28matrix%282%2C1%2C10%2C6%29%29=10%2A9%2A8%2A7%2A6%2A5%2F%286%2A5%2A4%2A3%2A2%29 .
Below are the formulas and why they are the way they are.

Permutations of k items taking all k is
the number of different ordered lists of k items that can be made
from all k items of a set of k different items is
factorialk%22=%22highlight%28k%21=k%2A%28k-1%29%2A%28k-2%29%2A%22...%22%2A3%2A2%2A1%29 ,
because there are
k ways to pick the first item for the list,
%28k-1%29 ways to pick the second item for the list,
%28k-2%29 ways to pick the third item for the list,
and so on, until you have
3 ways to pick one of the 3 items not picked before,
2 ways to pick one of the 2 items not picked before,
and 1 choice for the last item on the list.
That k%21 is the number of options a teacher would have
to randomly line up all k students in a class.

Permutations of n items taking k of them is
the number of different ordered lists of k items that can be made
from the n different items in a set.
That number is

That is a product of k factors.
That is the number of options a teacher would have to randomly select
a line of k of the n students in the school.
The teacher would have
n choices for the first student in the line,
%28n-1%29 choices for the second student in the line,
%28n-2%29 choices for the third student in the line,
and so on, until there are %28n-k%2B1%29 choices possible
for the last of the k picks.
For the last of the k picks,
there are %28n-k%2B1%29 students wishing (or dreading) to be the last pick.
(After that last pick, there are %28n-k%29 students left out,
disappointed, or relieved that they were not picked).
You can see how factors in the factorials ratio simplify leaving only k factors.
.

Combinations of n items taking k of them is
the number of different sets of k items that can be made
from the n different items in a set.
The formula for combinations of n taken k at a time is
.
It is the number of possible sets k of the n students in the school that can be made.
There are n%21%2F%28n-k%29%21 possible lists,
but they are not going to be lined up, order does not matter.
Any 1 set of k students will be listed in a different order in k%21 lists,
but it is just 1 set,
so the n%21%2F%28n-k%29%21 possible lists boil doen to
n%21%2F%28%28n-k%29%21k%21%29 possible sets.