document.write( "Question 928472: a code is to consist of three digits followed by three letters. Find the number of possible codes if the first cannot be 0 or 1 and replacement is not permitted? \n" ); document.write( "
Algebra.Com's Answer #569036 by tommyt3rd(5050)![]() ![]() You can put this solution on YOUR website! 1st digit: 8 choices \n" ); document.write( "2nd: 9 choices left \n" ); document.write( "3rd: 8 choices left \n" ); document.write( "1st letter: 26 choices \n" ); document.write( "2nd: 25 choices left \n" ); document.write( "3rd: 24 choices left \n" ); document.write( "Total: \n" ); document.write( "8*9*8*26*25*24 = 8985600 \n" ); document.write( " |