Number of arrangements: $ \frac{4!}{2!1!1!} = 12 $
["Understanding the Number of Arrangements: ( \frac{4!}{2!1!1!} = 12 )", "When exploring permutations in combinatorics, understanding how to calculate the number of distinct arrangements—especially when items are repeated—is essential for solving complex counting problems. A classic example involves the formula:", "[\n\frac{n!}{k_1! \cdot k_2! \cdots k_r!}\n]", "Where:\n- ( n ) is the total number of items,\n- ( k_1, k_2, \dots, k_r ) are the counts of each indistinguishable item (with repeated elements).", "### The Case: ( \frac{4!}{2!1!1!} = 12 )", "This formula applies when arranging 4 objects, where one object appears 2 times and two other distinct objects appear once each. For example, arranging the letters in the word "AABX" yields exactly 12 unique arrangements.", "Let’s break it down step-by-step:", "1. Total permutations without considering repetition:\n If all 4 objects were distinct, the total number of arrangements would simply be ( 4! = 24 ).", "2. Adjusting for repeated elements:\n Since the letter A appears twice and the others are unique, swapping the two identical A’s does not produce a new arrangement. Dividing by ( 2! ) corrects for this overcounting.", "3. Final formula application:\n [\n \frac{4!}{2! \cdot 1! \cdot 1!} = \frac{24}{2 \cdot 1 \cdot 1} = \frac{24}{2} = 12\n ]", "So, there are 12 distinct ways to arrange the letters in AABX (or similar arrangements with one pair and two unique items).", "### Why This Matters in Real-World Scenarios", "This principle applies across fields like genetics (counting DNA sequences with repeated nucleotides), computer science (generating unique permutations), and logistics (scheduling tasks with indistinguishable types). Mastery of this computation streamlines complex counting and underscores the elegance of combinatorial mathematics.", "---", "In summary:\nThe expression ( \frac{4!}{2!1!1!} = 12 ) elegantly calculates the number of possible unique arrangements when repetitions exist. By dividing factorials based on indistinguishable item counts, we accurately tally permutations without redundancy—core to solving permutation puzzles efficiently.", "---", "Keywords: arrangements formula, permutations with repetition, factorial division combinatorics, 4! over 2!1!1!, counting distinct arrangements, combinatorics explained, repeated items permutations."]
