document.write( "Question 185458This question is from textbook saxon algebra 2
\n" ); document.write( ": A student is choosing a five-digit password. Only the digits 1 through 7 are allowed. How many passwords are possible if digits may not be repeated? \n" ); document.write( "

Algebra.Com's Answer #139131 by jim_thompson5910(35256) $\"\"$ $\"About$

You can put this solution on YOUR website!
Since \"Only the digits 1 through 7 are allowed\", this means that there are 7 digits available.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So you have 7 choices for the first slot. Afterwards, you have 6 choices for the second slot (since you cannot repeat digits). Then you have 5 choices for the 3rd, etc...\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So we have the following:\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "7*6*5*4*3=7*6*5*4*3=2,520\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So there are 2,520 different possible passwords\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "As an alternative, you can use a permutation to calculate the answer. \n" ); document.write( "

\n" );