document.write( "Question 841541: Premutations
\n" );
document.write( "1. How many numbers consisting of five digits each can be made from the digits 1,2,3,.......,9 if (a)the numbers must be odd (b) the first two digits of each number are even. [ans: (a) 8400 (b) 2520]
\n" );
document.write( "2. Solve the proceeding problem if repetitions of digits are allowed. \n" );
document.write( "
Algebra.Com's Answer #507216 by Edwin McCravy(20055)![]() ![]() You can put this solution on YOUR website! (a)the numbers must be odd \n" ); document.write( " \r\n" ); document.write( "Always choose the most restrictive digit first.\r\n" ); document.write( "\r\n" ); document.write( "Choose the last digit any of these: 1,3,5,7,9. That's 5 ways.\r\n" ); document.write( "Choose the first digit any of the 8 remaining ways.\r\n" ); document.write( "Choose the second digit any of the 7 remaining ways.\r\n" ); document.write( "Choose the third digit any of the 6 remaining ways.\r\n" ); document.write( "Choose the fourth digit any of the 5 remaining ways.\r\n" ); document.write( "\r\n" ); document.write( "Answer = 5 = 8400 \r\n" ); document.write( "\r\n" ); document.write( "2. Solve the proceeding problem if repetitions of digits are allowed. \r\n" ); document.write( "\r\n" ); document.write( "Always choose the most restrictive digit first.\r\n" ); document.write( "\r\n" ); document.write( "Choose the last digit any of these: 1,3,5,7,9. That's 5 ways.\r\n" ); document.write( "Choose the first digit any of the 9 ways.\r\n" ); document.write( "Choose the second digit any of the 9 ways.\r\n" ); document.write( "Choose the third digit any of the 9 ways.\r\n" ); document.write( "Choose the fourth digit any of the 9 ways.\r\n" ); document.write( "\r\n" ); document.write( "Answer = 5 = 32805\r\n" ); document.write( "\r\n" ); document.write( "Edwin\n" ); document.write( " |