document.write( "Question 153019: 1. Suppose you use five different letters to make a computer password. Find the number of possible five letter passwords.
\n" ); document.write( "I got 11,881,376 using the formula 26 C 5. Is this correct?\r
\n" ); document.write( "\n" ); document.write( "2. How many different ways can someone arrange 8 books on a shelf? I got 64.\r
\n" ); document.write( "\n" ); document.write( "3. If the first three digits of someone's phone number (no area code) are 555, how many different phone numbers could they have? I got 11,881,373
\n" ); document.write( "I used 26 to the 5th power. \r
\n" ); document.write( "\n" ); document.write( "Thanks for your help.
\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #112471 by jim_thompson5910(35256)\"\" \"About 
You can put this solution on YOUR website!
1) Here's a good question: is the password \"pass\" different from \"ssap\"? Since it is, this means that order matters. \r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Since order does matter, we must use the permutation formula:\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"n%21%2F%28n-r%29%21\" Start with the permutation formula\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"26%21%2F%2826-5%29%21\" Plug in \"n=26\" and \"r=5\"\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"26%21%2F21%21\" Subtract \"26-5\" to get 21\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Expand 26!
\n" ); document.write( "\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Expand 21!
\n" ); document.write( "\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " Cancel\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"26%2A25%2A24%2A23%2A22\" Simplify\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"7893600\" Now multiply 26*25*24*23*22 to get 7,893,600\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So there are 7,893,600 possible passwords\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "2)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "If order does matter, then the number of combinations is \"8%21=8%2A7%2A6%2A5%2A4%2A3%2A2%2A1=40320\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So there are 40,320 ways to rearrange the books\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "3)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Let's say that the format is \r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "(555)-xxx-xxxx\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So we have 7 slots we're dealing with. This means that \"r=7\". Since we have 10 numbers to choose from, this tells us that \"n=10\" (note: the \"26\" that you used implies that you'll be using letters). Also, because order matters, we must use the permutation formula:\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"n%21%2F%28n-r%29%21\" Start with the permutation formula\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"10%21%2F%2810-7%29%21\" Plug in \"n=10\" and \"r=7\"\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"10%21%2F3%21\" Subtract \"10-7\" to get 3\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Expand 10!
\n" ); document.write( "\"%2810%2A9%2A8%2A7%2A6%2A5%2A4%2A3%2A2%2A1%29%2F3%21\"\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Expand 3!
\n" ); document.write( "\"%2810%2A9%2A8%2A7%2A6%2A5%2A4%2A3%2A2%2A1%29%2F%283%2A2%2A1%29\"\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"%2810%2A9%2A8%2A7%2A6%2A5%2A4%2Across%283%2A2%2A1%29%29%2F%28cross%283%2A2%2A1%29%29\" Cancel\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"10%2A9%2A8%2A7%2A6%2A5%2A4\" Simplify\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"604800\" Now multiply 10*9*8*7*6*5*4 to get 604,800\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So there are 604,800 unique phone numbers to choose from.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );