SOLUTION: Consider strings of length 9 with elements being a, b or c. How many
strings will contain at least 6 b’s?
Algebra.Com
Question 534218: Consider strings of length 9 with elements being a, b or c. How many
strings will contain at least 6 b’s?
Answer by stanbon(75887) (Show Source): You can put this solution on YOUR website!
Consider strings of length 9 with elements being a, b or c. How many
strings will contain at least 6 b’s?
---
# of strings with at least 6 b's = 9C6*2^3 + 9C7*2^2 + 9C8*3 + 9C9
----
= 84*8 + 36*4 + 27 + 1
---
= 844
============
Cheers,
Stan H.
RELATED QUESTIONS
In a strings of length 9 with elements being a, b or c. How many strings will contain at... (answered by robertb)
In a string of length 9 with elements being a, b or c. How many strings will contain at... (answered by edjones)
strings of length 9 with elements being a, b or c. How many strings will contain at least (answered by edjones)
Consider strings of length 6 which contain letters only from the set { P,Q,R,S,T} and... (answered by Edwin McCravy)
How many bit strings of length 4 contain either 3 consecutive 0s or 3 consecutive 1s?... (answered by greenestamps)
How many 11-bit strings (that is, bit strings of length 11) are there which:
a)Start... (answered by ikleyn)
consider strings of length 10 which contain only letters from the set{A,E,I,O,U} and... (answered by Edwin McCravy)
The letters C,I,R,C,L, and E can be used to form 6-letter strings such as CIRCLE or... (answered by ikleyn)
How many 12-bit strings (that is, bit strings of length 12) are there which:
have weight (answered by ikleyn)