Permutations and Combinations of samples

exitwound
Messages
291
Reaction score
1
Review problem. I have the answers. Don't know how to get them. Answers in brackets.

Homework Statement



Shortly after being put into service, some buses manufactured by a certain company have developed cracks on the underside of the main frame. Suppose a paricular city has 25 of these buses, and cracks have actually appeared on 8 of them.

a.)How many ways are there to select a sample of 5 buses from the 25 for a thorough inspection? [53130]

b.) In how many ways can a sample of 5 buses contain exactly 4 with visible cracks? [1190]

c.) If a sample of 5 buses is chosen at random, what is the probability that exactly 4 of the 5 will have visible cracks? [.0224]

d.) If buses are selected as in part (c), what is the probability that at least 4 of those selected will have visible cracks? [.0235]

Homework Equations



Permutations = P_{k,n} = \frac{n!}{(n-k)!}

Combinations = \begin{pmatrix} <br /> n\\<br /> k <br /> \end{pmatrix}= \frac{n!}{k!(n-k)!}

The Attempt at a Solution



a.) I'm looking for the total number of combinations of choosing 5 buses out of the 25 buses. Therefore

Combinations = \begin{pmatrix} <br /> n\\<br /> k <br /> \end{pmatrix} = \frac{n!}{k!(n-k)!} = \frac{25!}{5!(25-5)!} = 53130

b.) I don't know how to set it up.
c.) Didn't attempt it because I can't do (b).
d.) Didn't attempt it because I can't do (b).
 
Last edited:
Physics news on Phys.org
Your answer to part a is wrong. 25!/20! doesn't equal 53130; it's equal to 6375600.

Do you understand the difference between permutations and combinations? With permutations, order matters; with combinations, it doesn't. For example, suppose you have n=3 items, A, B, and C and you select k=2 of them. There are 6=3!/(3-2)! permutations you can get, namely AB, BA, AC, CA, BC, and CB. But there are only 3=3!/[2!(3-2)!] combinations you can get because the pairs AB and BA, AC and CA, and BC and CB only count as one combination each since the order doesn't matter.

In part a, the order of the busses doesn't matter, so you want to calculate the number of combinations, not permutations.
 
Yes I figured that out but physicsforums went down and I couldn't edit it.
 
In part b, they're asking how many ways can you choose 5 buses from the 25 total such that 4 will contain cracks and one won't. That means you have to choose 4 from the 8 with cracks and 1 from the remaining 17.
 
b.)\begin{pmatrix} <br /> 8\\<br /> 4 <br /> \end{pmatrix} \begin{pmatrix} <br /> 17\\<br /> 1 <br /> \end{pmatrix} = \frac{8!}{4!4!} * \frac{17!}{1!16!}= 1190

c.) \frac{\begin{pmatrix} <br /> 8\\<br /> 4 <br /> \end{pmatrix} \begin{pmatrix} <br /> 17\\<br /> 1 <br /> \end{pmatrix}}{\begin{pmatrix} <br /> 25\\<br /> 5 <br /> \end{pmatrix}} = \frac{\frac{8!}{4!4!} * \frac{17!}{1!16!}}{\frac{25!}{5!20!}} = .0224

d.) \frac{\begin{pmatrix} <br /> 8\\<br /> 5 <br /> \end{pmatrix} \begin{pmatrix} <br /> 17\\<br /> 0 <br /> \end{pmatrix}}{\begin{pmatrix} <br /> 25\\<br /> 5 <br /> \end{pmatrix}} + AnswerToPartC = \frac{\frac{8!}{5!3!} * \frac{17!}{0!17!}}{\frac{25!}{5!20!}} + .0224 = .0235

Is this how it's done?
 
Yup, perfect.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top