document.write( "Question 1001499: A Discrete Mathematics student comes from the village of KILLYIKYAKYODLE. As an hilarious jape, on the way home from a late-night study session, she decides to rearrange the letters on one of the sign-posts.
\n" );
document.write( "How many arrangements of the letters in KILLYIKYAKYODLE are possible?
\n" );
document.write( "i got 15!/3!*2!*3!*2! for this
\n" );
document.write( "Of these arrangements, how many have all the L’s together?
\n" );
document.write( "Of these arrangements, how may have all the letters in alphabetical order? \n" );
document.write( "
Algebra.Com's Answer #618779 by KMST(5328)![]() ![]() You can put this solution on YOUR website! How many arrangements of the letters in KILLYIKYAKYODLE are possible? \n" ); document.write( "There are \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "and \n" ); document.write( "for a total of \n" ); document.write( "If we could distinguish between the repeated instances of the same letter, \n" ); document.write( "we would see \n" ); document.write( "The \n" ); document.write( "The same goes for \n" ); document.write( "the \n" ); document.write( " \n" ); document.write( "the \n" ); document.write( " \n" ); document.write( "while the \n" ); document.write( "So, if the repeats of the same letter cannot be distinguished, we would see \n" ); document.write( " \n" ); document.write( "which I believe is what you meant to write.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Of these arrangements, how many have all the L’s together? \n" ); document.write( "If we do not include the \n" ); document.write( "we have \n" ); document.write( " \n" ); document.write( "In each 12-letter \"word\", we can then intercalate the 3 L’s together in \n" ); document.write( " \n" ); document.write( "before any of the 12 letter positions, or at the end. \n" ); document.write( "We end up with \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Of all the possible arrangements, how may have all the letters in alphabetical order? \n" ); document.write( "To have all the letters in alphabetical order, \n" ); document.write( "the first character must be A, \n" ); document.write( "the second character must be D, \n" ); document.write( "the third character must be E, \n" ); document.write( "the 2 I's must follow as the 4th and 5th characters, \n" ); document.write( "followed by the 3 K's, \n" ); document.write( "then the 3 L's, \n" ); document.write( "followed by the O, \n" ); document.write( "and ending with the 3 Y's. \n" ); document.write( "That is the prescribed order: \n" ); document.write( " \n" ); document.write( "unless we can distinguish between the repeated instances of the same letter. \n" ); document.write( " |