what is the logic behind 3!*4 to figure out the number of permutations where I's are together? I'd appreciate your insight
Thank you.
Bunuel
The letters D, G, I, I , and T can be used to form 5-letter strings as DIGIT or DGIIT. Using these letters, how many 5-letter strings can be formed in which the two occurrences of the letter I are separated by at least one other letter?
A) 12
B) 18
C) 24
D) 36
E) 48
1. It is an ordering, therefore a permutation problem
2. There is a constraint
3. The constraint is an "Atleast One" constraint. so the opposite of it "none" is easier to find
4. Total number of permutations is 5!/2!=60 ways since I repeats twice
5. Number of permutations where I's are together is 3!*4 = 24
6. Permutations with constraint is (4)-(5)=36