Ask your own question, for FREE!
Mathematics 17 Online
OpenStudy (lgbasallote):

in how many ways can LGBASALLOTE be arranged?

OpenStudy (lgbasallote):

i just want to see a demo on combination :p

OpenStudy (anonymous):

It can be arranged in 11! / 2! * 3! ways.

OpenStudy (lgbasallote):

how?

OpenStudy (anonymous):

Since L and A appear 3 and two times respectively, and it contains 11 letters.

OpenStudy (lgbasallote):

11 unique letters?

OpenStudy (lgbasallote):

so @Diyadiya can be rearranged in \[\frac{8!}{4!}\]

OpenStudy (kinggeorge):

Let's see then. We have 11 letters total, with 2 A's and 3 L's. So the total ways or arranging the letters is \(11!\). Now we need to get rid of the ones that are repeats. Because of the 2 A's, we divide by \(2!\) since there are \(2!\) ways of ordering the two A's. Likewise, we also divide by \(3!\) since there are \(3!\) orderings of the L's. Thus the total is \[{11!\over2!3!}\]

OpenStudy (kinggeorge):

Diyadiya could be arranged in \[8!\over2!2!2!2!\]ways since you have 4 letters that repeat twice.

OpenStudy (lgbasallote):

so total no. of letters! over product of how many times a letter repated!

OpenStudy (anonymous):

Yes. It's more appropriate to say, as KingGeorge already pointed out that Diyadiya can be arranged in 8!/2!2!2!2! ways rather than saying 8!/4!

OpenStudy (lgbasallote):

@KingGeorge can be rearranged in \[\large \frac{10!}{3!2!}\]

OpenStudy (kinggeorge):

I believe that's correct.

OpenStudy (lgbasallote):

and @Spacemanifestation can be rearranged in \[\large \frac{18!}{2!3!2!2!2!}\]

OpenStudy (lgbasallote):

i think i got it thanks :D

OpenStudy (diyadiya):

Thanks , Even i got to know to arrange myself =D

OpenStudy (lgbasallote):

but woudnt one rearrangement be disqualified? i mean when the second diya comes before the first diya? @KingGeorge

OpenStudy (kinggeorge):

But we can also switch only the d's. Or only the i's. Or maybe the d's and the y's. So there's \(2!2!2!2!=2^4\) ways we can switch things around like that.

OpenStudy (lgbasallote):

lol i dont want to look through this detailed-ly...too detailed :P

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!