Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

"How many ways can the letters in the word SLUMGULLION be arranged so that the three L’s precede all the other consonants?"

My work is below: Can someone also solve this ONLY using the multiplication rule, permutations, and permutations with repetitions?

We have 3 L's and the other 4 consonants are S,M,G,N. That is, our consonants are LLLSMGN, call them all X for the moment. Then we have XXXXXXXUUIO. The number of arrangements of these letters is $\frac{11!}{7!2!}$. Hence the answer is $4!*\frac{11!}{7!2!}$ since there are $4!$ ways to arrange the 4 consonants other than the L's.

share|improve this question
1  
Hmm, I got the same answer as you. –  JohnJamesSmith Mar 26 '12 at 2:12
1  
Your reasoning is correct. I also solved the problem a different way (using combinations) and got the same answer. –  Brett Frankel Mar 26 '12 at 2:47

1 Answer 1

Your argument is fine (as previously noted), and there's probably no significantly better approach to counting them.

If you want to double-check your result, here's some GAP code which can list all the possibilities.

A:=["S","L","U","M","G","U","L","L","I","O","N"];
T:=Arrangements(A,Size(A));
count:=0;

for P in T do

  # where the last L is
  a:=Maximum(Positions(P,"L"));

  # where the first non-L consonant is
  b:=Minimum(Position(P,"S"),Position(P,"M"),Position(P,"G"),Position(P,"N"));

  if(b>a) then
    count:=count+1;
    Print(P,"\n");
  fi;

od;

Print(count,"\n");

and it found 95040, matching your result $4! \frac{11!}{7!\ 2!}$.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.