The number of four letter words that can be formed using the letters of the word BARRACK is:
We look at the seven letters of the word BARRACK. Writing them with their multiplicities, we have so that appears twice, appears twice, and appear once each. Thus the multiset of available letters is We must count every possible four-letter arrangement (a “word”) that can be formed from this multiset, taking care not to use any letter more often than it exists. The easiest way is to split the counting into mutually exclusive cases based on the repetition pattern inside each word.
Case 1: all four letters are distinct. First we select which four distinct letters will be used. There are five distinct symbols altogether——so
ways to pick the symbols. Once chosen, four different symbols can be arranged in
orders. Hence this case contributes
words.
Case 2: exactly one letter is repeated once, giving the pattern We proceed in two sub-steps.
• Step (a): choose which letter repeats. Only the letters with at least two copies, namely and qualify, so there are choices.
• Step (b): after fixing the repeated letter, we must pick two other distinct letters different from the repeated one. Excluding the chosen repeater leaves four distinct symbols, and we need any two of them, so
choices.
Multiplying, the number of different multisets of the form is
For any particular multiset containing two identical symbols and two different singles, the total permutations are
because dividing by corrects for the duplication of the repeated letter.
Therefore Case 2 yields
words.
Case 3: two different letters are each repeated twice, giving the pattern Because only and exist in duplicate, the only possible multiset is
The number of distinct arrangements is
Case 4: any pattern using three or four identical letters is impossible because no letter appears three or more times in BARRACK.
Adding the contributions from every feasible case, we obtain the grand total
Hence, the correct answer is Option D.
Tagged Permutations of letters and words, rank in dictionary. Machine-assigned, so read it as a strong shortlist rather than a verdict.