document.write( "Question 410233:
\n" );
document.write( "How many three-digit numbers can be formed using elements from the set if no element may be used more than once in a number and the number must be odd? \n" );
document.write( "
Algebra.Com's Answer #288523 by stanbon(75887)![]() ![]() ![]() You can put this solution on YOUR website! How many three-digit numbers can be formed using elements from the set if no element may be used more than once in a number and the number must be odd? \n" ); document.write( "--------------- \n" ); document.write( "Hundreds digit: 9 ways \n" ); document.write( "Tens digit: 9 ways \n" ); document.write( "Ones digit: 5 ways \n" ); document.write( "----------------------- \n" ); document.write( "Total number: 9*9*5 = 405\r \n" ); document.write( "\n" ); document.write( "=============================== \n" ); document.write( "Cheers, \n" ); document.write( "Stan H. \n" ); document.write( "=========== \n" ); document.write( " |