document.write( "Question 636129: Please help. Completely lost...\r
\n" );
document.write( "\n" );
document.write( "In how many ways can the letters in the word TRANSPORTATION be arranged if the first letter must be an A and the last letter must not be a T?\r
\n" );
document.write( "\n" );
document.write( "Would really appreciate it \n" );
document.write( "
Algebra.Com's Answer #400753 by jim_thompson5910(35256)![]() ![]() ![]() You can put this solution on YOUR website! The first letter must be an A. So the word looks like\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "A _ _ _ _ _ _ ...\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "So you're really arranging 14-1 = 13 letters in 13 slots\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "The last letter must not be a T. So you have 13-1 = 12 choices for the last slot\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "The other slots go like this:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "You have 13-1 = 12 choices for the second slot (after you choose a letter that is not T for the last slot)\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "You have 12-1 = 11 choices for the third slot\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "You have 11-1 = 10 choices for the fourth slot\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "etc\r \n" ); document.write( "\n" ); document.write( "etc\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "all the way down to\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "You have 2 choices for the second to last slot\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "You have 1 choice for the last slot\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Multiply all these choices out:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "12*12*11*10*9*8*7*6*5*4*3*2*1 = 5748019200\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Now divide by 2!*2!*3! = 4*4*6 = 96 to get 5748019200/96 = 59,875,200\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "This is to correct for the duplicates\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "So there are 59,875,200 ways to arrange the letters.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Note: if you are entering this into an online system, then chances are that you'll have to enter the number WITHOUT commas \n" ); document.write( " |