document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=401664>Question 401664</A>: <I><SPAN STYLE=\"word-break: break-all;\"> how many bit string of length eight either start with a 1 bit or end with the two bits 00 </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #284284 by </B><A HREF=/tutors/aboutme.mpl?userid=Jk22><B>Jk22(389)</B></A><img src=\"/images/stars/stars-10.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=Jk22><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=Jk22><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=284284\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> <BR>\n" );
document.write( " <BR>\n" );
document.write( "We add the possibilities : if it starts with bit 1, but does not stop with 00 in order not to count doubly, we get : 2^5 for bits 2,3,4,5,6, times 3 possibilities for bits 7,8 should not equal 00, hence 32*3<BR>\n" );
document.write( " <BR>\n" );
document.write( "these possibilities have to be added to all cases where the first bit is 0, and the 2 last 00, which makes bits 2,3,4,5,6 free, or 2^5=32<BR>\n" );
document.write( " \r<BR>\n" );
document.write( "\n" );
document.write( "the total number of possibilities are then : 32*4=64*2=128 possibilities. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );