document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1202146>Question 1202146</A>: <I><SPAN STYLE=\"word-break: break-all;\"> How many 8 digit numbers can be formed if the leading cannot be a zero and the last number cannot be 1 </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #836781 by </B><A HREF=/tutors/aboutme.mpl?userid=ikleyn><B>ikleyn(52814)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=ikleyn><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=ikleyn><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=836781\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> .\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "If repeating is allowed (which I can suppose from the context),\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "then the answer is 9*10*10*10*10*10*10*9 = 81,000,000.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Of 8 multipliers, two multipliers of 9 correspond to the first and the last positions, where restrictions are imposed;\r<BR>\n" );
document.write( "\n" );
document.write( "six multipliers of 10 correspond to six other positions with no restrictions.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );