document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=666393>Question 666393</A>: <I><SPAN STYLE=\"word-break: break-all;\"> A \"bit\" is a computer term for one of the digits 0 or 1. A \"bit-string\" of length 9 is a sequence of 9 digits, all of which are either 0 and 1. \r<BR>\n" );
document.write( "\n" );
document.write( "  a) How many bit strings of length 9 are there?  \r<BR>\n" );
document.write( "\n" );
document.write( "  b) How many bit strings are between 8 and 9 bits long? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #414447 by </B><A HREF=/tutors/aboutme.mpl?userid=swincher4391><B>swincher4391(1107)</B></A><img src=\"/images/stars/stars-12.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=swincher4391><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=swincher4391><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=414447\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> a) There 2*2*2*2*2*2 ... 9 times   =  2^9 = 512 bit strings of length 9.\r<BR>\n" );
document.write( "\n" );
document.write( "b) There are 2^8 bit strings of length 8, 2^9 of length 9. So there are 2^8 + 2^9 = 768 bit strings of length 8 or 9. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );