I got to know about the derangemnt formula which can be found here: These are links to some excellent answers to this very topic.
So my problem is how to solve question when only some specific letters are asked to be repeated.
Like, consider the problems:
1)How many permutations of 1,... 8 are there in which no even number appears in its natural position?
( Yes I know this could be solved by principle of inclusion and exclusion but how to use the Rooks formula here?)
An excellent answer to this problem can be found on quora here. (Using princeple of inclusion exclusion)
Or also one more Interesting problem
2)Find the derangements of "ABHIBHAV"
Yes, these question are solved by Principle of inclusion and exclusion but those require a quite a bit tougher level of understanding to decipher problem rightly.. and recently I got to know about Rooks theorem, by which I tried many problems, which got solved but they were all based on "all letter have to be deranged types" so here in these kind of problem the case is different so my question is basically how to use that formula in these cases.
Any refferences for further read/ extra typical problems links would be also highly appreciated.