This skill involves determining the number of distinct linear arrangements of a finite collection containing repeated, indistinguishable elements, using , where is the total number of elements and are the multiplicities of each repeated type. The reasoning accounts for overcounting that occurs when identical elements are temporarily treated as distinct; the scope is ordinary unrestricted arrangements, not circular permutations, positional restrictions, or advanced enumeration methods.
When some elements are identical, use
where:
The denominator removes overcounting. If identical elements were temporarily labeled, such as and , swapping them would not create a new arrangement. Dividing by corrects for these duplicate arrangements.
Example: How many distinct arrangements can be made from the letters in BALLOON?
Step 1: Count all letters.
There are letters, so .
Step 2: Identify repeated letters.
Step 3: Substitute into the formula.
The repeated letters contribute for the Ls and for the Os:
Step 4: Calculate.
Therefore, there are
distinct linear arrangements of the letters in BALLOON.
Click a topic below to practice the foundational skills you'll need, learn the steps, or master this skill
Earned ?