document.write( "Question 1172924: A Discrete Mathematics student comes from the village of KILLAHOURAGAIN. As an hilarious jape, on the way home from
\n" ); document.write( "a late-night study session, he decides to rearrange the letters on
\n" ); document.write( "one of the sign-posts.
\n" ); document.write( "How many arrangements of the letters in KILLAHOURAGAIN
\n" ); document.write( "are possible?
\n" ); document.write( "Answer:
\n" ); document.write( "Of these arrangements, how many have all the L’s together?
\n" ); document.write( "Answer:
\n" ); document.write( "Of these arrangements, how may have all the letters in alphabetical order?
\n" ); document.write( "

Algebra.Com's Answer #798133 by greenestamps(13203)\"\" \"About 
You can put this solution on YOUR website!


\n" ); document.write( "(1) The name has 14 letters, including 3 of one letter and 2 each of two other letters. By a well known counting principle, the number of distinct arrangements is

\n" ); document.write( "\"14%21%2F%28%283%21%29%282%21%29%282%21%29%29\"

\n" ); document.write( "(2) To find the number of distinct arrangements with the two L's together, simply treat the two L's as a single \"letter\"; that gives 13 letters with 3 of one letter and 2 of another; the number of distinct arrangements is

\n" ); document.write( "\"13%21%2F%28%283%21%29%282%21%29%29\"

\n" ); document.write( "(3) There is only distinct arrangement in which all the letters are in alphabetical order.

\n" ); document.write( "
\n" ); document.write( "
\n" );