document.write( "Question 416541: How many nine-bit strings contain exactly seven 1s? \r
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "

Algebra.Com's Answer #291826 by richard1234(7193) $\"\"$ $\"About$

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. \n" ); document.write( "

\n" );