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)\"\" \"About 
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( "\"3\" instances of the letter \"K\" ,
\n" ); document.write( "\"3\" instances of the letter \"Y\" ,
\n" ); document.write( "\"3\" instances of the letter \"L\" ,
\n" ); document.write( "\"2\" instances of the letter \"I\" ,
\n" ); document.write( "and \"1\" each of the \"4%7D%7D%7C+letters+%7B%7B%7BA\" , \"D\" , \"E\" , and \"O\" ,
\n" ); document.write( "for a total of \"3%2B3%2B3%2B2%2B4=15\" characters.
\n" ); document.write( "If we could distinguish between the repeated instances of the same letter,
\n" ); document.write( "we would see \"15%21\" different arrangements.
\n" ); document.write( "The \"3\" instances of the letter \"K\" can be arranged \"3%21=6\" different ways.
\n" ); document.write( "The same goes for
\n" ); document.write( "the \"3\" instances of the letter \"Y\" ,
\n" ); document.write( "\"3\" instances of the letter \"L\" , and
\n" ); document.write( "the \"3\" instances of the letter \"Y\" ,
\n" ); document.write( "\"3\" instances of the letter \"L\" ,
\n" ); document.write( "while the \"2\" instances of the letter \"I\" can be arranged \"2%21=2\" ways.
\n" ); document.write( "So, if the repeats of the same letter cannot be distinguished, we would see
\n" ); document.write( "\"highlight%2815%21%2F%283%21%2A3%21%2A3%21%2A2%21%29%29\" arrangements,
\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 \"3\" instances of the letter \"L\" ,
\n" ); document.write( "we have \"15-3=12\" characters, that can be arranged into
\n" ); document.write( "\"12%21%2F%283%21%2A3%21%2A2%21%29\" 12-letter \"words.\"
\n" ); document.write( "In each 12-letter \"word\", we can then intercalate the 3 L’s together in
\n" ); document.write( "\"12%2B1=13\" different positions:
\n" ); document.write( "before any of the 12 letter positions, or at the end.
\n" ); document.write( "We end up with \"highlight%2813%2A12%21%2F%283%21%2A3%21%2A2%21%29%29\" arrangements that have all the L’s together.\r
\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( "\"highlight%281%29\" prescribed arrangement, no choices,
\n" ); document.write( "unless we can distinguish between the repeated instances of the same letter.
\n" ); document.write( "
\n" );