document.write( "Question 484339: 1) A telephone number consists of seven digits. How many different telephone numbers exist if each digit appears only one time in the number? How would I solve this type of problem?\r
\n" );
document.write( "\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #331932 by sudhanshu_kmr(1152)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "For first digit, we can use any one of 9 digits, except 0 i.e (1,2,3,...9)\r \n" ); document.write( "\n" ); document.write( "for second digit, we can use any one of : 9 (except which is on first position)\r \n" ); document.write( "\n" ); document.write( "similarly, for third digit, we can use any one of : 8 (except first and second)\r \n" ); document.write( "\n" ); document.write( "and so on......\r \n" ); document.write( "\n" ); document.write( "number of possible numbers = 9*9*8*7*6*5*4 = 544320\r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |