Hi, I'm curious...

Does anyone know a more general formula for derangements for groups that contain two or more indistinguishable elements?

For example, how many ways you could rearrange the letters in FOOLISH so that no letter ends up in the same spot?

i.e. In the new arrangement, the letter "O" can't appear in the second or third positions.

## Comments

Sort by:

TopNewestYou can label the similar letters as 1,2...., Now treat them as different letters .Now you can dearrange taking all the letters as different. As in this example FOOLISH YOU LABEL AS O1 AND O2 ANND NOW DERRANGE AS 7 DIFFERENT LETTERS . SUBTRACT CASES IN WHICH POSITION OF O1 AND O2 ARE INTERCHANGED AND OTHERS ARE DEARRANGED(AS REALLY O1AND O2 ARE INDISTINGUISHABLE).

EXTENDING THIS THOUGHT I FOUNDED A FORMULLA

DEARRANGEMENTS CONSIDERING ALL DIFFERENT - ( derangements of same letters considering them different*no of dearrangements of remaining letters)

Please tell whether my thought is correct or not. – Ayush Jain · 1 year, 2 months ago

Log in to reply

– Geoff Pilling · 1 year, 2 months ago

Thanks for your input Ayush! I'll need to think about it... For example, can you think of a generalized formula, for example, for GOOFING, where you have 2 pairs of identical letters, G and O?Log in to reply

Case1 when position of one of two different types of letters get rearranged say G . No of cases in which two G interchanged = dearrangement of remaining five letters. Case 2 position of O is interchanged No of such cases =derangement of remaining 5 letters.

Here no of cases in which both O and G interchanged position is counted twice . so should be deleted once = dearrangement of non common letters is 3

Extending this thought it can be formulates Let total no of letters be n, no of same letters of A type n(A) ........

No of dearrangements =derangements of n - No of cases deleted= n(A U B U C....) HERE IT IS N(AUB) = N(A) U N(B)-N(AΠB) PLEASE REPLY – Ayush Jain · 1 year, 2 months ago

Log in to reply

– Geoff Pilling · 1 year, 2 months ago

Interesting... Nice suggestion, Ayush! I'll need to think about this for a bit!Log in to reply

But going by basic approach we can solve these type of question. – Ayush Jain · 1 year, 2 months ago

Log in to reply

This should be helpful. – Prasun Biswas · 9 months, 1 week ago

Log in to reply

I would be interested about this too. I'm guessing that someone has calculated this value. – Calvin Lin Staff · 1 year, 2 months ago

Log in to reply

here but it would be great to see a more general solution! The one I have doesn't seem all that elegant. :/ – Geoff Pilling · 1 year, 2 months ago

I did put together a problem for a specific case, "FOOLING"Log in to reply