SOLUTION: How many nine-bit strings contain exactly seven 1s?
Algebra.Com
Question 416541: How many nine-bit strings contain exactly seven 1s?
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
With seven 1's there must also be two 0's. Thus, the number of ways to make a nine-bit string is 9C2 or 9C7 (this is equivalent to choosing two or seven out of nine placeholders to be 0's or 1's). 9C2 = 9C7 = 36.
RELATED QUESTIONS
How many bit strings of length 4 contain either 3 consecutive 0s or 3 consecutive 1s?... (answered by greenestamps)
1.How many bit strings of length 6 have:
(a) Exactly three 0s?
(b) The same number... (answered by stanbon)
how many bit strings of seven lowercase letters start with a vowel, if letters cannot be... (answered by edjones)
A binary number consists only 0s and 1s.
A) How may different seven-digit binary numbers (answered by Edwin McCravy)
How many 11-bit strings (that is, bit strings of length 11) are there which:
a)Start... (answered by ikleyn)
an 8 bit string is an 8-character long string where each character is either a 0 or 1.... (answered by stanbon)
How many 12-bit strings (that is, bit strings of length 12) are there which:
have weight (answered by ikleyn)
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 9 either begin with 2 bit(s) equal to 0 or end with 3... (answered by edjones)