document.write( "Question 390902: How many ways are there to rearrange the letters in the word aptitude, if the first and last letter must each be a vowel? \n" ); document.write( "
Algebra.Com's Answer #277240 by josmiceli(19441)![]() ![]() You can put this solution on YOUR website! i'll take a stab at this: \n" ); document.write( "A list of the possible 1st letters with the possible last letters: \n" ); document.write( "a - - - -i, u, or e (3 choices) \n" ); document.write( "i - - - - a, u, or e (3 choices) \n" ); document.write( "u - - - -a, i, or e (3 choices) \n" ); document.write( "e - - - -a, u, or i (3 choices) \n" ); document.write( "This is 3 choices times 4, or 12 choices for the 1st and last \n" ); document.write( "letters being vowels. \n" ); document.write( "Suppose I pick \n" ); document.write( "a - - ptitud - - e for my 1st choice \n" ); document.write( "For the 2nd letter I have 6 choices \n" ); document.write( "For the 3rd letter I have 5 choices remaining \n" ); document.write( "For the 4th letter I have 4 choices remaining \n" ); document.write( "For the 5th letter I have 3 choices remaining \n" ); document.write( "For the 6th letter I have 2 choices remaining \n" ); document.write( "For the 7th letter I have 1 choice remaining \n" ); document.write( "Since the letters are 1st AND 2nd AND 3rd . . .etc. \n" ); document.write( "I must multiply the choices \n" ); document.write( " \n" ); document.write( "For each of my choices I have treated t and t as different \n" ); document.write( "letters, but they are not different, so each arrangement is \n" ); document.write( "counted twice, like: \n" ); document.write( "a - - tuitdp - - e and \n" ); document.write( "a - - tuitdp - - e \n" ); document.write( "So if I divide by \n" ); document.write( "arrangements I want \n" ); document.write( " \n" ); document.write( "Each of these \n" ); document.write( "ways I can pick letters for 1st and last, so \n" ); document.write( " |