SOLUTION: In a strings of length 9 with elements being a, b or c. How many strings will contain at least 6 b’s?

Algebra ->  Probability-and-statistics -> SOLUTION: In a strings of length 9 with elements being a, b or c. How many strings will contain at least 6 b’s?      Log On


   



Question 370137: In a strings of length 9 with elements being a, b or c. How many strings will contain at least 6 b’s?
Answer by robertb(5830) About Me  (Show Source):
You can put this solution on YOUR website!

The first term can be explained as follows: Pick any 6 places out of a possible 9. These places will be occupied by b's. The remaining three places can be filled by a or c (2 choices!), and can be done in 2%5E3+=+8 ways, assuming repetition. Same explanation applies for the other terms.