Ctrl+k

Calculate permutations with repeated elements

This skill involves determining the number of distinct linear arrangements of a finite collection containing repeated, indistinguishable elements, using n!n1!n2!nk!\frac{n!}{n_1!n_2!\cdots n_k!}, where nn is the total number of elements and nin_i 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.

Detailed Explanation: Calculate permutations with repeated elements

When some elements are identical, use

n!n1!n2!nk!,\frac{n!}{n_1!n_2!\cdots n_k!},

where:

  • nn is the total number of elements,
  • n1,n2,,nkn_1,n_2,\ldots,n_k are the numbers of repeated copies of each type.

The denominator removes overcounting. If identical elements were temporarily labeled, such as L1L_1 and L2L_2, swapping them would not create a new arrangement. Dividing by 2!2! 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 77 letters, so n=7n=7.

Step 2: Identify repeated letters.

  • LL appears 22 times.
  • OO appears 22 times.
  • BB, AA, and NN each appear once.

Step 3: Substitute into the formula.

The repeated letters contribute 2!2! for the Ls and 2!2! for the Os:

Number of arrangements=7!2!2!.\text{Number of arrangements} = \frac{7!}{2!2!}.

Step 4: Calculate.

7!2!2!=504022=50404=1260.\frac{7!}{2!2!} = \frac{5040}{2\cdot 2} = \frac{5040}{4} = 1260.

Therefore, there are

1260\boxed{1260}

distinct linear arrangements of the letters in BALLOON.

Learn by doing: Calculate permutations with repeated elements

Click a topic below to practice the foundational skills you'll need, learn the steps, or master this skill

Practice with unlimited practice problems

Probability Counting - Duplicate Orders in 4 Letters, 1 Repeat - to Answer


    ?