91Ó°ÊÓ

When we arrange the letters of a word like SOCIOLOGICAL, which contains repetitions, the total number of distinct arrangements is called the permutation of a multiset. In a multiset, unlike an ordinary set, the elements can repeat. To calculate permutations of a multiset, you divide the factorial of the total number of elements by the product of factorials for each individual element's frequency.

For example, in SOCIOLOGICAL, there are 12 total letters. O appears 3 times, I twice, and L twice. The formula for permutation of such a multiset is \( \frac{12!}{3!2!2!} \), leading to 2,993,760 unique permutations. This method ensures that we don't overcount permutations where the repeated elements are indistinguishable from one another, thus providing the actual number of unique ways to arrange the letters.

Arranging elements with specific adjacency criteria, like ensuring that two particular letters are always side by side, requires us to modify our approach to permutation calculations. In our case, we treat the two letters A and G from SOCIOLOGICAL as a single combined entity, reducing the problem to arranging 11 entities rather than 12.

Additionally, since A and G are distinct, we can arrange them in 2! ways within their combined entity. Thus, we calculate the number of arrangements as if we're dealing with a multiset of 11, which includes our combined AG entity. Here the formula would be \( \frac{11! \times 2!}{3!2!2!} \), resulting in 997,920 permutations that satisfy the adjacency rule for A and G.

Dealing with vowel adjacency in permutations adds a layer of complexity to our calculations. For the word SOCIOLOGICAL, there are five vowels that we want to stick together: A, O, O, O and I, I. We treat all these vowels as one single block and then calculate the number of ways to arrange this block along with the other letters.

To illustrate: if we condense the vowels into a singular entity, it leaves us with 6 entities—S, C, L, L, G, and the vowel block. The arrangement of these 6 entities can be calculated using 6! permutations. Within this block, the individual vowels can be permuted in 5! ways, considering the repeated Os and Is. Taking the repetition of L into account, the final permutation formula for this scenario is \( \frac{6! \times 5! \times 2!}{2!} \), giving us a total of 86,400 arrangements where all vowels remain adjacent.